Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
PKC
2005
Springer
109views Cryptology» more  PKC 2005»
12 years 5 days ago
Fast Multi-computations with Integer Similarity Strategy
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih
PKC
2005
Springer
89views Cryptology» more  PKC 2005»
12 years 5 days ago
A New Related Message Attack on RSA
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
Oded Yacobi, Yacov Yacobi
PKC
2005
Springer
90views Cryptology» more  PKC 2005»
12 years 5 days ago
Tractable Rational Map Signature
Lih-Chung Wang, Yuh-Hua Hu, Feipei Lai, Chun-yen C...
PKC
2005
Springer
144views Cryptology» more  PKC 2005»
12 years 5 days 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
PKC
2005
Springer
167views Cryptology» more  PKC 2005»
12 years 5 days ago
Converse Results to the Wiener Attack on RSA
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...
Ron Steinfeld, Scott Contini, Huaxiong Wang, Josef...
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
12 years 5 days ago
On the Optimization of Side-Channel Attacks by Advanced Stochastic Methods
Abstract. A number of papers on side-channel attacks have been published where the side-channel information was not exploited in an optimal manner, which reduced their efficiency. ...
Werner Schindler
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
12 years 5 days ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz
PKC
2005
Springer
94views Cryptology» more  PKC 2005»
12 years 5 days ago
The Security of the FDH Variant of Chaum's Undeniable Signature Scheme
In this paper, we first introduce a new kind of adversarial goal called forge-and-impersonate in undeniable signature schemes. Note that forgeability does not necessarily imply im...
Wakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng
PKC
2005
Springer
102views Cryptology» more  PKC 2005»
12 years 5 days ago
Experimenting with Faults, Lattices and the DSA
We present an attack on DSA smart-cards which combines physical fault injection and lattice reduction techniques. This seems to be the first (publicly reported) physical experimen...
David Naccache, Phong Q. Nguyen, Michael Tunstall,...
PKC
2005
Springer
114views Cryptology» more  PKC 2005»
12 years 5 days ago
Cryptanalysis of the Tractable Rational Map Cryptosystem
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
Antoine Joux, Sébastien Kunz-Jacques, Fr&ea...
books