Cryptanalysis in prime order subgroups of Z*n

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

Volumn 1514, Issue , 1998, Pages 214-226

  Mao, Wenbo ^a   Lim, Chae Hoon ^b  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

^b Future Systems Inc   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; SECURITY OF DATA;

CRYPTOGRAPHIC PROTOCOLS; DISCRETE LOGARITHMS; HIDDEN INFORMATION; PRIME ORDERS; RUNNING TIME; SECURITY FAILURE; SIMPLE ALGORITHM; TIME COMPLEXITY;

CRYPTOGRAPHY;

EID: 84947723778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49649-1_18     Document Type: Conference Paper

References (19)

1. Bao, F., R. Deng and W. Mao. Efficient and practical fair exchange protocols with off-line TTP. 1998 IEEE Symposium on Security and Privacy. Oakland, May 1998. pages 77-85. IEEE Compute Society.
2. Boyd, C. Digital signature and public key cryptosystem in a prime order subgroup of Z*n. First International Conference on Information and Communications Security, ICICS'97 (LNCS 1334), pages 346-355. Springer, 1997.
3. Boyd, C. Presentation in First International Conference on Information and Communications Security, ICICS'97 for fixing a flaw in the paper "Digital signature and public key cryptosystem in a prime order subgroup of Z*n". Beijing, November 1997.
4. Boyd, C. Personal communications.
5. H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag Graduate Texts in Mathematics 138. 1993.
6. ElGamal, T. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31(4):469-472, July 1985.
7. Fiat, A. and A. Shamir. How to prove yourself: Practical solution to identification and signature problems. Advances in Cryptology — Proceedings of CRYPTO'86 (LNCS 263), pages 186-194. Springer-Verlag, 1987.
8. Girault, M. An identity-based identification scheme based on discrete logarithms modulo a composite number. In Advances in Cryptology — Proceedings of EU-ROCRYPT'90 (LNCS 473), pages 481-486. Springer-Verlag, 1991.
9. Girault, M. and J.C. Pailles. An identity-based scheme providing zero-knowledge authentication and authenticated key-exchange. First European Symposium on Research in Computer Security-ESORICS'90, pages 173-184. 1990.
10. Guillou, L.C. and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Advances in Cryptology — Proceedings of EUROCRYPT'88 (LNCS 330), pages 123-128. Springer-Verlag, 1988.
11. Kim, S. J., S. J. Park and D. H. Won. Convertible group signatures. Advances in Cryptology — Proceedings of ASIACRYPT'96 (LNCS 1163), pages 310-321. Springer, 1996.
12. Lim, C.H. and P.J. Lee. Sparse RSA secret keys and their generation. Proc. 3rd Workshop on Selected Areas of Cryptography, Aug.15-16, 1996, pp.117-131, Queen's University, Ontario.
13. Park, S., S. Kim and D. Won. ID-based group signature. Electronics Letters.Vol.33, No.19, pages 1616-1617. September 1997.
14. Pollard, J.M. Monte Carlo method for index computation (mod p), Mth. Comp.,Vol.32, No.143 (1978), pages 918-924.
15. Rabin, M.O. Digital signatures and public-key functions as intractable as factorization. MIT Laboratory for Computer Science, Technical Report, MIT/LCS/TR-212.1979.
16. Rivest, R.L., A. Shamir and L.M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications ofthe ACM v.21, n.2, pages120-126. 1978.
17. Van Oorschot, P.C. and M.J. Wiener, Parallel collision search with application to hash functions and discrete logarithms, Proc. 2nd ACM Conference on Computer and Communications Security, Nov.2-4 1994, Fairfax, Verginia, pp.210-218. (a revised version to appear in Journal of Cryptology)
18. Van Oorschot, P.C. and M.J. Wiener, On Diffie-Hellman key agreement with short exponents, Advances in Cryptology-EUROCRYPT'96 (LNCS 1070), pages 332343, Springer-Verlag, 1996.
19. Zheng, Y., T. Matsumoto and H. Imai. Residuosity problem and its applications to cryptography. Trans. IEICE, Vol.E71, No.8, pages 759-767. 1988.