25 search results - page 1 / 5 » Breaking a Cryptographic Protocol with Pseudoprimes |
PKC
2005
Springer
13 years 10 months ago
2005
Springer
The Miller-Rabin pseudo primality test is widely used in cryptographic libraries, because of its apparent simplicity. But the test is not always correctly implemented. For example ...
ICS
2010
Tsinghua U.
14 years 2 months ago
2010
Tsinghua U.
COCO
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Differential Power Analysis (DPA) presents a major challenge to mathematically-secure cryptographic protocols. Attackers can break the encryption by measuring the energy consumed i...
MA
2001
Springer
13 years 9 months ago
2001
Springer
Mobile agent security is still a young discipline and most naturally, the focus up to the time of writing was on inventing new cryptographic protocols for securing various aspects ...