IMA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
IMA
2009
Springer
14 years 2 months ago
2009
Springer
In previous work we showed how to compress certain prime-order subgroups of the cyclotomic subgroups of orders 22m + 1 of the multiplicative groups of F∗ 24m by a factor of 4. We...
IMA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
IMA
2009
Springer
14 years 2 months ago
2009
Springer
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...
IMA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adver...
IMA
2009
Springer
14 years 2 months ago
2009
Springer
FDTC
2009
Springer
14 years 2 months ago
2009
Springer
—This paper shows that optical emissions from an operating chip have a good correlation with power traces and can therefore be used to estimate the contribution of different area...
FDTC
2009
Springer
14 years 2 months ago
2009
Springer
—Fault attacks constitute a major threat toward cryptographic products supporting RSA-based technologies. Most often, the public exponent is unknown, turning resistance to fault ...
FDTC
2009
Springer
14 years 2 months ago
2009
Springer
—In order to protect crypto-systems against side channel attacks various countermeasures have been implemented such as dual-rail logic or masking. Faults attacks are a powerful t...
FDTC
2009
Springer
14 years 2 months ago
2009
Springer
—Fault injection attacks are a powerful tool to exploit implementative weaknesses of robust cryptographic algorithms. The faults induced during the computation of the cryptograph...