Francois Morain and Jorge Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications, 24:531--543, 1990. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Weierstraß Elliptic Curves and Side-Channel Attacks - Brier, Joye (2002) (Correct)
No context found.
Francois Morain and Jorge Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications, 24:531--543, 1990.
Compact Encoding of Non-Adjacent Forms with Applications to.. - Joye, al. (2001) (2 citations) (Correct)
No context found.
F. Morain and J. Olivos, "Speeding up the computations on an elliptic curve using addition-subtraction chains," Theoretical Informatics and Applications, vol. 24, pp. 531--543, 1990.
Resistance against Differential Power Analysis for Elliptic Curve.. - Coron (1999) (9 citations) (Correct)
No context found.
F. Morain, J. Olivos. Speeding up the computation of an elliptic curve using addition-subtraction chains, Inform. Theory Appl. 24 (1990), 531-543.
Compact Encoding of Non-Adjacent Forms with Applications to.. - Joye, al. (2001) (2 citations) (Correct)
No context found.
F. Morain and J. Olivos, "Speeding up the computations on an elliptic curve using addition-subtraction chains," Theoretical Informatics and Applications, vol. 24, pp. 531--543, 1990.
An Analysis of Double Base Number Systems - And Sublinear Scalar (Correct)
No context found.
F. Morain and J. Olivos. Speeding up the Computations on an Elliptic Curve using Addition-Subtraction Chains. Inform. Theor. Appl., 24:531--543, 1990.
Resistance against Differential Power Analysis for Elliptic Curve.. - Coron (1999) (9 citations) (Correct)
No context found.
F. Morain, J. Olivos. Speeding up the computation of an elliptic curve using addition-subtraction chains, Inform. Theory Appl. 24 (1990), 531-543.
Optimal Left-to-right Binary Signed-Digit Recoding - Joye, Yen (2000) (7 citations) (Correct)
No context found.
F. Morain and J. Olivos, "Speeding up the computations on an elliptic curve using addition-subtraction chains," Theoretical Informatics and Applications, vol. 24, pp. 531--543, 1990.
New Minimal Modified Radix-r Representation with Applications to .. - Joye, al. (2002) (2 citations) (Correct)
No context found.
F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, Theoretical Informatics and Applications 24 (1990), 531--543.
An Analysis of Double Base Number Systems - And Sublinear Scalar (Correct)
No context found.
F. Morain and J. Olivos. Speeding up the Computations on an Elliptic Curve using Addition-Subtraction Chains. Inform. Theor. Appl., 24:531--543, 1990.
Recovering Lost Efficiency of Exponentiation Algorithms on Smart.. - Joye (2002) (2 citations) (Correct)
No context found.
Francois Morain and Jorge Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications 24:531-543, 1990.
Optimal Left-to-right Binary Signed-Digit Recoding - Joye, Yen (2000) (7 citations) (Correct)
No context found.
F. Morain and J. Olivos, "Speeding up the computations on an elliptic curve using addition-subtraction chains," Theoretical Informatics and Applications, vol. 24, pp. 531--543, 1990.
Weierstraß Elliptic Curves and Side-Channel Attacks - Brier, Joye (2002) (Correct)
No context found.
Francois Morain and Jorge Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications, 24:531--543, 1990.
New Minimal Modified Radix-r Representation with Applications to .. - Joye, Yen (2002) (2 citations) (Correct)
No context found.
F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, Theoretical Informatics and Applications 24 (1990), 531--543.
Stern Polynomials - Klavzar, Milutinovic, Petr (Correct)
No context found.
F. Morain, J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, RAIRO Inform. Theor. Appl. 24 (1990) 531--543. 10
Recovering Lost Efficiency of Exponentiation Algorithms on Smart.. - Joye (2002) (2 citations) (Correct)
No context found.
Francois Morain and Jorge Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications 24:531--543, 1990.
Stern Polynomials - Klavzar, Milutinovic, Petr (Correct)
No context found.
F. Morain, J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, RAIRO Inform. Theor. Appl. 24 (1990) 531--543. 10
Analysis of Some Efficient Window Methods and their.. - Schmidt-Samoa, Semay, .. (2004) (Correct)
No context found.
F. Morain and J. Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO Theoretical Informatics and Applications, 24:531-543, 1990.
Signed Binary Representations Revisited - Okeya, Schmidt-Samoa, Spahn.. (2004) (Correct)
No context found.
Morain, F., Olivos, J., Speeding Up the Computations on an Elliptic Curve using Addition-Subtraction Chains, RAIRO Theoretical Informatics and Applications , 24, (1990), pp.531-543.
Sign Change Fault Attacks on Elliptic Curve Cryptosystems - Blömer, Otto, Seifert (2004) (Correct)
No context found.
F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-subtractions chains, Theoretical Informatics and Applications (1990), no. 24, 531--543.
Optimal Left-to-right Binary Signed-Digit Recoding - Joye, Yen (2000) (7 citations) (Correct)
No context found.
F. Morain and J. Olivos, "Speeding up the computations on an elliptic curve using addition-subtraction chains," Theoretical Informatics and Applications, vol. 24, pp. 531--543, 1990.
New Minimal Modified Radix-r Representation with Applications to .. - Joye, Yen (2002) (2 citations) (Correct)
No context found.
F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, Theoretical Informatics and Applications 24 (1990), 531--543.
Recovering Lost Efficiency of Exponentiation Algorithms on Smart.. - Joye (2002) (2 citations) (Correct)
No context found.
Francois Morain and Jorge Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications 24:531-543, 1990.
Weierstraß Elliptic Curves and Side-Channel Attacks - Brier, Joye (2002) (Correct)
No context found.
Francois Morain and Jorge Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications, 24:531--543, 1990.
Fast Algorithms for Elliptic Curve Cryptosystems over Binary.. - Han, al. (1999) (Correct)
No context found.
Francois Morain et J. Olivos, "Speeding up the Computation on an Elliptic Curve using Addition-Subtraction Chains", RAIRO Informatique Theorique Et Applications - Theoretical Informatics and Applications, 24,6, p. 531-543, 1990.
Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves - Coron, al. (2001) (Correct)
No context found.
F. Morain and J. Olivos. Speeding up the computation of an elliptic curve using addition-subtraction chains. Inform. Theory Appl., 24:531--543, 1990.
First 50 documents Next 50
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