Practical Power Analysis Attacks on Software Implementations of McEliece

Heyse, Stefan; Moradi, Amir; Paar, Christof

doi:10.1007/978-3-642-12929-2_9

Cited by 31 publications

(48 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We did not implement an actual verification, but simply compare the guess for the support with the correct support Γ . As already mentioned, in [13] the procedure that had to be used in a real life attack is described. It involves only some linear algebra operations on the public key and the invocation of an EEA and would not perceptibly increase the time for solving, given the small numbers of such final verifications occurring in the attacks.…”

Section: Resultsmentioning

confidence: 99%

“…Whenever in such a chain of guesses a solution for all β si is found, a guess for the whole support Γ = (α i |α i = j∈Bi β j ) is implied, which has to be checked by a means of key recovery, as described in [13].…”

Section: Description Of the Attack Proceduresmentioning

confidence: 99%

“…Accordingly, they have received growing interested from researchers in the past years and been analyzed with respect to efficiency on various platforms [4][5][6][7][8]. Furthermore, a growing number of works has investigated the side channel security of code-based cryptosystems [9][10][11][12][13][14].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Timing Attacks against the Syndrome Inversion in Code-Based Cryptosystems

Strenzke

2013

Post-Quantum Cryptography

View full text Add to dashboard Cite

Abstract. In this work we present the first practical key-aimed timing attack against code-based cryptosystems. It arises from vulnerabilities that are present in the inversion of the error syndrome through the Extended Euclidean Algorithm that is part of the decryption operation of these schemes. Three types of timing vulnerabilities are combined to a successful attack. Each is used to gain information about the secret support, which is part of code-based decryption keys: The first allows recovery of the zero-element, the second is a refinement of a previously described vulnerability yielding linear equations, and the third enables to retrieve cubic equations.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Description Of the Attack Proceduresmentioning

confidence: 99%

See 1 more Smart Citation

Timing Attacks against the Syndrome Inversion in Code-Based Cryptosystems

Strenzke

2013

Post-Quantum Cryptography

View full text Add to dashboard Cite

show abstract

“…Once again, results show that Mc Eliece's cryptosystem gives better results compared to RSA but not compared to elliptic cryptosystems.. A smart card implementation (16 bits processor) is described in [102], ciphering and deciphering is done in less than 2 seconds for a 2048 code length. Hardware implementations of Mc Eliece's cryptosystem gave rise to several side channel attacks [103,98,66,27,80].…”

Section: Hardware and Software Implementationsmentioning

confidence: 99%

Code Based Cryptography and Steganography

Véron

2013

Algebraic Informatics

View full text Add to dashboard Cite

“…Overall code-based cryptography represents one of the few credible alternative to classical cryptography, and one attends to a rising interest in the cryptographic community for these systems, in particular practical implementation of such code-based schemes on smart cards, embedded devices or PC, have begun to be presented in conferences likes CHES or CARDIS ( [17], [11], [23], [7]). …”

Section: Introductionmentioning

confidence: 99%

A New Efficient Threshold Ring Signature Scheme Based on Coding Theory

Melchor

Cayrel

Gaborit

et al. 2011

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-Ring signatures were introduced by Rivest, Shamir and Tauman in 2001 [32]. These signatures allow a signer to anonymously authenticate a message on behalf of a group of his choice. This concept was then extended by Bresson, Stern and Szydlo into -out-of-(threshold) ring signatures in 2002 [9]. We propose in this article a generalization of Stern's code based identification (and signature) scheme [36] to design a practical -out-of-threshold ring signature scheme. The size of the resulting signatures is in ( ) and does not depend on , contrary to most of the existing protocols. Our scheme is existentially unforgeable under a chosen message attack in the random oracle model assuming the hardness of the minimum distance problem, is unconditionally source hiding, has a very short public key and has an overall complexity in ( ). This protocol is the first efficient code-based ring signature scheme and the first code-based threshold ring signature scheme. Moreover it has a better complexity than number-theory based schemes which have a complexity in ( ). This paper is an extended version of [2] with complete proofs and definitions.

show abstract

Practical Power Analysis Attacks on Software Implementations of McEliece

Cited by 31 publications

References 26 publications

Timing Attacks against the Syndrome Inversion in Code-Based Cryptosystems

Timing Attacks against the Syndrome Inversion in Code-Based Cryptosystems

Code Based Cryptography and Steganography

A New Efficient Threshold Ring Signature Scheme Based on Coding Theory

Contact Info

Product

Resources

About