Results 21 to 30 of about 2,437 (198)
McEliece-type Cryptosystems over Quasi-cyclic Codes [PDF]
, 2018 In this thesis, we study algebraic coding theory based McEliece-type cryptosystems over quasi-cyclic codes. The main goal of this thesis is to construct a cryptosystem that resists quantum Fourier sampling making it quantum secure. We propose a new variant of Niederreiter cryptosystem over rate $\frac{m-1}{m}$ quasi-cyclic codes which is secure against
Upendra Kapshikar
openalex +3 more sources
Codes, Cryptography, and the McEliece Cryptosystem [PDF]
, 2020 Over the past several decades, technology has continued to develop at an incredible rate, and the importance of properly securing information has increased significantly. While a variety of encryption schemes currently exist for this purpose, a number of
Matsick, Bethany
core +2 more sources
MDPC decoding algorithms and their impact on the McEliece cryptosystem [PDF]
Annals of computer science and information systems, 2018 Artur Janoska
doaj +3 more sources
Recent algebraic attacks on the McEliece cryptosystem [PDF]
, 2023 Jean–Pierre Tillich
openalex +3 more sources
EFFECTIVE IMPLEMENTATION OF MODERN MCELIECE CRYPTOSYSTEM ON GENERALIZED (L, G)-CODES [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper presents the study of methods and approaches to implementation of the modern McEliece cryptosystem based on separable generalized (L, G)-codes. Method.
Ivan K. Noskov, Sergey V. Bezzateev
doaj +1 more source
A novel attack on McEliece's cryptosystem
International Journal of Computer Mathematics: Computer Systems Theory, 2023 Gray, Henry +3 more
openaire +4 more sources
Decoding algorithms for Goppa codes with errors and erasures [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 In 1978, McEliece built the first public key cryptosystem based on error-correcting codes. This cryptosystem based on Goppa codes is considered promising and cryptographically stable, taking into account quantum computing.
Ratseev, Sergey Mihailovich +1 more
doaj +1 more source
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
IET Information Security, Volume 17, Issue 2, Page 171-209, March 2023., 2023 Abstract In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post‐quantum secure cryptosystems.
J.‐F. Biasse +4 more
wiley +1 more source
Security and complexity of the McEliece cryptosystem based on quasi‐cyclic low‐density parity‐check codes [PDF]
IET Information Security, 2013 Marco Baldi +2 more
openalex +3 more sources
Post-quantum cryptography-driven security framework for cloud computing
Open Computer Science, 2022 Data security in the cloud has been a major issue since the inception and adoption of cloud computing. Various frameworks have been proposed, and yet data breach prevails.
Ukwuoma Henry Chima +3 more
doaj +1 more source