Supersingular prime

Results: 16



#Item
1CM proofs for elliptic curves over number elds Stephen Enright•Ward Für meine Lieblingsdeutschlehrerin.

CM proofs for elliptic curves over number elds Stephen Enright•Ward Für meine Lieblingsdeutschlehrerin.

Add to Reading List

Source URL: iml.univ-mrs.fr

Language: English - Date: 2014-09-16 07:05:16
2On the supersingular reduction of elliptic curves

On the supersingular reduction of elliptic curves

Add to Reading List

Source URL: www.mast.queensu.ca

Language: English - Date: 2016-03-21 18:26:40
3Designs, Codes and Cryptography, 19, 195–c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. °  Efficient Arithmetic on Koblitz Curves*

Designs, Codes and Cryptography, 19, 195–c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. ° Efficient Arithmetic on Koblitz Curves*

Add to Reading List

Source URL: computacion.cs.cinvestav.mx

Language: English - Date: 2011-05-17 18:20:42
4FINDING COMPOSITE ORDER ORDINARY ELLIPTIC CURVES USING THE COCKS-PINCH METHOD D. BONEH, K. RUBIN, AND A. SILVERBERG Abstract. We apply the Cocks-Pinch method to obtain pairing-friendly composite order groups with prescri

FINDING COMPOSITE ORDER ORDINARY ELLIPTIC CURVES USING THE COCKS-PINCH METHOD D. BONEH, K. RUBIN, AND A. SILVERBERG Abstract. We apply the Cocks-Pinch method to obtain pairing-friendly composite order groups with prescri

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-05-03 13:25:59
5Efficient Indifferentiable Hashing into Ordinary Elliptic Curves⋆ Eric Brier1 , Jean-S´ebastien Coron2 , Thomas Icart2⋆⋆ , David Madore3 , Hugues Randriam3 , and Mehdi Tibouchi2,4⋆ ⋆ ⋆ 1  Ingenico

Efficient Indifferentiable Hashing into Ordinary Elliptic Curves⋆ Eric Brier1 , Jean-S´ebastien Coron2 , Thomas Icart2⋆⋆ , David Madore3 , Hugues Randriam3 , and Mehdi Tibouchi2,4⋆ ⋆ ⋆ 1 Ingenico

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-06-03 09:18:30
6Constructing cryptographic curves with complex multiplication Reinier Br¨ oker Ξ

Constructing cryptographic curves with complex multiplication Reinier Br¨ oker Ξ

Add to Reading List

Source URL: www.fields.utoronto.ca

Language: English - Date: 2009-05-14 13:40:44
7How explicit is the Explicit Formula? Barry Mazur and William Stein March 21, 2013 (Notes for our 20+20 minute talk at the AMS Special Session on Arithmetic Statistics in San Diego, January 2013)

How explicit is the Explicit Formula? Barry Mazur and William Stein March 21, 2013 (Notes for our 20+20 minute talk at the AMS Special Session on Arithmetic Statistics in San Diego, January 2013)

Add to Reading List

Source URL: abel.math.harvard.edu

Language: English - Date: 2013-03-21 16:40:51
8ALGANT Erasmus Mundus Joint Doctorate programme[removed]Research project DR

ALGANT Erasmus Mundus Joint Doctorate programme[removed]Research project DR

Add to Reading List

Source URL: www.algant.eu

Language: English - Date: 2013-11-13 10:29:52
9

PDF Document

Add to Reading List

Source URL: algant.eu

Language: English - Date: 2013-11-13 10:29:52
10University of Bordeaux 1 algant master thesis Galois Representations Attached to Elliptic Curves

University of Bordeaux 1 algant master thesis Galois Representations Attached to Elliptic Curves

Add to Reading List

Source URL: www.algant.eu

Language: English - Date: 2012-07-12 18:58:52