Sciweavers

Share
3 search results - page 1 / 1
» Compact McEliece keys based on Quasi-Dyadic Srivastava codes
Sort
View
IACR
2011
133views more  IACR 2011»
7 years 6 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti
DCC
2016
IEEE
3 years 2 months ago
Structural cryptanalysis of McEliece schemes with compact keys
A very popular trend in code-based cryptography is to decrease the public-key size by focusing on subclasses of alternant/Goppa codes which admit a very compact public matrix, typi...
Jean-Charles Faugère, Ayoub Otmani, Ludovic...
TIT
2016
55views Education» more  TIT 2016»
3 years 2 months ago
Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups
The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alte...
Jean-Charles Faugère, Ayoub Otmani, Ludovic...
books