pith. sign in

arxiv: 2606.18920 · v1 · pith:37OGYXCInew · submitted 2026-06-17 · 🧮 math.NT · cs.CR· cs.IT· math.IT

Structured lattices and their applications to security

Lenny Fukshansky , Camilla Hollanti , Rahinatou Y. Njah Nchiwo This is my paper

Pith reviewed 2026-06-26 19:33 UTC · model grok-4.3

classification 🧮 math.NT cs.CRcs.ITmath.IT
keywords structured latticeswell-rounded latticesnumber field extensionslattice-based cryptographywireless communications securitysphere packingMinkowski conjecture
0
0 comments X

The pith

Structured lattices from number field extensions connect geometry to applications in cryptography and wireless security.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper surveys structured lattices, with emphasis on well-rounded examples built from number field extensions. These objects tie into classical problems such as densest sphere packing and minimization of theta functions, while also supplying algebraic structure for practical security tasks. A sympathetic reader would see the survey as a bridge that makes number-theoretic constructions available to researchers working on post-quantum cryptography and physical-layer security in communications. The authors aim to draw attention to recent constructions that sit at the intersection of these areas.

Core claim

Euclidean lattices with additional structure arising from number field extensions, particularly the well-rounded subclass, relate to the Minkowski and Woods conjectures and to sphere-packing questions; the same constructions supply the algebraic framework used in recent lattice-based cryptographic schemes and in secure wireless communication protocols.

What carries the argument

Well-rounded lattices constructed from number field extensions, which furnish both geometric density properties and algebraic symmetry for cryptographic and communication applications.

If this is right

  • Structured lattices supply explicit algebraic codes that can be used directly in lattice-based cryptographic protocols.
  • The same lattices yield codebooks for physical-layer security schemes in wireless networks.
  • Geometric properties of well-rounded lattices translate into concrete bounds on the hardness or efficiency of the resulting security primitives.
  • Mathematicians working on sphere-packing or theta-series questions gain new motivation from the cryptographic and communication uses.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Further study of these lattices could produce new families of codes that simultaneously optimize geometric density and cryptographic security parameters.
  • The survey framework may help identify open number-theoretic questions whose resolution would directly improve concrete security levels in deployed systems.
  • Cross-disciplinary reading of the constructions could suggest lattice-based methods for error correction or signal processing outside the security setting.

Load-bearing premise

The cited constructions from number field extensions are both recent and representative of the most relevant work linking lattices to cryptography and wireless security.

What would settle it

A review or experiment showing that the lattice constructions discussed do not in fact deliver the claimed security or communication advantages when implemented.

Figures

Figures reproduced from arXiv: 2606.18920 by Camilla Hollanti, Lenny Fukshansky, Rahinatou Y. Njah Nchiwo.

Figure 1
Figure 1. Figure 1: Similarity classes of lattices in R 2 with WR and semi￾stable subregions marked by colors. Further, the question of distribution of WR sublattices of a given lattice L ⊂ R 2 has been investigated by several authors via analysis of the properties of the so￾called WR zeta-function ζWR(s) = X∞ k=1 akk −s , where ak is the number of WR sublattices of L of index k and s is a complex variable. Information about … view at source ↗
read the original abstract

Euclidean lattices are an interesting object of study in many regards and can have a rich structure arising from various constructions, e.g., from number field extensions. A particularly interesting class is the one of well-rounded lattices, as they relate to the well-known densest sphere packing problem in geometry, theta function minimization, and the famous Minkowski and Woods conjectures. In addition to being an important mathematical object in their own right, lattices also play a central role in many applications. This paper offers a survey of structured lattices and discusses their recent applications in lattice-based cryptography and secure wireless communications. Our goal is to spark the interest of mathematicians and adjacent communities in these fascinating topics in the intersection of lattices, number theory, cryptography, and wireless communications.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript is a survey of structured Euclidean lattices, with emphasis on well-rounded lattices arising from number-field constructions. It connects these objects to the sphere-packing problem, theta-series minimization, and the Minkowski and Woods conjectures, then surveys their recent uses in lattice-based cryptography and secure wireless communications, with the stated goal of encouraging cross-community interest.

Significance. A balanced, up-to-date survey at the intersection of algebraic number theory, lattice geometry, post-quantum cryptography, and wireless security could be a useful reference and catalyst for new work. Its value hinges on accurate representation of the cited constructions and on whether the selected applications are representative rather than merely illustrative.

minor comments (3)
  1. The abstract states that the survey covers 'recent applications,' yet the provided text does not list the specific papers or constructions reviewed; a table or explicit bibliography section enumerating the key references would clarify scope and completeness.
  2. Notation for lattice constructions (e.g., how number-field embeddings yield well-rounded lattices) is introduced only at a high level; a short dedicated subsection with one or two concrete examples and their parameters would improve accessibility for readers outside number theory.
  3. The manuscript should explicitly state its coverage criteria (time period, subfields, or selection methodology) to allow readers to assess whether important recent works in lattice-based crypto or wireless security have been omitted.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of the manuscript as a balanced survey at the intersection of algebraic number theory, lattice geometry, post-quantum cryptography, and wireless security, and for the recommendation of minor revision. The report does not raise any specific major comments.

Circularity Check

0 steps flagged

Survey paper contains no derivations or predictions

full rationale

This is a survey paper whose abstract and content explicitly frame it as a review of existing constructions in structured lattices, well-rounded lattices from number fields, and their applications in cryptography and wireless communications. No original derivations, equations, predictions, or fitted parameters are introduced. The central claim is simply the scope of the survey itself, with no load-bearing steps that reduce to self-definition, fitted inputs, or self-citation chains. All cited work is treated as external literature.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a survey paper; the abstract introduces no new free parameters, axioms, or invented entities. All content is drawn from existing literature on lattices.

pith-pipeline@v0.9.1-grok · 5659 in / 1026 out tokens · 24835 ms · 2026-06-26T19:33:17.118651+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

186 extracted references · 2 canonical work pages

  1. [1]

    Aguilar Melchor, J

    C. Aguilar Melchor, J. Barrier, L. Fousse, and M.-O. Killijian. XPIR : Private information retrieval for everyone.Proceedings on Privacy Enhancing Technologies, pages 155–174, Apr 2016

    2016

  2. [2]

    Aharonov and O

    D. Aharonov and O. Regev. Lattice problems in NP∩coNP.J. ACM, 52(5):749–765, Sept. 2005

    2005

  3. [3]

    Ahola, I

    J. Ahola, I. Blanco-Chac´ on, W. Bola˜ nos, A. Haavikko, C. Hollanti, and R. M. S´ anchez- Ledesma. Fast multiplication and the PLWE–RLWE equivalence for an infinite family of maximal real subfields of cyclotomic fields.Designs, Codes and Cryptography, 93:2947–2969, 2025

    2025

  4. [4]

    M. Ajtai. Generating hard instances of lattice problems. InProceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 99–108, 1996

    1996

  5. [5]

    M. Ajtai. The shortest vector problem in l2 is np-hard for randomized reductions. InPro- ceedings of the thirtieth annual ACM symposium on Theory of computing, pages 10–19, 1998

    1998

  6. [6]

    Alves, J

    C. Alves, J. E. Strapasson, and R. R. de Araujo. On well-rounded lattices and lower bounds for the minimum norm of ideal lattices.Arch. Math. (Basel), 124(2):121–130, 2025

    2025

  7. [7]

    Y. Andr´ e. On nef and semistable hermitian lattices, and their behaviour under tensor prod- uct.Tohoku Math. J. (2), 63(4):629–649, 2011

    2011

  8. [8]

    Arora, L

    S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations.Journal of Computer and System Sciences, 54(2):317–331, 1997

    1997

  9. [9]

    Ash and M

    A. Ash and M. McConnell. Cohomology at infinity and the well-rounded retract for general linear groups.Duke Math. J., 90(3):549–576, 1997

    1997

  10. [10]

    Ate¸ s and H

    L. Ate¸ s and H. Stichtenoth. A note on short vectors in lattices from function fields.Finite Fields Appl., 39:264–271, 2016

    2016

  11. [11]

    Avanzi, J

    R. Avanzi, J. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J. M. Schanck, P. Schwabe, G. Seiler, D. Stehl´ e, et al. Crystals-kyber algorithm specifications and sup- porting documentation.NIST PQC Round, 2(4):1–43, 2019

    2019

  12. [12]

    Baake, R

    M. Baake, R. Scharlau, and P. Zeiner. Well-rounded sublattices of planar lattices.Acta Arith, 166(4):301–334, 2014

    2014

  13. [13]

    Babinkostova, A

    L. Babinkostova, A. Chin, A. Kirtland, V. Nazarchuk, and E. Plotnick. The polynomial learning with errors problem and the smearing condition.Journal of Mathematical Cryptol- ogy, 16(1):215–232, 2022

    2022

  14. [14]

    R. Bacher. Constructions of some perfect integral lattices with minimum 4.J. Th´ eor. Nom- bres Bordeaux, 27(3):655–687, 2015

    2015

  15. [15]

    R. Bacher. On the number of perfect lattices.J. Th´ eor. Nombres Bordeaux, 30(3):917–945, 2018

    2018

  16. [16]

    Baraniuk, S

    R. Baraniuk, S. Dash, and R. Neelamani. On nearly orthogonal lattice bases.SIAM J. Discrete Math., 21(1):199–219, 2007

    2007

  17. [17]

    Barbero-Lucas, I

    B. Barbero-Lucas, I. Blanco-Chac´ on, R. Dur´ an-D´ ıaz, R. Y. N. Nchiwo, and R. M. S´ anchez- Ledesma. Cryptanalysis of PLWE based on zero-trace quadratic roots.Accepted for publi- cation in Journal of Mathematical Cryptology, 2026

    2026

  18. [18]

    Barreal.Lattice Codes for Physical Layer Communications

    A. Barreal.Lattice Codes for Physical Layer Communications. PhD thesis, Aalto University publication series Doctoral Theses, 71/2017, 2017

    2017

  19. [19]

    Barreal, M

    A. Barreal, M. T. Damir, R. Freij-Hollanti, and C. Hollanti. An approximation of theta functions with applications to communications.SIAM Journal on Applied Algebra and Ge- ometry, 4(4):471–501, 2020

    2020

  20. [20]

    Barreal, A

    A. Barreal, A. Karrila, D. A. Karpuk, and C. Hollanti. Information bounds and flatness factor approximation for fading wiretap MIMO channels. InIEEE International Telecom- munications Networks and Applications Conference, pages 277–282, 2016

    2016

  21. [21]

    S. C. Batson. The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings.Int. J. Number Theory, 13(9):2277–2297, 2017

    2017

  22. [22]

    Bayer-Fluckiger

    E. Bayer-Fluckiger. Ideal lattices. InA panorama of number theory or the view from Baker’s garden (Z¨ urich, 1999), pages 168–184. Cambridge Univ. Press, Cambridge, 2002

    1999

  23. [23]

    Bayer-Fluckiger and G

    E. Bayer-Fluckiger and G. Nebe. On the euclidean minimum of some real number fields.J. Th´ eor. Nombres Bordeaux, 17(2):437–454, 2005. STRUCTURED LATTICES 33

    2005

  24. [24]

    Belfiore and F

    J.-C. Belfiore and F. Oggier. Lattice code design for the Rayleigh fading wiretap channel. In2011 IEEE International Conference on Communications Workshops (ICC), pages 1–5, 2011

    2011

  25. [25]

    Belfiore and F

    J.-C. Belfiore and F. E. Oggier. Secrecy gain: A wiretap lattice code design.2010 Interna- tional Symposium On Information Theory and Its Applications, pages 174–178, 2010

    2010

  26. [26]

    J. Benaloh. Dense probabilistic encryption. InProceedings of the Workshop on Selected Areas in Cryptography (SAC), 1994

    1994

  27. [27]

    Blanco-Chac´ on

    I. Blanco-Chac´ on. On the RLWE/PLWE equivalence for cyclotomic number fields.Applica- ble Algebra in Engineering, Communication and Computing, 33(1):53–71, 2022

    2022

  28. [28]

    Blanco-Chac´ on, B

    I. Blanco-Chac´ on, B. Barbero-Lucas, R. Dur´ an-D´ ıaz, and R. Y. Njah Nchiwo. Trace-based cryptanalysis of cyclotomicR q,0 ×R q-PLWE for the non-split case.Communications in Mathematics, 31, 2023

    2023

  29. [29]

    Blanco Chac´ on, R

    I. Blanco Chac´ on, R. Dur´ an D´ ıaz, and R. Mart´ ın S´ anchez-Ledesma. A generalized approach to root-based attacks against PLWE.Cryptography and Communications, pages 1–45, 2025

    2025

  30. [30]

    Blanco-Chac´ on, A

    I. Blanco-Chac´ on, A. Pedrouzo-Ulloa, R. Y. Njah Nchiwo, and B. Barbero-Lucas. Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields.Cryp- tography and Communications, pages 1–35, 2025

    2025

  31. [31]

    Bloch, O

    M. Bloch, O. G¨ unl¨ u, A. Yener, F. Oggier, H. V. Poor, L. Sankar, and R. F. Schaefer. An overview of information-theoretic security and privacy: Metrics, limits and applications. IEEE Journal on Selected Areas in Information Theory, 2(1):5–22, 2021

    2021

  32. [32]

    Bola˜ nos, A

    W. Bola˜ nos, A. Haavikko, and R. M. S´ anchez-Ledesma. A fast multiplication algorithm and RLWE-PLWE equivalence for the maximal real subfield of the 2rps-th cyclotomic field. Advances in Mathematics of Communications, 21:212–238, 2026

    2026

  33. [33]

    Bola˜ nos and G

    W. Bola˜ nos and G. Mantilla-Soler. The trace form over cyclic number fields.Canad. J. Math., pages 1–23, 2020

    2020

  34. [34]

    Bollauf, H.-Y

    M. Bollauf, H.-Y. Lin, and O. Ytrehus. Secrecy gain of formally unimodular lattices from codes over the integers modulo 4.IEEE Transactions on Information Theory, 2024

    2024

  35. [35]

    M. F. Bollauf and H.-Y. Lin. On the maximum flatness factor over unimodular lattices. arXiv preprint arXiv:2403.16932, 2024

    work page arXiv 2024

  36. [36]

    M. F. Bollauf and H.-Y. Lin. Generalized theta series of a lattice. In2025 IEEE Information Theory Workshop (ITW), pages 827–832, 2025

    2025

  37. [37]

    Bondarenko, D

    A. Bondarenko, D. Radchenko, and M. Viazovska. Optimal asymptotic bounds for spherical designs.Ann. of Math. (2), 178(2):443–452, 2013

    2013

  38. [38]

    B¨ ottcher, S

    A. B¨ ottcher, S. Eisenbarth, L. Fukshansky, S. R. Garcia, and H. Maharaj. Spherical 2-designs and lattices from abelian groups.Discrete Comput. Geom., 61(1):123–135, 2019

    2019

  39. [39]

    B¨ ottcher, L

    A. B¨ ottcher, L. Fukshansky, S. R. Garcia, and H. Maharaj. On lattices generated by finite abelian groups.SIAM J. Discrete Math., 29(1):382–404, 2015

    2015

  40. [40]

    B¨ ottcher, L

    A. B¨ ottcher, L. Fukshansky, S. R. Garcia, and H. Maharaj. Lattices from hermitian function fields.J. Algebra, 447:560–579, 2016

    2016

  41. [41]

    B¨ ottcher, L

    A. B¨ ottcher, L. Fukshansky, S. R. Garcia, H. Maharaj, and D. Needell. Lattices from equian- gular tight frames.Linear Algebra Appl., 510:395–420, 2016

    2016

  42. [42]

    Boudgoust, C

    K. Boudgoust, C. Jeudy, A. Roux-Langlois, and W. Wen. On the hardness of module learning with errors with short distributions.Journal of Cryptology, 36(1), 2023

    2023

  43. [43]

    Brakerski, C

    Z. Brakerski, C. Gentry, and V. Vaikuntanathan. (leveled) fully homomorphic encryption without bootstrapping.ACM Transactions on Computation Theory (TOCT), 6(3):1–36, 2014

    2014

  44. [44]

    Brakerski and V

    Z. Brakerski and V. Vaikuntanathan. Fully homomorphic encryption from ring-LWE and security for key dependent messages. InAnnual cryptology conference, pages 505–524. Springer, 2011

    2011

  45. [45]

    Casselman

    B. Casselman. Stability of lattices and the partition of arithmetic quotients.Asian J. Math., 8:607–637, 2004

    2004

  46. [46]

    J. W. S. Cassels. On a problem of Rankin about the Epstein zeta-function.Proc. Glasgow Math. Assoc., 4:73–80 (1959), 1959

    1959

  47. [47]

    Castryck, I

    W. Castryck, I. Iliashenko, and F. Vercauteren. Provably weak instances of ring-LWE re- visited. InAnnual international conference on the theory and applications of cryptographic techniques, pages 147–167. Springer, 2016

    2016

  48. [48]

    Chen and L

    H. Chen and L. Xu. Counterexamples to the Woods conjecture in dimensionsd≥24.J. Th´ eor. Nombres Bordeaux, 31(3):723–726, 2019. 34 LENNY FUKSHANSKY, CAMILLA HOLLANTI, AND RAHINATOU Y. NJAH NCHIWO

    2019

  49. [49]

    Y. X. Chew and F. Oggier. Well-rounded ideal lattices from totally definite quaternion algebras, 2025

    2025

  50. [50]

    D. P. Chi, J. W. Choi, J. San Kim, and T. Kim. Lattice based cryptography for beginners. Cryptology ePrint Archive, 2015

    2015

  51. [51]

    B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval.J. ACM, 45(6):965–981, nov 1998

    1998

  52. [52]

    Chorti, C

    A. Chorti, C. Hollanti, J. Belfiore, and H. Poor.Physical layer security: A paradigm shift in data confidentiality, volume 358 ofSpringer Lecture Notes in Electrical Engineering, pages 1–15. Springer, 2016

    2016

  53. [53]

    Chorti, S

    A. Chorti, S. Tomasin, M. Baldi, S. Delbruel, and G. Karabulut Kurt (editors). 2025 work- ing group white paper, security and privacy.https://futurenetworks.ieee.org/roadmap/ physical-layer-security-focus-group, 2025. IEEE Focus Group on Physical Layer Secu- rity, International Networks Generations Roadmap (INGR)

    2025

  54. [54]

    H. Cohn, A. Kumar, S. D. Miller, D. Radchenko, and M. S. Viazovska. The sphere packing problem in dimension 24.Ann. of Math. (2), 185(3):1017–1033, 2017

    2017

  55. [55]

    P. E. Conner and R. Perlis.A Survey of Trace Forms of Algebraic Number Fields. World Scientific, 1984

    1984

  56. [56]

    J. H. Conway and N. J. A. Sloane. A lattice without a basis of minimal vectors.Mathematika, 42(1):175–177, 1995

    1995

  57. [57]

    J. H. Conway and N. J. A. Sloane.Sphere Packings, Lattices, and Groups. Springer-Verlag, Third edition, 1999

    1999

  58. [58]

    S. I. Costa, F. Oggier, A. Campello, J.-C. Belfiore, and E. Viterbo.Lattices Applied to Coding for Reliable and Secure Communications. Springer, 2017

    2017

  59. [59]

    Coulangeon

    R. Coulangeon. Spherical designs and zeta functions of lattices.Int. Math. Res. Not., pages Art. ID 49620, 16, 2006

    2006

  60. [60]

    T. M. Cover and J. A. Thomas.Elements of Information Theory. John Wiley & Sons, Ltd, 2005

    2005

  61. [61]

    Dam, T.-H

    D.-T. Dam, T.-H. Tran, V.-P. Hoang, C.-K. Pham, and T.-T. Hoang. A survey of post- quantum cryptography: Start of a new race.Cryptography, 7(3):40, 2023

    2023

  62. [62]

    M. T. Damir.Well-Rounded Lattices and Applications to Physical Layer Security. PhD thesis, Aalto University publication series Doctoral Theses, 160/2020, 2020

    2020

  63. [63]

    M. T. Damir and L. Fukshansky. Canonical basis twists of ideal lattices from real quadratic number fields.Houston J. Math., 45(4):999–1019, 2019

    2019

  64. [64]

    M. T. Damir, O. Gnilke, L. Amor´ os, and C. Hollanti. Analysis of some well-rounded lattices in wiretap channels. InIEEE Int. Workshop on Signal Process. Adv. in Wireless Commun., pages 1–5, 2018

    2018

  65. [65]

    M. T. Damir and D. Karpuk. Well-rounded twists of ideal lattices from real quadratic fields. J. Number Theory, 196:168–196, 2019

    2019

  66. [66]

    M. T. Damir, A. Karrila, L. Amoros, O. W. Gnilke, D. Karpuk, and C. Hollanti. Well- rounded lattices: towards optimal coset codes for Gaussian and fading wiretap channels. IEEE Trans. Inform. Theory, 67(6):3645–3663, 2021. part 2

    2021

  67. [67]

    M. T. Damir and G. Mantilla-Soler. Bases of minimal vectors in tame lattices.Acta Arith, 205:265–285, 2022

    2022

  68. [68]

    R. R. de Araujo and S. I. R. Costa. Well-rounded algebraic lattices in odd prime dimension. Arch. Math. (Basel), 112(2):139–148, 2019

    2019

  69. [69]

    R. R. de Araujo, A. de Andrade, T. d. N´ obrega Neto, and J. Bastos. Constructions of well- rounded algebraic lattices over odd prime degree cyclic number fields.Commun. Math., 33(1), 2025. Paper No. 6. 18 pp

    2025

  70. [70]

    B. N. Delone and S. S. Ryshkov. A contribution to the theory of the extrema of a multi- dimensionalζ-function.Doklady Akademii Nauk, 173(5):991–994, 1967

    1967

  71. [71]

    Delsarte, J

    P. Delsarte, J. M. Goethals, and J. J. Seidel. Spherical codes and designs.Geometriae Dedicata, 6(3):363–388, 1977

    1977

  72. [72]

    A. J. Di Scala, C. Sanna, and E. Signorini. RLWE and PLWE over cyclotomic fields are not equivalent.Applicable Algebra in Engineering, Communication and Computing, 35(3):351– 358, 2024

    2024

  73. [73]

    P. H. Diananda. Notes on two lemmas concerning the Epstein zeta-function.Proc. Glasgow Math. Assoc., 6:202–204 (1964), 1964. STRUCTURED LATTICES 35

    1964

  74. [74]

    Diffie and M

    W. Diffie and M. E. Hellman.New Directions in Cryptography, pages 365–390. Association for Computing Machinery, New York, NY, USA, 1 edition, 2022

    2022

  75. [75]

    Dinur, G

    I. Dinur, G. Kindler, and S. Safra. Approximating CVP to within almost-polynomial factors is NP-hard. InProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), pages 99–109. IEEE, 1998

    1998

  76. [76]

    Ducas and A

    L. Ducas and A. Durmus. Ring-LWE in polynomial rings. InInternational Workshop on Public Key Cryptography, pages 34–51. Springer, 2012

    2012

  77. [77]

    R. G. L. D’Oliveira and S. E. Rouayheb. A guided walk through coded private information retrieval.IEEE BITS the Information Theory Magazine, 3(4):51–66, 2023

    2023

  78. [78]

    Eisentr¨ ager, S

    K. Eisentr¨ ager, S. Hallgren, and K. Lauter. Weak instances of PLWE. InInternational Conference on Selected Areas in Cryptography, pages 183–194. Springer, 2014

    2014

  79. [79]

    T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. InAdvances in Cryptology – CRYPTO 1984, pages 10–18, 1985

    1984

  80. [80]

    Elias, K

    Y. Elias, K. E. Lauter, E. Ozman, and K. E. Stange. Provably weak instances of Ring-LWE. InAnnual Cryptology Conference, pages 63–92. Springer, 2015

    2015

Showing first 80 references.