Sciweavers

24 search results - page 2 / 5
» A New Side-Channel Attack on RSA Prime Generation
Sort
View
AAECC
2004
Springer
76views Algorithms» more  AAECC 2004»
13 years 5 months ago
On the Security of RSA with Primes Sharing Least-Significant Bits
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
Ron Steinfeld, Yuliang Zheng
PKC
2005
Springer
144views Cryptology» more  PKC 2005»
13 years 10 months ago
RSA with Balanced Short Exponents and Its Application to Entity Authentication
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
Hung-Min Sun, Cheng-Ta Yang
CRYPTO
2003
Springer
137views Cryptology» more  CRYPTO 2003»
13 years 10 months ago
New Partial Key Exposure Attacks on RSA
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...
Johannes Blömer, Alexander May
CHES
2009
Springer
150views Cryptology» more  CHES 2009»
14 years 5 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
EUROCRYPT
2001
Springer
13 years 9 months ago
Practical Threshold RSA Signatures without a Trusted Dealer
We propose a threshold RSA scheme which is as efficient as the fastest previous threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup’s and in previous schem...
Ivan Damgård, Maciej Koprowski