Security of an identity-based cryptosystem and the related reductions

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

Volumn 1403, Issue , 1998, Pages 546-560

  Okamoto, Tatsuaki ^a   Uchiyama, Shigenori ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GEOMETRY;

ANOMALOUS CURVE; CRYPTOGRAPHIC SCHEMES; DIFFIE-HELLMAN PROBLEM; DISCRETE LOGARITHM PROBLEMS; ELLIPTIC CURVE; IDENTITY-BASED CRYPTOSYSTEM; KEY DISTRIBUTION;

CRYPTOGRAPHY;

EID: 63349085878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054153     Document Type: Conference Paper

References (17)

1. Bellare, M. and Rogaway, P.: Optimal Asymmetric Encryption, Proc. Of Eurocrypt’94, LNCS 950, Springer-Verlag pp.92-111 (1995).
2. Demytko, N.: A New Elliptic Curve Based Analogue of RSA, Proc. Of Eurocrypt’93, LNCS 765, Springer-Verlag, pp.40-49 (1994).
3. Diffie, W. and Heilman, M.: New Directions in Cryptography, IEEE Trans, on Information Theory, IT-22, 6, pp.644-654 (1976).
4. Fiat, A. and Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Proc. Of Crypto’86, LNCS 263, Springer-Verlag, pp.186-194 (1986).
5. n and Factoring n, in these proceedings.
6. Long, D.L.: Random Equivalence of Factorization and Computation of Orders, Technical Report 284, Princeton Univ. Dept, of EECS (1981).
7. Maurer, U. and Yacobi, Y.: Non-interactive Public-Key Cryptography, Proc. Of Eurocrypt’91, LNCS, Springer-Verlag, pp.498-507 (1992).
8. Maurer, U. and Yacobi, Y.: A Remark on a Non-interactive Public-Key Distribution System, Proc. Of Eurocrypt’92, LNCS, Springer-Verlag, pp.458-460 (1993).
9. Miller, G.L.: Riemann’s Hypothesis and Tests for Primality, JCSS, 13, pp.300-317 (1976).
10. p Suitable for Cryptosystems, Proc. Of Auscrypt’92, LNCS, Springer-Verlag, pp.479-504 (1993).
11. Okamoto, T. and Uchiyama, S.: A New Public-Key Cryptosystem as Secure as Factoring, in these proceedings.
12. Satoh, T. and Araki, K.: Fermat Quotient and the Polynomial Time Discrete Log Algorithm for Anomalous Elliptic Curves, Preprint (September, 1997).
13. Schoof, R.: Elliptic Curve over Finite Fields and the Computation of Square Roots Mod p, Mathematics of Computation, 44, pp.483-494 (1985).
14. Semaev, I.A.: Evaluation of Discrete Logarithms on Some Elliptic Curves, to appear in Mathematics of Computation.
15. Shamir, A.: Identity-Based Cryptosystems and Signature Schemes, Proc. Of Crypto’84, LNCS 196, Springer-Verlag, pp.47-53 (1985).
16. Silverman, J.: The Arithmetic of Elliptic Curves, GTM106, Springer-Verlag, 1986.
17. Smart, N.P.: The Discrete Logarithm Problem on Elliptic Curves of Trace One, Preprint (September, 1997).