See this document in CiteSeerX!

New Public-Key Schemes Based on Elliptic Curves over the Ring Z_n (1991)  (Make Corrections)  (54 citations)
Kenji Koyama, Ueli M Maurer, Tatsuaki Okamoto, Scott A Vanstone
CRYPTO



  Home/Search   Context   Related

 
View or download:
inf.ethz.ch/pub/crypto/publ...KMOV91.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  crypto.ethz.ch/research/pkc/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Three new trapdoor one-way functions are proposed that are based on elliptic curves over the ring Z_n. The first class of functions is a naive construction, which can be used only in a digital signature scheme, and not in a public-key cryptosystem. The second, preferred class of function, does not suffer from this problem and can be used for the same applications as the RSA trapdoor one-way function, including zero-knowledge identification protocols. The third class of functions has similar... (Update)

Cited by:   More
Public Key Based Cryptoschemes for Data Concealment in.. - Mykletun, Girao.. (2006)   (Correct)
Trapdooring Discrete Logarithms on Elliptic - Curves Over Rings   (Correct)
Public-Key Cryptosystems Based on Composite - Degree Residuosity Classes   (Correct)

Active bibliography (related documents):   More   All
0.8:   Fast Generation of Prime Numbers and Secure Public-Key.. - Maurer (1994)   (Correct)
0.3:   Twenty Years of Attacks on the RSA Cryptosystem - Boneh (1999)   (Correct)
0.3:   A Certification Scheme for Electronic Commerce - Crispo, Lomas (1996)   (Correct)

Similar documents based on text:   More   All
0.4:   EPOC: Efficient Probabilistic Public-Key Encryption.. - Okamoto, Uchiyama.. (1998)   (Correct)
0.4:   Elliptic Curves over Finite Fields - Giuliani (1999)   (Correct)
0.3:   ID-based Signatures from Pairings on Elliptic Curves - Paterson (2002)   (Correct)

Related documents from co-citation:   More   All
43:   A method for obtaining digital signatures and public-key cryptosystems; Communic.. - Rivest, Shamir et al. - 1978
32:   A new elliptic curve based analogue of RSA (context) - Demytko - 1994
23:   Elliptic curve cryptosystems (context) - Koblitz - 1987

BibTeX entry:   (Update)

K. Koyama, U. M. Maurer, T. Okamoto, and S. A. Vanstone. New public-key schemes based on elliptic curves over the ring Zn . In J. Feigenbaum, editor, Advance in Cryptology -- Crypto '91, volume 576 of Lectures Notes in Computer Science, pages 252--266. Springer-Verlag, 1991. http://citeseer.ist.psu.edu/koyama91new.html   More

@inproceedings{ koyama91new,
    author = "Kenji Koyama and Ueli M. Maurer and Tatsuaki Okamoto and Scott A. Vanstone",
    title = "New Public-Key Schemes Based on Elliptic Curves over the Ring Z_n",
    booktitle = "{CRYPTO}",
    pages = "252-266",
    year = "1991",
    url = "citeseer.ist.psu.edu/koyama91new.html" }
Citations (may not include all citations):
1529   A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
428   IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
239   Blind signatures for untraceable payments (context) - Chaum - 1982
237   The Arithmetic of Elliptic Curves (context) - Silverman - 1986
186   A public key cryptosystem and a signature scheme based on th.. (context) - El-Gamal - 1985
134   Reducing Elliptic Curve Logarithms to Logarithms in a Finite.. (context) - Menezes, Okamoto et al. - 1991
134   Factoring integers with elliptic curves (context) - Lenstra - 1987
92   Riemann's hypothesis and tests for primality (context) - Miller - 1976
78   Probabilistic algorithm for testing primality (context) - Rabin
72   Elliptic curves over finite fields and the computation of sq.. (context) - Schoof - 1985
50   The number field sieve - Lenstra, Lenstra et al.
43   Non-interactive public-key cryptography (context) - Maurer, Yacobi
43   Factoring with two large primes (context) - Lenstra, Manasse
38   Almost all primes can be quickly certified (context) - Goldwasser, Kilian - 1986
19   On taking roots in finite fields (context) - Adleman, Manders et al. - 1977
16   public key cryptosystem (context) - Simmons, Norris et al. - 1977
7   Berlin: Springer-Verlag (context) - Koblitz, in et al. - 1987
4   Advanced Technology Seminars (context) - Massey, fundamentals et al. - 1988
4   Computational problems associated with Racah algebra (context) - Stein - 1961
3   Attacks on some RSA signatures (context) - Jonge, Chaum - 1985
2   and New York (context) - Kranakis, Cryptography et al. - 1986
1   A pseudo-random bit generator based on elliptic ligarithms (context) - Kaliski - 1987
1   Fast generation of RSA-moduli with almost maximal diversity (context) - Maurer - 1990



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.crypto.ethz.ch/research/pkc/):
A Calculus for Security Bootstrapping in Distributed Systems - Maurer, Schmid (1996)   (Correct)
Intrinsic Limitations of Digital Signatures and - How To Cope   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC