China
Africa
Explore chapters and articles related to this topic
Post-Quantum Cryptography
Published in Khaleel Ahmad, M. N. Doja, Nur Izura Udzir, Manu Pratap Singh, Emerging Security Algorithms and Techniques, 2019
Amandeep Singh Bhatia, Ajay Kumar
McEliece cryptosystem is the most successful cryptosystem, based on extended Golay code [24, 12, 8]. Originally, Golay codes were invented in the early 1950s and have experienced incredible responses in the last few years. McEliece (1978) proposed an asymmetric encryption cryptosystem based on Goppa codes, which remains unbroken, even after 15 years of adaptation of its proposal security parameters (Sendrier, 1998). McEliece cryptosystem is based on linear error-correcting code for creating public and private keys. The secret key can be drawn from the various alternate codes. Several versions of McEliece cryptosystem were proposed using various secret codes such as Reed–Solomon codes, concatenated codes, and Goppa codes. The original McEliece cryptosystem algorithm is given below. McEliece public-key cryptosystem is illustrated in Figure 9.1 (see also Table 9.2).
Hardware Efficient Crypto-Coder Systems for Wireless Channels
Published in IETE Journal of Research, 2019
Jeena Jose, David Solomon George
The McEliece cryptosystem [1] is one of the oldest public-key cryptosystem ever designed. It is also the first public-key cryptosystem based on linear error-correcting codes. It needs a very large public key which makes it very difficult to use in many practical situations. The drawback of McEliece cryptosystem is overcome by Niederreiter cryptosystem [2,3], which is a variant of McEliece cryptosystem whereby the key size is reduced. It is based on finite field arithmetic constructed by Bose and Chowla. A joint encryption and error correction coding was proposed by Kak [4] which is based on D-sequences. Gligoroski et al. in [5] combined encryption and error correction into a single step.