Page 118 - Kaleidoscope Academic Conference Proceedings 2024
P. 118

2024 ITU Kaleidoscope Academic Conference




           [2] Katharina  Boudgoust,  Corentin  Jeudy,  Adeline  Email Communication" in ARES ’23: Proceedings of the
              Roux-Langlois, Weiqiang Wen "On the Hardness of    18th International Conference on Availability, Reliability
              Module Learning with Errors with Short Distributions,"  and Security.
              Journal of Cryptology, 2023, .
                                                              [14] Uddipana  Dowerah,  Srinivasan  Krishnaswamy
           [3] David Balbás, "The Hardness of LWE and Ring-LWE: A  "Towards an efficient LWE-based fully homomorphic
              Survey," Universidad Politécnica de Madrid, 8th October  encryption scheme", https://doi.org/10.1049/ise2.12052.
              2021.
                                                              [15] UAndrea Basso "Lattice-based cryptography and
           [4] C. Peikert., ". Public-key cryptosystems from the  SABER", in Quantum CS seminar, Budapest, 25 March
              worstcase shortest vector problem.," In Proc. 41st ACM  2021.
              Symp. on Theory of Computing (STOC), pages 333– 342.
                                                              [16] Yu Wei1,2, Lei Bi1,2* , Xianhui Lu1,2 and Kunpeng
              2009.
                                                                 Wang1,2 "LSecurity estimation of LWE via BKW
           [5] Roberto Avanzi, Joppe Bos, Léo Ducas, Eike Kiltz,  algorithms", in https://cybersecurity.springeropen.com/
              Tancrède Lepoint, Vadim Lyubashevsky, John M.      articles/10.1186/s42400-023-00158-9.
              Schanck, Peter Schwabe, Gregor Seiler, Damien   [17] Miklós Ajtai, Ravi Kumar, D. Sivakumar "A sieve
              Stehlé, "Algorithm Specifications And Supporting   algorithm for the shortest lattice vector problem", in
              Documentation (version 3.01)," in NIST PQC round 3,  STOC ’01: Proceedings of the thirty-third annual ACM
              January 31, 2021 .                                 symposium on Theory of computing July 2001.

           [6] Daniele  Micciancio  Oded  Regev,  "Lattice-based  [18] Andreas Hülsing, Joost Rijneveld, John Schanck, and
              Cryptography, IEEE, 2008.                          Peter Schwabe. "High-speed key encapsulation from
                                                                 NTRU". In Wieland Fischer and Naofumi Homma,
           [7] Huck Bennett†, "The Complexity of the Shortest Vector
                                                                 editors, in  Cryptographic Hardware and Embedded
              Problem," in Electronic Colloquium on Computational
                                                                 Systems – CHES 2017, LNCS. Springer, 2017.
              Complexity, Revision 1 of Report No. 170 (2022).
                                                              [19] Ziyu Zhao, Jintai Ding. "Practical Improvements on
           [8] Ajtai and Dwork, "A public-key cryptosystem with
                                                                 BKZ Algorithm", in NIST.
              worst-case/average-case equivalence" in STOC ’97:
              Proceedings of the twenty-ninth annual ACM symposium  [20] Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman.
              on Theory of computing.                            "NTRU: A Ring-Based Public Key Cryptosystem ",
                                                                 https://www.ntru.org/f/hps98.pdf.
           [9] Joppe Bos, Léo Ducas†, Eike Kiltz‡, Tancrède Lepoint§,
              Vadim Lyubashevsky¶, John M. Schanck, Peter Schwabe,  [21] Shi Bai, Léo Ducas, Eike Kiltz, Tancrède Lepoint,
              Gregor Seiler††, Damien Stehl采, , "CRYSTALS –    Vadim   Lyubashevsky,  Peter  Schwabe,  Gregor
              Kyber: a CCA-secure module-lattice-based KEM" in   Seiler and Damien Stehlé "CRYSTALS-Dilithium
              2018 IEEE European Symposium on Security and       Algorithm    Specifications  and    Supporting
              Privacy.                                           Documentation",    https://pq-crystals.org/dilithium/
                                                                 data/dilithium-specification-round3-20210208.pdf.
           [10] Applebaum, B.; Cash, D.; Peikert, C.; Sahai ,
              "A. Fast Cryptographic Primitives and Circular-Secure  [22] Shay Gueron1,2 and Fabian Schlieker3
              Encryption Based on Hard Learning Problems" in     "Speeding up R-LWE post-quantum key exchange ",
              Proceedings of the Advances in Cryptology-Crypto,  https://eprint.iacr.org/2016/467.pdf.
              International Cryptology Conference, Santa Barbara,
                                                              [23] A. Blum, A. Kalai, and H. Wasserman, "Noise-tolerant
              CA, USA, 16–20 August 2009.
                                                                 learning, the parity problem, and the statistical query
           [11] Lei Bi, Xianhui Lu, Junjie Luo, Kunpeng Wang Zhenfei  model ", in Journal of the ACM, 50(4):506–519, 2003..
              Zhang , "Hybrid dual attack on LWE with arbitrary
                                                              [24] M. Ajtai, R. Kumar, and D. Sivakumar "A sieve
              secrets" https://doi.org/10.1186/s42400-022-00115-y.
                                                                 algorithm for the shortest lattice vector problem. ", in In
           [12] Roberto Avanzi, Joppe Bos, Léo Ducas, Eike Kiltz,  Proc. 33rd Annual ACM Symp. on Theory of Computing
              Tancrède Lepoint, Vadim Lyubashevsky, John M.      (STOC), pages 601–610. 2001.
              Schanck, Peter Schwabe, Gregor Seiler, Damien Stehlé
                                                              [25] D. Micciancio and P. Voulgaris. "A deterministic single
              , "ACRYSTALS-Kyber Algorithm Specifications And
                                                                 exponential time algorithm for most lattice problems
              Supporting Documentation (version 3.01)" in NIST
                                                                 based on Voronoi cell computations. ", in In STOC.
              round 3 submission https://pq-crystals.org/kyber/data/
                                                                 2010.
              kyber-specification-round3-20210131.pdf.
                                                              [26] Xue Zhang, Zhongxiang Zheng Xiaoyun Wang "A
           [13] Christoph Döberl, Wolfgang Eibner ,Simon Gärtner,
                                                                 detailed analysis of primal attack and its variants. ", https:
              Manuela Kos, Florian Kutschera Sebastian Ramacher
                                                                 //link.springer.com/article/10.1007/s11432-020-2958-9
              "Quantum-resistant End-to-End Secure Messaging and

                                                           – 74 –
   113   114   115   116   117   118   119   120   121   122   123