Sciweavers

127 search results - page 5 / 26
» On Cryptographic Schemes Based on Discrete Logarithms and Fa...
Sort
View
ASIACRYPT
2000
Springer
13 years 11 months ago
Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
Abstract. In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies t...
Safuat Hamdy, Bodo Möller
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 12 days ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
JOC
2000
181views more  JOC 2000»
13 years 6 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
PKC
2000
Springer
132views Cryptology» more  PKC 2000»
13 years 10 months ago
The Composite Discrete Logarithm and Secure Authentication
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
David Pointcheval
ASIACRYPT
2000
Springer
13 years 11 months ago
Trapdooring Discrete Logarithms on Elliptic Curves over Rings
This paper introduces three new probabilistic encryption schemes using elliptic curves over rings. The cryptosystems are based on three specific trapdoor mechanisms allowing the r...
Pascal Paillier