A Smart Card Implementation of the McEliece PKC
نویسنده
چکیده
In this paper we present a smart card implementation of the quantum computer resistant McEliece Public Key Cryptosystem (PKC) on an Infineon SLE76 chip. We describe the main features of the implementation which focuses on performance optimization. We give the resource demands and timings for two sets of security parameters, the higher one being in the secure domain. The timings suggest the usability of the implementation for certain real world applications.
منابع مشابه
Leakage Measurement Tool of McEliece PKC Calculator
McEliece Public Key Cryptosystem (PKC) is interesting since its resistance against all known attacks, even using quantum cryptanalysis. Unfortunately, Side Channel Attacks (SCAs) are very powerful attacks which even McEliece PKC is vulnerable to. In this work, we present the Leakage Measurement Tool of the McEliece PKC Calculator [1]. The Calculator also provides test vectors (for all important...
متن کاملOverview of the Mceliece Cryptosystem and Its Security
McEliece cryptosystem (MECS) is one of the oldest public key cryptosystems, and the oldest PKC that is conjectured to be post-quantum secure. In this paper we survey the current state of the implementation issues and security of MECS, and its variants. In the first part we focus on general decoding problem, structural attacks, and the selection of parameters in general. We summarize the details...
متن کاملThe failure of McEliece PKC based on Reed-Muller codes
This paper describes new algorithm for breaking McEliece cryptosystem, built on ReedMuller binary code RM(r,m), which receives the private key from the public key. The algorithm has complexity O(n+nlog2n) bit operations, where n = 2, d = GCD(r,m−1). In the case of GCD(r,m − 1) limitation, attack has polynomial complexity. Practical results of implementation show that McEliece cryptosystems, bas...
متن کاملThe failure of McEliece PKC based on Reed - Muller codes . May 8 , 2013
This paper describes new algorithm for breaking McEliece cryptosystem, built on ReedMuller binary code RM(r,m), which receives the private key from the public key. The algorithm has complexity O(n+nlog2n) bit operations, where n = 2, d = GCD(r,m−1). In the case of GCD(r,m − 1) limitation, attack has polynomial complexity. Practical results of implementation show that McEliece cryptosystems, bas...
متن کامل