Sciweavers

211 search results - page 2 / 43
» PSS Is Secure against Random Fault Attacks
Sort
View
CHES
2006
Springer
131views Cryptology» more  CHES 2006»
15 years 1 months ago
Why One Should Also Secure RSA Public Key Elements
It is well known that a malicious adversary can try to retrieve secret information by inducing a fault during cryptographic operations. Following the work of Seifert on fault induc...
Eric Brier, Benoît Chevallier-Mames, Mathieu...
CHES
2010
Springer
172views Cryptology» more  CHES 2010»
14 years 10 months ago
Analysis and Improvement of the Random Delay Countermeasure of CHES 2009
Random delays are often inserted in embedded software to protect against side-channel and fault attacks. At CHES 2009 a new method for generation of random delays was described tha...
Jean-Sébastien Coron, Ilya Kizhvatov
FDTC
2009
Springer
191views Cryptology» more  FDTC 2009»
15 years 4 months ago
Protecting RSA against Fault Attacks: The Embedding Method
—Fault attacks constitute a major threat toward cryptographic products supporting RSA-based technologies. Most often, the public exponent is unknown, turning resistance to fault ...
Marc Joye
GI
2003
Springer
15 years 2 months ago
Byzantine Failures and Security: Arbitrary is not (always) Random
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
Felix C. Gärtner
CHES
2009
Springer
150views Cryptology» more  CHES 2009»
15 years 10 months ago
An Efficient Method for Random Delay Generation in Embedded Software
Random delays are a countermeasure against a range of side channel and fault attacks that is often implemented in embedded software. We propose a new method for generation of rando...
Ilya Kizhvatov, Jean-Sébastien Coron