P.L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Math. Comp., vol.48, pp.243-264,1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Montgomery Powering Ladder - Joye, Yen (2003) (8 citations) Self-citation (Montgomery) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243-264, January 1987.
The Montgomery Powering Ladder - Joye, al. (2003) (8 citations) Self-citation (Montgomery) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243--264, January 1987.
The Montgomery Powering Ladder - Joye, Yen (2003) (8 citations) Self-citation (Montgomery) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243-264, January 1987.
Trading Inversions for Multiplications in Elliptic Curve.. - Ciet, Joye, Lauter, al. (2003) (2 citations) Self-citation (Montgomery) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243--264, 1987.
Factorizations of a^n±1, 13 ≤ a < 100: Update 2 - Brent, Montgomery, Riele Self-citation (Montgomery) (Correct)
No context found.
P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Math. Comp. 48 (1987), 243-264.
The Montgomery Powering Ladder - Joye, Yen (2002) (8 citations) Self-citation (Montgomery) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243--264, January 1987.
Efficient Tate Pairing Computation Using Double-Base Chains - Zhao, Zhang, Huang (2006) (Correct)
No context found.
P.L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Math. Comp., vol.48, pp.243-264,1987.
Fast and Secure Elliptic Curve Scalar Multiplication over Prime.. - Meloni (2006) (Correct)
No context found.
P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Math. Com. 48:177 (1987) 143-264.
Blinded Fault Resistant Exponentiation - Guillaume Fumaroli And (2006) (Correct)
No context found.
Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation 48(177) (January 1987) 243264
Weierstraß Elliptic Curves and Side-Channel Attacks - Brier, Joye (2002) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243--264, January 1987.
Weierstraß Elliptic Curves and Side-Channel Attacks - Brier, Joye (2002) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243--264, January 1987.
Efficient Comb Elliptic Curve Multiplication Methods.. - Feng, Zhu, Xu, Li (2005) (Correct)
No context found.
P. L. Montgomery, "Speeding the Pollard and Elliptic Curve Methods of Factorization," Mathematics of Computation, vol. 48, pp. 243--264, 1987.
On the Security of Brier-Joye's Addition Formula for.. - Izu, Takagi (2002) (Correct)
No context found.
P. Montgomery, "Speeding the Pollard and Elliptic Curve Methods for Factorizations ", Math. of Comp, vol.48, pp.243-264, 1987.
Securing Elliptic Curve Point Multiplication against Side-Channel .. - Möller (2001) (2 citations) (Correct)
No context found.
Montgomery, P. L. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation 48 (1987), 243--264.
Improved Elliptic Curve Multiplication Methods Resistant.. - Izu, Möller, Takagi (2003) (2 citations) (Correct)
No context found.
P. Montgomery, "Speeding the Pollard and elliptic curve methods for factorizations ", Math. Comp., vol. 48, pp. 243--264, 1987.
Sign Change Fault Attacks on Elliptic Curve Cryptosystems - Blömer, Otto, Seifert (2004) (Correct)
No context found.
P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of Computation 48 (1987), no. 177, 243--264.
Weierstraß Elliptic Curves and Side-Channel Attacks - Brier, Joye (2002) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243--264, January 1987.
Elliptic Curves and Side-Channel Analysis - Joye (2003) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243-264, January 1987.
Factorization of the Tenth and Eleventh Fermat Numbers - Brent (1996) (2 citations) (Correct)
No context found.
P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Math. Comp. 48 (1987), 243--264.
Factorizations of a - Richard Brent Computer (Correct)
No context found.
P. L. Montgomery, "Speeding the Pollard and elliptic curve methods of factorization ", Mathematics of Computation 48 (1987), 243-264.
Elliptic Curves and Side-Channel Analysis - Joye (2003) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243-264, January 1987.
Factorizations of a^n ± 1, 13 ≤ a < 100 - Brent, Riele (1992) (Correct)
No context found.
P. L. Montgomery, "Speeding the Pollard and elliptic curve methods of factorization ", Mathematics of Computation 48 (1987), 243-264.
A reduction of the space for the parallelized Pollard lambda.. - Semaev (2003) (1 citation) (Correct)
No context found.
P.Montgomery, Speeding the Pollard and elliptic curve methods of factorization. Math. Comp. 48 (1987), no. 177, 243--264.
An example of elliptic curve over Q with rank equal to 15 - Dujella (2002) (Correct)
No context found.
P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Math. Comp. 48, 243--264 (1987).
Elliptic Curves and Side-Channel Analysis - Joye (2003) (Correct)
No context found.
Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243--264, January 1987.
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