(Enter summary)
Abstract: A new precomputation method is presented for computing g
R
for
a fixed element g and a randomly chosen exponent R in a given group. Our
method is more efficient and flexible than the previously proposed methods,
especially in the case where the amount of storage available is very small or
quite large. It is also very efficient in computing g
R
y
E
for a small size E and
variable number y, which occurs in the verification of Schnorr's identification
scheme or its variants. Finally it ... (Update)
Cited by: More
Efficient Primitives from Exponentiation in Z_p - Jiang (2006)
(Correct)
Improving Secure Server Performance by Re-balancing.. - Castelluccia.. (2005)
(Correct)
Efficient Comb Elliptic Curve Multiplication Methods.. - Feng, Zhu, Xu, Li (2005)
(Correct)
Active bibliography (related documents): More All
0.3: Sparse RSA Secret Keys and Their Generation - Lim, Lee (1996)
(Correct)
0.2: Fast Modular Reduction With Precomputation - Lim, Hwang, Lee
(Correct)
0.2: Efficiency and Security of Cryptosystems based on Number Theory - Bleichenbacher (1996)
(Correct)
Similar documents based on text: More All
0.6: A Key Recovery Attack on Discrete Log-based Schemes Using a.. - Lim, Lee (1997)
(Correct)
0.6: Server(Prover/Signer)-Aided Verification of Identity Proofs and.. - Lim, Lee
(Correct)
0.5: Authenticated Session Keys and Their Server-Aided Computation - Lim, Lee
(Correct)
Related documents from co-citation: More All
18: Fast exponentiation with precomputation (context) - Brickell, Gordon et al. - 1992
16: A method for obtaining digital signatures and public-key cryptosystems; Communic..
- Rivest, Shamir et al. - 1978
14: Efficient Signature Generation by Smart Cards (context) - Schnorr - 1991
BibTeX entry: (Update)
C.H.Lim and P.J.Lee : `More flexible exponentiation with precomputation', Advances in Cryptology-Crypto'94, Springer-Verlag, pp.95-107 (1994). http://citeseer.ist.psu.edu/lim94more.html More
@article{ lim94more,
author = "Chae Hoon Lim and Pil Joong Lee",
title = "More Flexible Exponentiation with Precomputation",
journal = "Lecture Notes in Computer Science",
volume = "839",
pages = "95--107",
year = "1994",
url = "citeseer.ist.psu.edu/lim94more.html" }
Citations (may not include all citations):
2003
The art of computer programming (context) - Knuth - 1981
1529
A method for obtaining digital signatures and public-key cry..
- Rivest, Shamir et al. - 1978
147
Efficient signature generation by smart cards (context) - Schnorr - 1991
89
Fast exponentiation with precomputation (context) - Brickell, Gordon et al. - 1992
63
Provably secure and practical identification schemes and cor.. (context) - Okamoto - 1992
34
An interactive identification scheme based on discrete logar.. (context) - Brickell, McCurley - 1992
24
Addition chain heuristics (context) - Bos, Coster - 1990
19
A proposed Federal information processing standard for digit.. (context) - information, for et al. - 1991
18
Computing sequences with addition chains (context) - Downey, Leony et al. - 1981
12
Minimum weight modified signed-digit representations and fas.. (context) - Jedwab, Mitchell - 1989
12
Basic digit sets for radix representation (context) - Matula - 1982
10
Resource requirements for the application of addition chains.. (context) - Sauerbrey, Dietel - 1992
5
An improved binary algorithm for RSA (context) - Zhang - 1993
1
A public key cryptosystem and a signature scheme based on th.. (context) - ElGmal - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wooly.postech.ac.kr/library/publication.html): More
Modified Maurer-Yacobi's scheme and its applications - Lim, Lee (1993)
(Correct)
Remarks on the Use of RSA Moduli With Prespecified Bits - Chae Hoon
(Correct)
Message Encryption and Authentication Using One-Way Hash Functions - Lim (1996)
(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