Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Discrete logarithms in GF(P) using the number field sieve
SIAM Journal on Discrete Mathematics
A course in computational algebraic number theory
A course in computational algebraic number theory
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
A Non-interactive Public-Key Distribution System
Designs, Codes and Cryptography
Computing ray class groups, conductors and discriminants
Mathematics of Computation
Using number fields to compute logarithms in finite fields
Mathematics of Computation
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Faster Generation of NICE-Schnorr-Type Signatures
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
The Solution of McCurley's Discrete Log Challenge
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
An Efficient NICE-Schnorr-Type Signature Scheme
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Selecting Cryptographic Key Sizes
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Computing Discrete Logarithms with the General Number Field Sieve
ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
Designs, Codes and Cryptography
On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Security estimates for quadratic field based cryptosystems
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Crypto-Book: an architecture for privacy preserving online identities
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
| Hi-index | 0.00 |
We present a new non-interactive public-key distribution system based on the class group of a non-maximal imaginary quadratic order Cl( Δp). The main advantage of our system over earlier proposals based on (Z}/nZ)* [25,27] is that embedding id information into group elements in a cyclic subgroup of the class group is easy (straight-forward embedding into prime ideals suffices) and secure, since the entire class group is cyclic with very high probability. Computational results demonstrate that a key generation center (KGC) with modest computational resources can set up a key distribution system using reasonably secure public system parameters. In order to compute discrete logarithms in the class group, the KGC needs to know the prime factorization of Δp=Δ1 p2. We present an algorithm for computing discrete logarithms in Cl(Δp) by reducing the problem to computing discrete logarithms in Cl(Δ1) and either F*p or F*p2. Our algorithm is a specific case of the more general algorithm used in the setting of ray class groups [5]. We prove—for arbitrary non-maximal orders—that this reduction to discrete logarithms in the maximal order and a small number of finite fields has polynomial complexity if the factorization of the conductor is known.