|
41
|
Non-interactive Public-key Cryptography
– U Maurer, Y Yacobi
- 1992
|
|
535
|
Identity-based cryptosystems and signature schemes
– Adi Shamir
|
|
2292
|
New Directions in Cryptography
– Whitfield Diffie, Martin E. Hellman
- 1976
|
|
707
|
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
– Amos Fiat, Adi Shamir
- 1987
|
|
15
|
Modified Maurer-Yacobi's scheme and its applications
– Chae Hoon Lim, Pil Joong Lee
- 1993
|
|
852
|
Identity-Based Encryption from the Weil Pairing
– Dan Boneh, Matthew Franklin
- 2001
|
|
50
|
Identity Based Cryptosystems and Signature Schemes
– Shamir
- 1984
|
|
5
|
J.-K.: ID-based cryptographic schemes using a non-interactive public-key distribution system
– Y-M Tseng
|
|
161
|
An identity based encryption scheme based on quadratic residues
– Clifford Cocks
- 2001
|
|
61
|
Theorems of factorization and primality testing
– John M Pollard
- 1974
|
|
3
|
A Note On The Weakness Of The Maurer-Yacobi Squaring Method
– Dennis Kügler, Markus Maurer
- 1999
|
|
145
|
M.: Cryptosystems based on pairings
– R Sakai, K Ohgishi, Kasahara
- 2000
|
|
2057
|
Handbook of Applied Cryptography
– Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest
- 1997
|
|
6
|
Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders
– Detlef Hühnlein
|
|
7
|
Reducing Logarithms in Totally Non-Maximal Imaginary Quadratic Orders to Logarithms in Finite Fields (Extended Abstract)
– Detlef Hühnlein, Tsuyoshi Takagi, C To
- 1999
|
|
24
|
Subexponential class group computation in quadratic orders
– M J Jacobson
- 1999
|
|
16
|
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
– Detlef Hühnlein, Michael J. Jacobson, Jr., Sachar Paulus, Tsuyoshi Takagi
|
|
172
|
Number theory
– Z Borevich, I R Shafarevich
- 1967
|
|
12
|
An Analysis of the Reduction Algorithms for Binary Quadratic Forms
– Ingrid Biehl, Johannes Buchmann
- 1997
|
