6 search results - page 1 / 2 » Cryptanalysis of a provably secure CRT-RSA algorithm |
CCS
2004
ACM
13 years 10 months ago
2004
ACM
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
SACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
FSE
1997
Springer
13 years 9 months ago
1997
Springer
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
USENIX
2007
13 years 7 months ago
2007
Users are storing ever-increasing amounts of information digitally, driven by many factors including government regulations and the public’s desire to digitally record their per...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...