109
click to vote
CTRSA
15 years 6 months ago
2003 Springer 
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
CTRSA
15 years 6 months ago
2003 Springer 
We present extremely simple ways of embedding a backdoor in the key generation scheme of RSA. Three of our schemes generate two genuinely random primes p and q of a given size, to...
102
click to vote
CTRSA
15 years 6 months ago
2003 Springer
Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilien...
101
click to vote
CTRSA
15 years 6 months ago
2003 Springer 
We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For...
CTRSA
15 years 6 months ago
2003 Springer 
This paper provides a comprehensive treatment of forward-security in the context of sharedkey based cryptographic primitives, as a practical means to mitigate the damage caused by...
|
Cryptology