Sciweavers

7 search results - page 2 / 2
» Cryptanalysis of the m-Permutation Protection Schemes
Sort
View
CCS
2004
ACM
13 years 10 months ago
Cryptanalysis of a provably secure CRT-RSA algorithm
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...
David Wagner
TCC
2005
Springer
169views Cryptology» more  TCC 2005»
13 years 10 months ago
Chosen-Ciphertext Security of Multiple Encryption
Encryption of data using multiple, independent encryption schemes (“multiple encryption”) has been suggested in a variety of contexts, and can be used, for example, to protect ...
Yevgeniy Dodis, Jonathan Katz