Evaluación de los criptosistemas McEliece y Niederreiter como candidatos post-cuánticos

Autores/as

Palabras clave:

McEliece, Niederreiter, criptografía post-cuántica, criptoanálisis

Resumen

En el presente trabajo se analizan los criptosistemas basados en códigos correctores de errores McEliece y Niederreiter, así como sus variantes. Mostramos también los principales ataques que han llevado a la evolución de los parámetros y la utilización de uno u otro código. También revisamos los parámetros recomendados en la literatura para una fortaleza de los criptosistemas contra ataques cúanticos y clásicos.

Descargas

Los datos de descargas todavía no están disponibles.

Citas

Avanzi, Roberto, Simon Hoerder, Dan Page y Michael Tunstall: Side-channel attacks on the McEliece and Niederreiter public-key cryptosystems. Journal of Cryptographic Engineering, 1(4):271–281, 2011.

Baldi, Marco: QC-LDPC code-based cryptography. Springer Science & Business, 2014.

Berlekamp, Elwyn, Robert McEliece y Henk Van Tilborg: On the inherent intractability of certain coding problems (Corresp.). IEEE Transactions on Information Theory, 24(3):384–386, 1978.

Bernstein, Daniel J, Tung Chou y Peter Schwabe: McBits: fast constant-time code-based cryptography. En International Workshop on Cryptographic Hardware and Embedded Systems, páginas 250–272. Springer, 2013.

Canteaut, Anne y Florent Chabaud: A new algorithm for finding minimum-weight words in a linear code: application to McEliece’s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Transactions on Information Theory, 44(1):367–378, 1998.

Canteaut, Anne y Nicolas Sendrier: Cryptanalysis of the original McEliece cryptosystem. En International Conference on the Theory and Application of Cryptology and Information Security, páginas 187–199. Springer, 1998.

Chabaud, Florent: On the security of some cryptosystems based on error-correcting codes. En Workshop on the Theory and Application of of Cryptographic Techniques, páginas 131–139. Springer, 1994.

Chen, Cong, Thomas Eisenbarth, Ingo Von Maurich y Rainer Steinwandt: Differential power analysis of a McEliece cryptosystem. En International Conference on Applied Cryptography and Network Security, páginas 538–556. Springer, 2015.

Chen, Lily, Lily Chen, Stephen Jordan, Yi Kai Liu, Dustin Moody, Rene Peralta, Ray Perlner y Daniel SmithTone: Report on post-quantum cryptography. US Department of Commerce, National Institute of Standards and Technology, 2016.

Courtois, Nicolas T, Matthieu Finiasz y Nicolas Sendrier: How to achieve a McEliece-based digital signature scheme. En International Conference on the Theory and Application of Cryptology and Information Security, páginas 157–174. Springer, 2001.

Daniel, Augot, B Lejla y cols.: Initial recommendations of long-term secure post-quantum systems. PQCRYPTO. EU. Horizon, 2020, 2015.

Eisenbarth, Thomas, Tim Güneysu, Stefan Heyse y Christof Paar: MicroEliece: McEliece for embedded devices. En Cryptographic Hardware and Embedded Systems-CHES 2009, páginas 49–64. Springer, 2009.

Engelbert, Daniela, Raphael Overbeck y Arthur Schmidt: A summary of McEliece-type cryptosystems and their security. Journal of Mathematical Cryptology JMC, 1(2):151–199, 2007.

Faugere, Jean Charles, Valérie Gauthier-Umana, Ayoub Otmani, Ludovic Perret y Jean Pierre Tillich: A distinguisher for high-rate McEliece cryptosystems. IEEE Transactions on Information Theory, 59(10):6830–6844, 2013.

Heyse, Stefan, Amir Moradi y Christof Paar: Practical power analysis attacks on software implementations of McEliece. En International Workshop on Post-Quantum Cryptography, páginas 108–125. Springer, 2010.

Jochemsz, Ellen: Goppa Codes & the McEliece Cryptosystem. Doktorarbeit, Universiteit van Amsterdam, 2002.

Kobara, Kazukuni y Hideki Imai: Semantically secure McEliece public-key cryptosystems-conversions for McEliece PKC. En International Workshop on Public Key Cryptography, páginas 19–35. Springer, 2001.

Kruk, Evgenii Avramovich: Decoding complexity bound for linear block codes. Problemy Peredachi Informatsii, 25(3):103–107, 1989.

Lee, Pil Joong y Ernest F Brickell: An observation on the security of McElieceâs public-key cryptosystem. En Workshop on the Theory and Application of of Cryptographic Techniques, páginas 275–280. Springer, 1988.

Leon, Jeffrey S: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Transactions on Information Theory, 34(5):1354–1359, 1988.

Mceliece, Robert J: A public-key cryptosystem based on algebraic. Coding Thv, 4244:114–116, 1978.

Niederreiter, Harald: Knapsack-type cryptosystems and algebraic coding theory. Prob. Control and Inf. Theory, 15(2):159–166, 1986.

Patterson, Nicholas: The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory, 21(2):203–207, 1975.

Shor, Peter W: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 41(2):303–332, 1999.

Shoufan, Abdulhadi, Falko Strenzke, H Gregor Molter y Marc Stöttinger: A timing attack against Patterson algorithm in the McEliece PKC. En International Conference on Information Security and Cryptology, páginas 161–175. Springer, 2009.

Siim, Sander: Study of McEliece cryptosystem. 2015. [27] Stern, Jacques: A method for finding codewords of small weight. En International Colloquium on Coding Theory and Applications, páginas 106–113. Springer, 1988.

Strenzke, Falko, Erik Tews, H Gregor Molter, Raphael Overbeck y Abdulhadi Shoufan: Side channels in the McEliece PKC. En International Workshop on PostQuantum Cryptography, páginas 216–229. Springer, 2008.

Sun, Hung Min: Further cryptanalysis of the McEliece public-key cryptosystem. IEEE communications letters, 4(1):18–19, 2000.

Vries, SHS: Achieving 128-bit security against quantum attacks in OpenVPN. Tesis de Licenciatura, University of Twente, 2016.

Descargas

Publicado

2024-03-26 — Actualizado el 2019-06-27

Versiones

Cómo citar

[1]
Dominguez Fiallo, E. et al. 2019. Evaluación de los criptosistemas McEliece y Niederreiter como candidatos post-cuánticos. Ciencias matemáticas. 33, 1 (jun. 2019), 82–86.

Número

Sección

Artículo Original