Sciweavers

CHES
2007
Springer
107views Cryptology» more  CHES 2007»
14 years 1 months ago
Secret External Encodings Do Not Prevent Transient Fault Analysis
Contrarily to Kerckhoffs’ principle, many applications of today’s cryptography still adopt the security by obscurity paradigm. Furthermore, in order to rely on its proven or e...
Christophe Clavier
CHES
2007
Springer
110views Cryptology» more  CHES 2007»
14 years 1 months ago
RFID Noisy Reader How to Prevent from Eavesdropping on the Communication?
RFID applications do not always use encryption to ensure the security as public key cryptographic algorithms that are costly in term of computing resources. We proposed to secure t...
O. Savry, F. Pebay-Peyroula, F. Dehmas, G. Robert,...
CHES
2007
Springer
89views Cryptology» more  CHES 2007»
14 years 1 months ago
DPA-Resistance Without Routing Constraints?
Benedikt Gierlichs
CHES
2007
Springer
99views Cryptology» more  CHES 2007»
14 years 1 months ago
Masking and Dual-Rail Logic Don't Add Up
Patrick Schaumont, Kris Tiri
CHES
2007
Springer
173views Cryptology» more  CHES 2007»
14 years 1 months ago
Collision Attacks on AES-Based MAC: Alpha-MAC
Message Authentication Code construction Alred and its AES-based instance Alpha-MAC were introduced by Daemen and Rijmen in 2005. We show that under certain assumptions about its i...
Alex Biryukov, Andrey Bogdanov, Dmitry Khovratovic...
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
14 years 1 months ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron
CHES
2007
Springer
131views Cryptology» more  CHES 2007»
14 years 1 months ago
Differential Behavioral Analysis
Bruno Robisson, Pascal Manet
CHES
2007
Springer
131views Cryptology» more  CHES 2007»
14 years 1 months ago
Gaussian Mixture Models for Higher-Order Side Channel Analysis
Kerstin Lemke-Rust, Christof Paar
CHES
2007
Springer
136views Cryptology» more  CHES 2007»
14 years 1 months ago
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
Tetsuya Izu, Jun Kogure, Takeshi Shimoyama