• Corpus ID: 6565020

Side channel attacks in code-based cryptography

@inproceedings{Cayrel2010SideCA,
  title={Side channel attacks in code-based cryptography},
  author={Pierre-Louis Cayrel and Falko Strenzke},
  year={2010}
}
The McEliece and the Niederreiter public key cryptosystems (PKC) are supposed secure in a post quantum world (4) because there is no ecient quantum algorithm for the underlying problems upon which these cryptosystems are built. The CFS, Stern and KKS signature schemes are post-quantum secure because they are based on hard problems of coding theory. The purpose of this article is to describe what kind of attacks have been proposed against code-based constructions and what is missing. 
1 Citations
VLSI IMPLEMENTATION OF NOVEL ROUND KEYS GENERATION SCHEME FOR CRYPTOGRAPHY APPLICATIONS BY ERROR CONTROL ALGORITHM
TLDR
This paper concludes that chip based multi-layer key distribution of proposed algorithm is an enhanced solution to the existing threats on cryptography algorithms.

References

SHOWING 1-10 OF 15 REFERENCES
Side Channels in the McEliece PKC
TLDR
A Timing Attack is presented which was executed successfully against a software implementation of the McEliece PKC, and the critical system components for key generation and decryption are inspected to identify channels enabling power and cache attacks.
A Timing Attack against the Secret Permutation in the McEliece PKC
TLDR
This work devise how to exploit a vulnerability in the Patterson algorithm that allows the attacker to gather information about the secret permutation through a timing side channel to dramatically reduce the cost of a brute force attack against the secret key.
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
It is shown that McEliece's and Niederreiter's public-key cryptosystems are equivalent when set up for corresponding choices of parameters. A security analysis for the two systems based on this
Secure Implementation of the Stern Authentication and Signature Schemes for Low-Resource Devices
TLDR
The first implementation on smartcard of the code-based authentication protocol proposed by Stern at Crypto'93 is described and a securization of the scheme against side channel attacks is given.
A Timing Attack against Patterson Algorithm in the McEliece PKC
TLDR
This paper proposes a timing attack on the Patterson Algorithm, which is used for efficient decoding in Goppa codes, based on the relation between the error vector weight and the iteration number of the extended Euclidean algorithm used in Patterson Al algorithm.
Reducing Key Length of the McEliece Cryptosystem
TLDR
The result suggests that decoding attack against the variant has little chance to be better than the general one against the classical McEliece cryptosystem, and a new NP-complete decision problem called quasi-cyclic syndrome decoding is introduced.
Compact McEliece Keys from Goppa Codes
TLDR
A simple way to reduce significantly the key size in McEliece and related cryptosystems using a subclass of Goppa codes, while also improving the efficiency of cryptographic operations to $\tilde{O}(n)$ time, and keeping the capability of correcting the full designed number of errors in the binary case is described.
A Public-Key System Based on Algebraic Coding Theory, Jet
  • Propulsion Lab, DSN Progress Report
  • 1978
and A
  • Otmani, Reducing Key Length of the McEliece Cryptosystem, Africacrypt
  • 2009
and E
  • Dahmen, Post-Quantum Cryptography, Springer, Berlin,
  • 2009
...
1
2
...