Sciweavers

468 search results - page 23 / 94
» A Certified Digital Signature
Sort
View
ASAP
2006
IEEE
110views Hardware» more  ASAP 2006»
14 years 3 months ago
Low-Cost Elliptic Curve Digital Signature Coprocessor for Smart Cards
This paper proposes different low-cost coprocessors for public key authentication on 8-bit smart cards. Elliptic curve cryptography is used for its efficiency per bit of key and ...
Guerric Meurice de Dormale, Renaud Ambroise, David...
CSFW
2008
IEEE
14 years 4 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
CHES
2000
Springer
86views Cryptology» more  CHES 2000»
14 years 2 months ago
MiniPASS: Authentication and Digital Signatures in a Constrained Environment
Abstract. We describe an implementation of the PASS polynomial authentication and signature scheme [5, 6] that is suitable for use in highly constrained environments such as SmartC...
Jeffrey Hoffstein, Joseph H. Silverman
DCC
2003
IEEE
14 years 9 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski
JOC
2002
99views more  JOC 2002»
13 years 9 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski