281 search results - page 23 / 57 » Non-black-box Techniques in Cryptography |
FDTC
2009
Springer
14 years 4 months ago
2009
Springer
—Fault attacks constitute a major threat toward cryptographic products supporting RSA-based technologies. Most often, the public exponent is unknown, turning resistance to fault ...
ARITH
2007
IEEE
14 years 4 months ago
2007
IEEE
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
FDTC
2007
Springer
14 years 4 months ago
2007
Springer
We present a novel non-linear error coding framework which incorporates strong adversarial fault detection capabilities into identity based encryption schemes built using Tate pai...
PKC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
ACNS
2005
Springer
14 years 3 months ago
2005
Springer
We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modified tree hash that is more efficient than standard tree hashing is us...