Cryptography Reference
In-Depth Information
[179]
A. Enge, Computing modular polynomials in quasi-linear time,
Math. Comp.
78
(267) (2009),
1809-1824.
[180]
A. Enge and P. Gaudry, A general framework for subexponential discrete logarithm algorithms,
Acta Arith
.
102
(2002), 83-103.
[181]
An
L
(1
/
3
+
) algorithm for the discrete logarithm problem for low degree
curves. In
EUROCRYPT 2007
(M. Naor, ed.),
LNCS
, vol. 4515, Springer, 2007, pp. 379-
393.
[182]
A. Enge, P. Gaudry and E. Thome, An
L
(1
/
3) discrete logarithm algorithm for low degree
curves,
J. Crypt
.
24
(1) (2011), 24-41.
[183]
A. Enge and A. Stein, Smooth ideals in hyperelliptic function fields,
Math. Comp.
71
(239)
(2002), 1219-1230.
[184]
S. Erickson, M. J. Jacobson Jr., N. Shang, S. Shen and A. Stein, Explicit formulas for real
hyperelliptic curves of genus 2 in affine representation,
WAIFI 2007
(C. Carlet and B. Sunar,
eds.),
LNCS
, vol. 4547, Springer, 2007, pp. 202-218.
L. De Feo, Fast algorithms for towers of finite fields and isogenies, Ph.D. thesis, L' Ecole
Polytechnique, 2010.
[185]
[186]
R. Fischlin and C.-P. Schnorr, Stronger security proofs for RSA and Rabin bits,
J. Crypt.
13
(2)
(2000), 221-244.
[187]
P. Flajolet and A. M. Odlyzko, Random mapping statistics. In
EUROCRYPT 1989
(J.-J.
Quisquater and J. Vandewalle, eds.),
LNCS
, vol. 434, Springer, 1990, pp. 329-354.
[188]
P. Flajolet and R. Sedgewick,
Analytic Combinatorics
, Cambridge University Press, 2009.
[189]
R. Flassenberg and S. Paulus, Sieving in function fields,
Experiment. Math.
8
(4) (1999),
339-349.
[190]
K. Fong, D. Hankerson, J. Lopez and A. J. Menezes, Field inversion and point halving revisited,
IEEE Trans. Computers
53
(8) (2004), 1047-1059.
[191]
C. Fontaine and F. Galand, A survey of homomorphic encryption for nonspecialists,
EURASIP
Journal on Information Security
2007
(15) (2007), 1-10.
[192]
M. Fouquet and F. Morain, Isogeny volcanoes and the SEA algorithm. In
ANTS V
(C. Fieker
and D. R. Kohel, eds.),
LNCS
, vol. 2369, Springer, 2002, pp. 276-291.
[193]
D. M. Freeman, O. Goldreich, E. Kiltz, A. Rosen and G. Segev, More constructions of lossy
and correlation-secure trapdoor functions. In
PKC 2010
(P. Q. Nguyen and D. Pointcheval,
eds.),
LNCS
, vol. 6065, Springer, 2010, pp. 279-295.
[194]
D. Freeman, M. Scott and E. Teske, A taxonomy of pairing-friendly elliptic curves,
J. Crypt.
23
(2) (2010), 224-280.
[195]
G. Grey, How to disguise an elliptic curve, talk at ECC 1998, Waterloo, 1998.
[196]
G. Frey and H.-G. Ruck, A remark concerning
m
-divisibility and the discrete logarithm
problem in the divisor class group of curves,
Math. Comp.
62
(206) (1994), 865-874.
[197]
M. D. Fried and M. Jarden,
Field Arithmetic
, 3rd edn, Springer, 2008.
[198]
E. Fujisaki, T. Okamoto, D. Pointcheval and J. Stern, RSA-OAEP is secure under the RSA
assumption,
J. Crypt.
17
(2) (2004), 81-104.
[199]
W. Fulton,
Algebraic Curves
, Addison-Wesley, 1989, Out of print, but freely available here:
www.math.lsa.umich.edu/
∼
wfulton/
.
[200]
S. D. Galbraith, Constructing isogenies between elliptic curves over finite fields,
LMS J.
Comput. Math.
2
(1999), 118-138.
[201]
Supersingular curves in cryptography. In
ASIACRYPT 2001
(C. Boyd, ed.),
LNCS
,
vol. 2248, Springer, 2001, pp. 495-513.
[202]
S. D. Galbraith, M. Harrison and D. J. Mireles Morales, Efficient hyperelliptic arithmetic
using balanced representation for divisors. In
ANTS VIII
(A. J. van der Poorten and A. Stein,
eds.),
LNCS
, vol. 5011, Springer, 2008, pp. 342-356.