|
|
Generating ElGamal signatures without knowing the secret key
– Daniel Bleichenbacher Eth, Daniel Bleichenbacher
- 1996
|
|
1
|
Computational Methods in Public Key Cryptology
– Arjen K. Lenstra
- 2002
|
|
|
A Survey of Elliptic Curve Cryptosystems, Part I: Introductory
– San C. Vo
- 2003
|
|
1
|
Generating Efficient Primes for Discrete Log Cryptosystems
– Chae Hoon Lim, Pil Joong Lee
|
|
2
|
Meta-ElGamal signature schemes using a composite module
– Patrick Horster, Markus Michels, Holger Petersen
- 1994
|
|
14
|
Designing and detecting trapdoors for discrete log cryptosystems
– Daniel M. Gordon
- 1993
|
|
6
|
Distribution Of Modular Sums And The Security Of The Server Aided Exponentiation
– Phong Q. Nguyen, Igor E. Shparlinski, Jacques Stern
- 2000
|
|
|
A Short Note on Girault's Self-Certified Model
– Shahrokh Saeednia
- 2001
|
|
6
|
RSA Key Generation with Verifiable Randomness
– Ari Juels, Jorge Guajardo
- 2002
|
|
16
|
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
– Ahmad-reza Sadeghi, Michael Steiner
- 2002
|
|
4
|
Speeding up Exponentiation using an Untrusted Computational Resource
– Dwaine Clarke, Srinivas Devadas, Marten Van Dijk, Blaise Gassend, G. Edward Suh
- 2003
|
|
|
Novel Secure Communication Protocol for Conditional Access System
– Liu Yongliang, Xiaolin Yang, Hongxun Yao, Wen Gao
- 2005
|
|
15
|
On The Fly Signatures based on Factoring
– Guillaume Poupard , Jacques Stern
- 1999
|
|
4
|
Computing Discrete Logarithms with the General Number Field Sieve
– Damian Weber
- 1996
|
|
3
|
An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p
– Damian Weber
- 1994
|
|
6
|
Computing Discrete Logarithms with Quadratic Number Rings
– Damian Weber
- 1998
|
|
1
|
About Generic Conversions from any Weakly Secure Encryption Scheme into a Chosen-Ciphertext Secure Scheme
– David Pointcheval
- 2001
|
|
|
A SHORT NOTE ON DISCRETE LOG PROBLEM IN F ∗ p
– Habeeb Syed
|
|
78
|
The XTR public key system
– Arjen K. Lenstra, Eric R. Verheul
- 2000
|
