Figure 6 - uploaded by Newroz N. Abdulrazaq
Content may be subject to copyright.
Source publication
The McEliece cryptosystem is the asymmetric type of cryptography which is
based on error correction code. The classical McEliece used irreducible binary
Goppa code which considered unbreakable until now especially with parameter
[1024, 524, 101] which is suggested by McEliece, but it is suffering from large
public key matrix which leads to be diffi...
Context in source publication
Context 1
... step includes: Choosing Extension Field: This form starts to enter an integer number for the specified extension field (in binary Goppa code q = 2) with in the textbox (see Figure (5 Choosing Random Polynomial: As seen in the (Figure (6)), the form is classified into three commands, the first command generates random polynomial or it is chosen by an user, and then the process starts to test if the picked polynomial is separable or irreducible, and specify the range of Goppa code. While the second command is to find the secret generator matrix which is derived from the null-spaces of parity check sum, and the third command jumps to the next form in order to complete keg generation process. ...
Similar publications
The Gaussian sampler is an integral part in lattice-based cryptography as it has a direct connection to security and efficiency. Although it is theoretically secure to use the Gaussian sampler, the security of its implementation is an open issue. Therefore, researchers have started to investigate the security of the Gaussian sampler against side-ch...
Citations
... A public key is published and used to cipher a message, while a private key must keep it secret and use it to decipher the message. To prepare keys depending on Goppa code, the following steps as shown in Figure (3)should be followed [15]: ...
... To encrypt any message, the block diagram asshown in Figure (4)) should be followed [15]: ...
Side channel attack is the most efficient attack against original McEliece cryptosystem, especially ball-collision and Bernstein et al. Stern attacks. The modified Stern attack has an ability to break original McEliece cryptosystem with parameter [1024, 524, 101] in 1400 days with personal computers. While with 200 clusters CPU breaking could be done in 7 days. While ball-collision attacks have smaller exponent time than Stern algorithm. This paper will present a modified version of Patterson decoding algorithm using a new evaluation for finding error locations. This approach gave the sender an opportunity to choose errors less than identified errors in public key without notifying the receiver; therefore, it reduces the probability of modified Stern attack against McEliece cryptosystem to (0.02) and increases exponent time of ball-collision attack. In this paper also the leakage of proposed implementation has been measured using a measurement type for possible leakage in Patterson’s decoding algorithm suggested by previous work, and we concluded that the designed system have fewer leakage compared to previous implementation. The work has done using Visual Studio C#.
