Sciweavers

71 search results - page 8 / 15
» Public Key Perturbation of Randomized RSA Implementations
Sort
View
ASIACRYPT
2001
Springer
15 years 2 months ago
How to Achieve a McEliece-Based Digital Signature Scheme
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
Nicolas Courtois, Matthieu Finiasz, Nicolas Sendri...
FDTC
2007
Springer
124views Cryptology» more  FDTC 2007»
15 years 3 months ago
Countermeasures against Branch Target Buffer Attacks
Branch Prediction Analysis has been recently proposed as an attack method to extract the key from software implementations of the RSA public key cryptographic algorithm. In this p...
Giovanni Agosta, Luca Breveglieri, Gerardo Pelosi,...
DAM
2006
121views more  DAM 2006»
14 years 9 months ago
Fine-grained forward-secure signature schemes without random oracles
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-...
Jan Camenisch, Maciej Koprowski
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
13 years 2 hour ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
15 years 1 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...