Faster generation of nice-schnorr-type signatures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2020, Issue , 2001, Pages 1-12

  Hühnlein, Detlef ^a  

^a Westfälische Hochschule und secunet Security Networks AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERIZED TOMOGRAPHY; CRYPTOGRAPHY;

MODULAR EXPONENTIATIONS; SIGNATURE GENERATION; SIGNATURE SCHEME; SURJECTIVE;

NETWORK SECURITY;

EID: 25044448410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45353-9_1     Document Type: Conference Paper

References (15)

1. Z. I. Borevich and I. R. Shafarevich: Number Theory Academic Press: New York, 1966
2. H. Cohen: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics 138. Springer: Berlin, 1993.
3. D. A. Cox: Primes of the form x2 + ny2, John Wiley & Sons, New York, 1989
4. D. Huhnlein, M. J. Jacobson, S. Paulus and T. Takagi: A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption, Advances in Cryp¬tology-EUROCRYPT’98, LNCS 1403, Springer, 1998, pp. 294-307
5. D. Huhnlein: Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders, Proceedings of SAC’99, LNCS 1758, Springer, 2000, pp. 150-167
6. D. Huhnlein, T. Takagi: Reducing logarithms in totally non-maximal ima¬ginary quadratic orders to logarithms in finite fields, Advances in Cryptology-ASIACRYPT’99, Springer, LNCS 1716, 1999, pp. 219-231
7. D. Huhnlein, J. Merkle: An efficient NICE-Schnorr-type signature scheme, Procee¬dings of PKC 2000, LNCS 1751, Springer, 2000, pp. 14-27
8. D. Huuhnlein: Quadratic orders for NESSIE-Overview and parameter sizes of three public key families, Technical Report, TI 3/00, TU-Darmstadt, 2000
9. D. Huuhnlein: Cryptosystems based on quadratic orders, (in German), PhD-thesis, TU-Darmstadt, Germany, forthcoming, 2000
10. E. Jaulmes, A. Joux: A NICE Cryptoanalysis, Advances in Cryptology-EU-ROCRYPT’00, LNCS 1807, Springer, 2000, pp. 382-391
11. LiDIA: A c + + library for algorithmic number theory, via http://www. informatik. tu-darmstadt. de/TI/LiDIA
12. J. Neukirch: Algebraische Zahlentheorie, Springer, Berlin, 1992
13. S. Paulus and T. Takagi: A new public-key cryptosystem over quadratic orders with quadratic decryption time Journal of Cryptology, vol. 13, no. 2, 2000, pp. 263-272
14. G. Poupard, J. Stern: Security Analysis of a Practical”on the fly” Authentication and Signature Generation, Advances in Cryptology-EUROCRYPT’98, LNCS 1403, Springer, 1998, pp. 422-436
15. C. P. Schnorr: Efficient identification and signatures for smart cards, Advances in Cryptology-CRYPTO’89, LNCS 435, 1990, pp. 239-252