Security issues of CFS-like digital signature algorithms
*Giuseppe D’AlconzoCorresponding authorgiuseppe.dalconzo@polito.itDepartment of Mathematical Sciences Politecnico di Torino Corso Duca degli Abruzzi 24Torino, 10129, ItalyView full profile → , Alessio MeneghettiDepartment of Mathematics Universitá di Trento Via Sommarive 14Povo (Trento), 38123, ItalyView full profile → , Paolo PiasentiDepartment of Mathematics Universitá di Trento Via Sommarive 14Povo (Trento), 38123, ItalyView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 08 Dec 2021
- Accepted:
- 20 Jun 2022
- Published Online:
- 24 Jan 2024
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-1643
- Pages:
- 175–187
Abstract
Keywords
Subject Classifications
References
[1] Gessica Alecci, Simone Dutto, and Nadir Murru. Pell hyperbolas in dlp-based cryptosystems. arXiv preprint arXiv:2111.09632, 2021.
[2] Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier. A family of fast syndrome based cryptographic hash functions. In International Conference on Cryptology in Malaysia, pages 64–83. Springer, 2005.
[3] Paulo SLM Barreto, Rafael Misoczki, and Marcos A Simplicio Jr. One-time signature scheme from syndrome decoding over generic error-correcting codes. Journal of Systems and Software, 84(2):198–204, 2011.
[4] Michele Battagliola, Riccardo Longo, Alessio Meneghetti, and Massimiliano Sala. Threshold ecdsa with an offline recovery party. Mediterranean Journal of Mathematics, 19(1):1–29, 2022.
[5] Elwyn Berlekamp. Goppa codes. IEEE Transactions on Information Theory, 19(5):590–592, 1973.
[6] Elwyn Berlekamp, Robert McEliece, and Henk Van Tilborg. On the inherent intractability of certain coding problems (corresp.). IEEE Transactions on Information Theory, 24(3):384–386, 1978.
[7] Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, and Bo-Yin Yang. High-speed high-security signatures. Journal of Cryptographic Engineering, 2:77–89, 2012.
[8] Pierre-Louis Cayrel, Ayoub Otmani, and Damien Vergnaud. On kabatianskiikrouk-smeets signatures. In International Workshop on the Arithmetic of Finite Fields, pages 237–251. Springer, 2007.
[9] Nicola Di Chiano, Riccardo Longo, Alessio Meneghetti, and Giordano Santilli. A survey on NIST PQ signatures. CoRR, abs/2107.11082, 2021.
[10] Tung Chou, Carlos Cid, Simula UiB, Jan Gilcher, Tanja Lange, Varun Maram, Rafael Misoczki, Ruben Niederhagen, Kenneth G Paterson, Edoardo Persichetti, et. al. Classic mceliece: conservative code-based cryptography 10 october 2020. 2020.
[11] Nicolas T Courtois, Matthieu Finiasz, and Nicolas Sendrier. How to achieve a mceliece-based digital signature scheme. In International Conference on the Theory and Application of Cryptology and Information Security, pages 157–174. Springer, 2001.
[12] Léonard Dallot. Towards a concrete security proof of courtois, finiasz and sendrier signature scheme. In Western European Workshop on Research in Cryptology, pages 65–77. Springer, 2007.
[13] Ivan Bjerre Damgård. A design principle for hash functions. In Conference on the Theory and Application of Cryptology, pages 416–427. Springer, 1989.
[14] Philippe Gaborit and Julien Schrek. Efficient code-based one-time signature from automorphism groups with syndrome compatibility. In 2012 IEEE International Symposium on Information Theory Proceedings, pages 1982–1986. IEEE, 2012.
[15] Don Johnson, Alfred Menezes, and Scott Vanstone. The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Sec., 1:36–63, 08 2001.
[16] Gregory Kabatianskii, Evgenii Krouk, and Ben Smeets. A digital signature scheme based on random error-correcting codes. In IMA International Conference on Cryptography and Coding, pages 161–167. Springer, 1997.
[17] Grigorii Kabatiansky, Evgenii Krouk, and Sergei Semenov. Error correcting coding and security for data networks: Analysis of the superchannel concept. John Wiley & Sons, 2005.
[18] Cameron F Kerry and Charles Romine Director. Fips pub 186-4 federal information processing standards publication digital signature standard (dss). 2013.
[19] Cameron F Kerry and Patrick D Gallagher. Digital signature standard (dss). FIPS PUB, pages 186–4, 2013.
[20] DM Kuryazov. Development of electronic digital signature algorithms with compound modules and their cryptanalysis. Journal of Discrete Mathematical Sciences and Cryptography, 24(4):1085–1099, 2021.
[21] Robert J McEliece. A public-key cryptosystem based on algebraic. Coding Thv, 4244:114–116, 1978.
[22] Nissa Mehibel and M’hamed Hamadouche. A new enhancement of elliptic curve digital signature algorithm. Journal of Discrete Mathematical Sciences and Cryptography, 23(3):743–757, 2020.
[23] Harald Niederreiter. Knapsack-type cryptosystems and algebraic coding theory. Prob. Contr. Inform. Theory, 15(2):157–166, 1986.
[24] Ayoub Otmani and Jean-Pierre Tillich. An efficient attack on all concrete kks proposals. In International Workshop on Post-Quantum Cryptography, pages 98–116. Springer, 2011.
[25] Fang Ren, Dong Zheng, WeiJing Wang, et al. An efficient code based digital signature algorithm. Int. J. Netw. Secur., 19(6):1072–1079, 2017.
[26] Claus-Peter Schnorr. Efficient identification and signatures for smart cards. In Conference on the Theory and Application of Cryptology, pages 239–252. Springer, 1989.
[27] Peter W Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th Annual Symposium on Foundations of Computer Science, pages 124–134. Ieee, 1994.
