Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
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
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Ultra High Performance ECC over NIST Primes on Commercial FPGAs
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Attacking and Defending the McEliece Cryptosystem
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
A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem
IEEE Transactions on Computers
FPGA implementation of point multiplication on koblitz curves using kleinian integers
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
Algebraic cryptanalysis of mceliece variants with compact keys
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
PQCrypto'11 Proceedings of the 4th 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
Decoding random binary linear codes in 2n/20: how 1 + 1 = 0 improves information set decoding
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
On the inherent intractability of certain coding problems (Corresp.)
IEEE Transactions on Information Theory
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
IEEE Transactions on Information Theory
Efficient implementation of a CCA2-Secure variant of mceliece using generalized srivastava codes
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
ISC'12 Proceedings of the 15th international conference on Information Security
A Speed Area Optimized Embedded Co-processor for McEliece Cryptosystem
ASAP '12 Proceedings of the 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors
Towards one cycle per bit asymmetric encryption: code-based cryptography on reconfigurable hardware
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Pushing the limits of high-speed GF(2m) elliptic curve scalar multiplication on FPGAs
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
On the design of hardware building blocks for modern lattice-based encryption schemes
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
A Parallel Architecture for Koblitz Curve Scalar Multiplications on FPGA Platforms
DSD '12 Proceedings of the 2012 15th Euromicro Conference on Digital System Design
Hi-index | 0.00 |
In the last years code-based cryptosystems were established as promising alternatives for asymmetric cryptography since they base their security on well-known NP-hard problems and still show decent performance on a wide range of computing platforms. The main drawback of code-based schemes, including the popular proposals by McEliece and Niederreiter, are the large keys whose size is inherently determined by the underlying code. In a very recent approach, Misoczki et al. proposed to use quasi-cyclic MDPC (QC-MDPC) codes that allow for a very compact key representation. In this work, we investigate novel implementations of the McEliece scheme using such QC-MDPC codes tailored for embedded devices, namely a Xilinx Virtex-6 FPGA and an 8-bit AVR microcontroller. In particular, we evaluate and improve different approaches to decode QC-MDPC codes. Besides competitive performance for encryption and decryption on the FPGA, we achieved a very compact implementation on the microcontroller using only 4,800 and 9,600 bits for the public and secret key at 80 bits of equivalent symmetric security.