On new problems in asymmetric cryptography based on error-resistant coding

DOI10.1134/s0032946022020077zbMath1518.94103WikidataQ114846599 ScholiaQ114846599MaRDI QIDQ6173457

Fedor Illarionovich Ivanov, E. A. Krouk, Victor Zyablov, Vladimir Sidorenko

Publication date: 21 July 2023

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

McEliece cryptosysteminformation-set decodinggeneralized Reed-Solomon codepost-quantum cryptography

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Decoding (94B35) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem

Cites Work

• Unnamed Item
• Algebraic informatics. 5th international conference, CAI 2013, Porquerolles, France, September 3--6, 2013. Proceedings
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Attacking and Defending the McEliece Cryptosystem
• Algebraic Cryptanalysis of McEliece Variants with Compact Keys
• Reducing Key Length of the McEliece Cryptosystem
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• On the inherent intractability of certain coding problems (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the edge-independence number and edge-covering number for regular graphs
• A digital signature scheme based on random error-correcting codes

This page was built for publication: On new problems in asymmetric cryptography based on error-resistant coding