Protocolo para el intercambio de claves criptográficas basado en el problema “learning with rounding”
Palabras clave:
protocolos de intercambio de claves, criptografía asimétrica, criptografía postcuánticaResumen
La mayoría de los protocolos de intercambio de claves utilizados con mayor frecuencia se basan en la suposición de que los problemas del logaritmo discreto y la factorización de ciertos números son problemas difı ́ciles de resolver. Sin embargo, dicha suposición no se cumple si utilizamos computadoras cuánticas. En este trabajo se propone un protocolo para el intercambio de claves criptográficas basado en el problema Learning with Rounding (LWR), el cual es inmune a la computación cuántica.Descargas
Citas
Hayo Baan, Sauvik Bhattacharya, Oscar GarciaMorchon, Ronald Rietman, Ludo Tolhuizen, Jose-Luis Torre-Arce, and Zhenfei Zhang. Round2: Kem and pke based on glwr. Cryptology ePrint Archive, Report 2017, 2017. http://eprint.iacr.org/2017.
Abhishek Banerjee, Chris Peikert, and Alon Rosen. Pseudorandom functions and lattices. Cryptology ePrint Archive, Report 2011/401, 2011. http://eprint. iacr.org/2011/401.
Sauvik Bhattacharya, Oscar Garcia-Morchon, Ronald Rietman, and Ludo Tolhuizen. spkex: An optimized lattice-based key-exchange. Cryptology ePrint Archive, Report 2017, 2017. http://eprint.iacr.org/ 2017.
Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, and Alon Rosen. On the hardness of learning with rounding over small modulus. Cryptology ePrint Archive, Report 2015, 2015. http://eprint.iacr. org/2015.
Joppe Bos, Craig Costello, Leo Ducas, Ilya Mironov, Michael Naehrig, Valeria Nikolaenko, Ananth Raghunathan, and Douglas Stebila. Frodo: Take off the ring! practical, quantum-secure key exchange from lwe. Cryptology ePrint Archive, Report 2016/659, 2016. http: //eprint.iacr.org/2016/659.
Joppe W. Bos, Craig Costello, Michael Naehrig, and Douglas Stebila. Post-quantum key exchange for the tls protocol from the ring learning with errors problem. Cryptology ePrint Archive, Report 2014/599, 2014. http://eprint.iacr.org/.
Long Chen, Zhenfeng Zhang, and Zhenfei Zhang. On the hardness of the computational ring-lwr problem and its applications. Cryptology ePrint Archive, Report 2018, 2018. http://eprint.iacr.org/2018.
Jung Hee Cheon, Kyoo Hyung Han, Jinsu Kim, Changmin Lee, and Yongha Son. A practical post-quantum public-key cryptosystem based on splwe. Cryptology ePrint Archive, Report 2016/1055, 2016. http:// eprint.iacr.org/2016/1055.
Jung Hee Cheon, Duhyeong Kim, Joohee Lee, and Yongsoo Song. Lizard: Cut off the tail! practical postquantum public-key encryption from lwe and lwr. Cryptology ePrint Archive, Report 2016/1126, 2016. http: //eprint.iacr.org/2016/1126.
Jan-Pieter D’Anvers, Angshuman Karmakar, Sujoy Sinha Roy, and Frederik Vercauteren. Saber: Module-lwr based key exchange, cpa-secure encryption and cca-secure kem. Cryptology ePrint Archive, Report 2018, 2018. http://eprint.iacr.org/2018.
Jintai Ding, Xiang Xie, and Xiaodong Lin. A simple provably secure key exchange scheme based on the learning with errors problem. Cryptology ePrint Archive, Report 2012/688, 2012. http://eprint.iacr.org/ 2012/688.
Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa, and Kazuki Yoneyama. Strongly secure authenticated key exchange from factoring, codes, and lattices. Cryptology ePrint Archive, Report 2012/211, 2012. http: //eprint.iacr.org/.
Daniele Micciancio. On the hardness of learning with errors with binary secrets. Cryptology ePrint Archive, Report 2018, 2018. http://eprint.iacr.org/ 2018.
National Institute of Standards and Technology. Proposed submission requirements and evaluation criteria for thepost-quantum cryptography standardization process, 2016. http://csrc.nist.gov/groups/ ST/post-quantum-crypto/documents/ call-for-proposals-draft-aug-2016. pdf.
National Institute of Standards and Technology. Proposed submission for the postquantum cryptography standardization process, 2017. https://csrc.nist.gov/ projects/post-quantum-cryptography/ round-1-submissions.
Chris Peikert. Lattice cryptography for the internet. Cryptology ePrint Archive, Report 2014/070, 2014. http://eprint.iacr.org/.
Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. In ACM, editor, Thirtyseventh Annual ACM Symposium on Theory of Computing, pages 84–93, 2005.
Peter W. Shor. Polynominal time algorithms for discrete logarithms and factoring on a quantum computer. In Lecture Notes in Computer Science, volume 877, page 289. Springer, 1994.
Song Y. Yan. Quantum Attacks on Public-Key Cryptosystems. Springer, 2013.
Jiang Zhang, Zhenfeng Zhang, Jintai Ding, Michael Snook, and özgür Dagdelen. Authenticated key exchange from ideal lattices. Cryptology ePrint Archive, Report 2014/589, 2014. http://eprint.iacr.org/.
Descargas
Publicado
Versiones
- 2019-06-27 (2)
- 2024-03-26 (1)
Cómo citar
Número
Sección
Licencia
Derechos de autor 2019 Ciencias Matemáticas
Esta obra está bajo una licencia internacional Creative Commons Atribución 4.0.
Esta licencia permite copiar y redistribuir el material en cualquier medio o formato bajo los siguientes términos: se debe dar crédito de manera adecuada, no se puede hacer uso del material con propósitos comerciales, y si remezcla, transforma o crea a partir del material, no podrá distribuir el material modificado. Bajo la licencia mencionada, los autores mantienen los derechos de autor de su trabajo.
