Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David B. Wilson  @ NUS Home/Search
Context Related
| securitytechnet.com/crypto/al...bgmw.ps Cached: PS.gz PS PDF Image Update Help From: securitytechnet....implementation (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In several cryptographic systems, a fixed element g of a group of order N is repeatedly raised to many different powers. In this paper we present a practical method of speeding up such systems, using precomputed values to reduce the number of multiplications needed. In practice this provides a substantial improvement over the level of performance that can be obtained using addition chains, and allows the computation of g for n ! N in O(log N= log log N) multiplications. We show that... (Update)
Cited by: More
Optimal Left-to-right Binary Signed-Digit Recoding - Joye, Yen (2000) (Correct)
Hardware Implementation of an Elliptic Curve Processor.. - Örs, Batina, Preneel.. (2002) (Correct)
Active bibliography (related documents): More All
0.6: A Survey of Fast Exponentiation Methods - Gordon (1998) (Correct)
0.3: On Quasilinear Time Complexity Theory - Naik, Regan, Sivakumar (1994) (Correct)
0.2: Efficient Parallel Exponentiation in GF(2^n) Using Normal.. - Lee, Kim, Park, Cho (2001) (Correct)
Similar documents based on text: More All
0.4: High-Speed RSA Implementation - Koc (1994) (Correct)
0.2: More Flexible Exponentiation with Precomputation - Lim, Lee (1994) (Correct)
0.2: Fast Server-Aided RSA Signatures Secure Against Active Attacks - Béguin, Quisquater (Correct)
Related documents from co-citation: More All
9: Addition chain heuristics (context) - Bos, Coster - 1990
9: Computing sequences with addition chains (context) - Downey, Leong et al. - 1981
9: A method for obtaining digital signatures and public-key cryptosystems; Communic.. - Rivest, Shamir et al. - 1978
BibTeX entry: (Update)
E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson. Fast exponentiation with precomputation: algorithms and lower bounds. preprint, 1995, contact the second author for a copy. http://citeseer.comp.nus.edu.sg/676454.html More
@misc{ brickell95fast,
author = "E. Brickell and D. Gordon and K. McCurley and D. Wilson",
title = "Fast exponentiation with precomputation: algorithms and lower bounds",
text = "E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson. Fast exponentiation
with precomputation: algorithms and lower bounds. preprint, 1995, contact
the second author for a copy.",
year = "1995",
url = "citeseer.comp.nus.edu.sg/676454.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1981
2003 The Art of Computer Programming (context) - Knuth - 1981
428 IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
147 Efficient signature generation by smart cards (context) - Schnorr
73 Speeding up the computations on an elliptic curve using addi.. - Morain, Olivos - 1990
70 Average-case analysis of algorithms and data structures - Vitter, Flajolet - 1990
47 Discrete logarithms in finite fields and their cryptographic.. - Odlyzko
46 Cambridge University Press (context) - Lidl, Niederreiter et al. - 1987
34 An Interactive Identification Scheme Based on Discrete Logar.. (context) - Brickell, McCurley
24 Addition Chain Heuristics (context) - Bos, Coster - 1990
18 Signed digit representations of minimal hamming weight (context) - Arno, Wheeler - 1993
18 Probabilistic methods in group theory (context) - Erdos, R'enyi - 1965
12 Basic digit sets for radix representation (context) - Matula - 1982
9 Some observations on parallel algorithms for fast exponentia.. (context) - Stinson - 1990
8 Federal Register (context) - Federal, Standard et al. - 1991
8 On Vectorial Addition Chains (context) - Olivos - 1981
5 Fast exponentiation in GF (context) - Agnew, Mullin et al. - 1988
3 Efficient exponentiation in finite fields (context) - Gathen
1 Cipher Algorithms and Computational Complexity (context) - Fuji-Hara - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.securitytechnet.com/crypto/algorithm/implementation.html): More
Speeding up Elliptic Scalar Multiplication with Precomputation - Lim, Hwang (2000) (Correct)
The Third Advanced Encryption Standard Candidate Conference - Nist (2000) (Correct)
Montgomery Multiplication in GF(2^k) - Koc, Acar (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.