Sciweavers

948 search results - page 9 / 190
» Attacking cryptographic schemes based on
Sort
View
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
14 years 2 months ago
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
Marc Joye
FDTC
2006
Springer
74views Cryptology» more  FDTC 2006»
13 years 11 months ago
Fault Attack Resistant Cryptographic Hardware with Uniform Error Detection
Traditional hardware error detection methods based on linear codes make assumptions about the typical or expected errors and faults and concentrate the detection power towards the ...
Konrad J. Kulikowski, Mark G. Karpovsky, Alexander...
IMA
2005
Springer
85views Cryptology» more  IMA 2005»
14 years 1 months ago
The Physically Observable Security of Signature Schemes
In recent years much research has been devoted to producing formal models of security for cryptographic primitives and to designing schemes that can be proved secure in such models...
Alexander W. Dent, John Malone-Lee
CSFW
2005
IEEE
14 years 1 months ago
Reconstruction of Attacks against Cryptographic Protocols
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...
Xavier Allamigeon, Bruno Blanchet
CRYPTO
2006
Springer
140views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Lattice-Based Cryptography
We describe some of the recent progress on lattice-based cryptography, starting from the seminal work of Ajtai, and ending with some recent constructions of very efficient cryptogr...
Oded Regev