Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Efficient Generation of Binary Words of Given Weight
Proceedings of the 5th IMA Conference on Cryptography and Coding
Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Special-Purpose Hardware for Solving the Elliptic Curve Discrete Logarithm Problem
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Semantic security for the McEliece cryptosystem without random oracles
Designs, Codes and Cryptography
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
Attacking and Defending the McEliece Cryptosystem
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Side Channels in the McEliece PKC
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Reducing Key Length of the McEliece Cryptosystem
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
A Novel Processor Architecture for McEliece Cryptosystem and FPGA Platforms
ASAP '09 Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors
MicroEliece: McEliece for Embedded Devices
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Compact McEliece Keys from Goppa Codes
Selected Areas in Cryptography
An efficient pseudo-random generator provably as secure as syndrome decoding
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A timing attack against patterson algorithm in the McEliece PKC
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
McEliece and niederreiter cryptosystems that resist quantum fourier sampling attacks
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
A timing attack against the secret permutation in the mceliece PKC
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Practical power analysis attacks on software implementations of mceliece
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Low-reiter: niederreiter encryption scheme for embedded microcontrollers
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Implementation of mceliece based on quasi-dyadic goppa codes for embedded devices
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The algebraic decoding of Goppa codes
IEEE Transactions on Information Theory
An erasures-and-errors decoding algorithm for Goppa codes (Corresp.)
IEEE Transactions on Information Theory
McBits: fast constant-time code-based cryptography
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Smaller keys for code-based cryptography: QC-MDPC mceliece implementations on embedded devices
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
Most advanced security systems rely on public-key schemes based either on the factorization or the discrete logarithm problem. Since both problems are known to be closely related, a major breakthrough in cryptanalysis tackling one of those problems could render a large set of cryptosystems completely useless. Code-based public-key schemes are based on the alternative security assumption that decoding generic linear binary codes is NP-complete. In the past, most researchers focused on the McEliece cryptosystem, neglecting the fact that the scheme by Niederreiter has some important advantages. Smaller keys, more practical plain and ciphertext sizes and less computations. In this work we describe a novel FPGA implementation of the Niederreiter scheme, showing that its advantages can result a very efficient design for an asymmetric cryptosystem that can encrypt more than 1.5 million plaintexts per seconds on a Xilinx Virtex-6 FPGA, outperforming all other popular public key cryptosystems by far.