Handbook of Applied Cryptography
Handbook of Applied Cryptography
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Efficient Generation of Binary Words of Given Weight
Proceedings of the 5th IMA Conference on Cryptography and Coding
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Power Analysis Attacks: Revealing the Secrets of Smart Cards (Advances in Information Security)
Power Analysis Attacks: Revealing the Secrets of Smart Cards (Advances in Information Security)
Comparison of innovative signature algorithms for WSNs
WiSec '08 Proceedings of the first ACM conference on Wireless network security
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
MicroEliece: McEliece for Embedded Devices
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
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
Implementation of mceliece based on quasi-dyadic goppa codes for embedded devices
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
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
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
| Hi-index | 0.00 |
Most modern 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 affecting one of those problems could render a large set of cryptosystems completely useless. Coding based public-key schemes are based on the alternative security assumption that decoding unknown linear binary codes is NP-complete. There exist two basic schemes of this type, namely McEliece and the Niederreiter variant, whereas the security of both schemes are equivalent. The latter has the advantage of smaller public keys, but the disadvantage of a computationally expensive mapping, which slows down encryption and decryption. In this work, we investigate the efficient implementation of the Niederreiter scheme on very constrained micro controllers. We adopt existing algorithms to the limited abilities of the target platform and finally compare the implementation to widely used schemes and also to other alternative public schemes.