Sciweavers

ASIACRYPT
2006
Springer
14 years 3 months ago
On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
Gregor Leander, Andy Rupp
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
14 years 5 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye
CARDIS
2010
Springer
175views Hardware» more  CARDIS 2010»
14 years 6 months ago
The Polynomial Composition Problem in (Z/nZ)[X]
Let n be an RSA modulus and let P, Q ∈ (Z/nZ)[X]. This paper explores the following problem: Given polynomials Q and Q(P), find polynomial P. We shed light on the connections be...
Marc Joye, David Naccache, Stéphanie Porte