Results 131 to 140 of about 237 (172)
Collaborative penetration testing suite for emerging generative AI algorithms. [PDF]
Appl Intell (Dordr)Radanliev P.
europepmc +1 more source
A CCA2 Secure Variant of the McEliece Cryptosystem [PDF]
IEEE Transactions on Information Theory, 2012 The McEliece public-key encryption scheme has become an interesting alternative to cryptosystems based on number-theoretical problems. Differently from RSA and ElGa- mal, McEliece PKC is not known to be broken by a quantum computer. Moreover, even tough McEliece PKC has a relatively big key size, encryption and decryption operations are rather ...
Nico Döttling +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The McEliece and Niederreiter Cryptosystems
Springer Briefs in Electrical and Computer Engineering, 2014This chapter is devoted to the McEliece and Niederreiter cryptosystems, which are the first and best known examples of code-based public-key cryptosystems. The classical instances of the McEliece and Niederreiter cryptosystems are described, together with the class of Goppa codes, which are the codes originally used in these systems and which have best
Marco Baldi, Baldi Marco
exaly +2 more sources
Generalization and applications of McEliece's theorem
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004This paper describes an application of our generalization of McEliece's theorem in order to improve Serre's bound. Serre obtained sharp estimates for the number of solutions of an algebraic curve over a finite field. This improvement depends of the divisibility properties of the curve.
Oscar Moreno, Francis N. Castro
openaire +1 more source
2011
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of security against all attacks known. However, the cryptosystem drops one of the confidence-inspiring shields built into the original McEliece cryptosystem, namely a large pool of ...
Bernstein, D.J., Lange, T., Peters, C.P.
openaire +4 more sources
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of security against all attacks known. However, the cryptosystem drops one of the confidence-inspiring shields built into the original McEliece cryptosystem, namely a large pool of ...
Bernstein, D.J., Lange, T., Peters, C.P.
openaire +4 more sources
Breaking Goppa-based McEliece with hints
Information and Computation, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elena Kirshanova, Alexander May 0001
openaire +2 more sources
2010
This paper shows that quantum information-set-decoding attacks are asymptotically much faster than non-quantum information-set-decoding attacks.
openaire +2 more sources
This paper shows that quantum information-set-decoding attacks are asymptotically much faster than non-quantum information-set-decoding attacks.
openaire +2 more sources