[图书][B] Handbook of applied cryptography
AJ Menezes, PC Van Oorschot, SA Vanstone - 2018 - taylorfrancis.com
Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an
important discipline that is not only the subject of an enormous amount of research, but …
important discipline that is not only the subject of an enormous amount of research, but …
An observation on the security of McEliece's public-key cryptosystem
PJ Lee, EF Brickell - Workshop on the Theory and Application of of …, 1988 - Springer
The best known cryptanalytic attack on McEliece's public-key cryptosystem based on
algebraic coding theory is to repeatedly select k bits at random from an n-bit ciphertext …
algebraic coding theory is to repeatedly select k bits at random from an n-bit ciphertext …
Ideals over a non-commutative ring and their application in cryptology
EM Gabidulin, AV Paramonov, OV Tretjakov - Advances in Cryptology …, 1991 - Springer
A new modification of the McEliece public-key cryptosystem is proposed that employs the so-
called maximum-rank-distance (MRD) codes in place of Goppa codes and that hides the …
called maximum-rank-distance (MRD) codes in place of Goppa codes and that hides the …
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
A Canteaut, F Chabaud - IEEE Transactions on Information …, 1998 - ieeexplore.ieee.org
An algorithm for finding minimum-weight words in large linear codes is developed. It
improves all previous attacks on the public-key cryptosystems based on codes and it notably …
improves all previous attacks on the public-key cryptosystems based on codes and it notably …
Smaller decoding exponents: ball-collision decoding
Very few public-key cryptosystems are known that can encrypt and decrypt in time b 2+ o (1)
with conjectured security level 2 b against conventional computers and quantum computers …
with conjectured security level 2 b against conventional computers and quantum computers …
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems Page 1
IKANJALIIUNJ UN INrUKb’lAIlUN IHCUKX, VUL. W , IYU. 1, JAIYUAKX IYY4 LI1 …
IKANJALIIUNJ UN INrUKb’lAIlUN IHCUKX, VUL. W , IYU. 1, JAIYUAKX IYY4 LI1 …
Semantically secure McEliece public-key cryptosystems-conversions for McEliece PKC
K Kobara, H Imai - Public Key Cryptography: 4th International Workshop …, 2001 - Springer
Almost all of the current public-key cryptosystems (PKCs) are based on number theory, such
as the integer factoring problem and the discrete logarithm problem (which will be solved in …
as the integer factoring problem and the discrete logarithm problem (which will be solved in …
McEliece public key cryptosystems using algebraic-geometric codes
H Janwa, O Moreno - Designs, Codes and Cryptography, 1996 - Springer
McEliece proposed a public-key cryptosystem based on algebraic codes, in particular binary
classical Goppa codes. Actually, his scheme needs only a class of codes with a good …
classical Goppa codes. Actually, his scheme needs only a class of codes with a good …
Cryptanalysis: A survey of recent results
EF Brickell, AM Odlyzko - Proceedings of the IEEE, 1988 - ieeexplore.ieee.org
Cryptosystems are tested by subjecting them to cryptanalytic attacks by experts. Most of the
cryptosystems that have been publicly proposed in the last decade have been broken. Some …
cryptosystems that have been publicly proposed in the last decade have been broken. Some …
Failure of the McEliece public-key cryptosystem under message-resend and related-message attack
TA Berson - Advances in Cryptology—CRYPTO'97: 17th Annual …, 1997 - Springer
The McEliece public-key cryptosystem fails to protect any message which is sent to a
recipient more than once using different random error vectors. In general, it fails to protect …
recipient more than once using different random error vectors. In general, it fails to protect …