Result 1 to 20 of 54 total
Elliptic curves for primality proving (English)
Encyclopedia of Cryptography and Security (2nd Ed.), 411-412 (2011).
1
Algorithmic number theory. 9th international symposium, ANTS-IX, Nancy, France, July 19‒23, 2010. Proceedings. (English)
Lecture Notes in Computer Science 6197. Berlin: Springer (ISBN 978-3-642-14517-9/pbk). xi, 397~p. EUR~66.34 (2010).
2
Fast algorithms for computing isogenies between elliptic curves. (English)
Math. Comput. 77, No. 263, 1755-1778 (2008).
3
Fast algorithms for computing isogenies between elliptic curves (English)
Math. Comput. 77, No. 263, 1755-1778 (2008).
4
Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using abelian lifts. (English)
Brown, C. W. (ed.), ISSAC 2007. Proceedings of the 32nd international symposium on symbolic and algebraic computation (ISSAC 2007), Waterloo, ON, Canada, July 29‒August 1, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-743-8). 285-292 (2007).
5
Computing the cardinality of CM elliptic curves using torsion points. (English)
J. Théor. Nombres Bordx. 19, No. 3, 663-681 (2007).
6
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm. (English)
Math. Comput. 76, No. 257, 493-505 (2007).
7
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (English)
Math. Comput. 76, No. 257, 493-505 (2007).
8
Computing the eigenvalue in the schoof-elkies-atkin algorithm using Abelian lifts (English)
ISSAC, 285-292 (2007).
9
Fast algorithms for computing isogenies between elliptic curves. (English)
Comput. Res. Repos. 2006, Article No. 0609020 (2006).
10
Fast algorithms for computing the eigenvalue in the schoof-elkies-atkin algorithm (English)
ISSAC, 109-115 (2006).
11
Building curves with arbitrary small MOV degree over finite prime fields. (English)
J. Cryptology 18, No. 2, 79-89 (2005).
12
Elliptic curves for primality proving (English)
Encyclopedia of Cryptography and Security (2005).
13
Proving the primality of very large numbers with fastECPP. (English)
Buell, Duncan (ed.), Algorithmic number theory. 6th international symposium, ANTS-VI, Burlington, VT, USA, June 13‒18, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22156-5/pbk). Lecture Notes in Computer Science 3076, 194-207 (2004).
14
Primality in polynomial time (following Adleman, Huang; Agrawal, Kayal, Saxena). (La primalité en temps polynomial (d’après Adleman, Huang; Agrawal, Kayal, Saxena).) (French)
Bourbaki seminar. Volume 2002/2003. Exposes 909‒923. Paris: Société Mathématique de France (ISBN 2-85629-156-2/pbk). Astérisque 294, 205-230, Exp. No. 917 (2004).
15
Proving the primality of very large numbers with fastecpp (English)
ANTS, 194-207 (2004).
16
Fast decomposition of polynomials with known Galois group. (English)
Fossorier, Marc (ed.) et al., Applied algebra, algebraic algorithms and error-correcting codes. 15th international symposium, AAECC-15, Toulouse, France, May 12-16, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2643, 254-264 (2003).
17
Fast decomposition of polynomials with known Galois group (English)
AAECC, 254-264 (2003).
18
Isogeny volcanoes and the SEA algorithm. (English)
Fieker, Claus (ed.) et al., Algorithmic number theory. 5th international symposium, ANTS-V, Sydney, Australia, July 7‒12, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43863-7). Lect. Notes Comput. Sci. 2369, 276-291 (2002).
19
Comparing invariants for class fields of imaginary quadratic fields. (English)
Fieker, Claus (ed.) et al., Algorithmic number theory. 5th international symposium, ANTS-V, Sydney, Australia, July 7‒12, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43863-7). Lect. Notes Comput. Sci. 2369, 252-266 (2002).
20
Result 1 to 20 of 54 total
Start
Contact
Print
General Help
