Cryptography Reference
In-Depth Information
[324]
J. C. Lagarias, H. W. Lenstra Jr. and C.-P. Schnorr, Korkin-Zolotarev bases and successive
minima of a lattice and its reciprocal lattice,
Combinatorica
10
(4) (1990), 333-348.
[325]
C. Lanczos, Solution of systems of linear equations by minimized iterations,
J. Res. Nat.
Bureau of Standards
49
(1952), 33-53.
[326]
S. Lang,
Introduction to Algebraic Geometry
, Wiley, 1964.
[327]
Algebraic Number Theory
,
GTM
, vol. 110, Springer, 1986.
[328]
Elliptic Functions
, 2nd edn,
GTM
, vol. 112, Springer, 1987.
[329]
Algebra
, 3rd edn, Addison-Wesley, 1993.
[330]
T. Lange, Koblitz curve cryptosystems,
Finite Fields Appl.
11
(2) (2005), 200-229.
[331]
E. Lee, H.-S. Lee and C.-M. Park, Efficient and Generalized Pairing Computation on Abelian
Varieties,
IEEE Trans. Inf. Theory
55
(4) (2009), 1793-1803.
[332]
A. K. Lenstra, Factorization of polynomials. In
Computational Methods in Number Theory
,
(H. W. Lenstra Jr. and R. Tijdeman, eds.)
Mathematical Center Tracts
154, Mathematisch
Centrum Amsterdam, 1984, pp. 169-198.
[333]
Integer factoring,
Des. Codes Crypt.
19
(2/3) (2000), 101-128.
[334]
A. K. Lenstra and H. W. Lenstra Jr.,
The Development of the Number Field Sieve
,
LNM
,
vol. 1554, Springer, 1993.
[335]
A. K. Lenstra, H. W. Lenstra Jr. and L. Lovasz, Factoring polynomials with rational coefficients,
Math. Ann.
261
(1982), 515-534.
[336]
A. K. Lenstra and I. E. Shparlinski, Selective forgery of RSA signatures with fixed-pattern
padding. In
PKC 2002
(D. Naccache and P. Paillier, eds.),
LNCS
, vol. 2274, Springer, 2002,
pp. 228-236.
[337]
A. K. Lenstra and E. R. Verheul, The XTR public key system. In
CRYPTO 2000
(M. Bellare,
ed.),
LNCS
, vol. 1880, Springer, 2000, pp. 1-19.
[338]
Fast irreducibility and subgroup membership testing in XTR. In
PKC 2001
(K. Kim,
ed.),
LNCS
, vol. 1992, Springer, 2001, pp. 73-86.
[339]
H. W. Lenstra Jr., Factoring integers with elliptic curves,
Annals of Mathematics
126
(3) (1987),
649-673.
[340]
Elliptic curves and number theoretic algorithms. In
Proc. International Congr. Math.
,
Berkeley 1986, AMS, 1988, pp. 99-120.
[341]
Finding isomorphisms between finite fields,
Math. Comp.
56
(193) (1991), 329-
347.
[342]
H. W. Lenstra Jr., J. Pila and C. Pomerance, A hyperelliptic smoothness test I,
Phil. Trans. R.
Soc. Lond.
A
345
(1993), 397-408.
[343]
H. W. Lenstra Jr. and C. Pomerance, A rigorous time bound for factoring integers,
J. Amer.
Math. Soc.
5
(3) (1992), no. 3, 483-516.
[344]
R. Lercier, Computing isogenies in
F
2
n
.In
ANTS II
(H. Cohen, ed.),
LNCS
, vol. 1122, Springer,
1996, pp. 197-212.
[345]
R. Lercier and F. Morain, Algorithms for computing isogenies between elliptic curves,
Com-
putational Perspectives on Number Theory
(D. A. Buell and J. T. Teitelbaum, eds.), Studies
in Advanced Mathematics, vol. 7, AMS, 1998, pp. 77-96.
[346]
R. Lercier and T. Sirvent, On Elkies subgroups of
-torsion points in elliptic curves defined
over a finite field,
J. Theor. Nombres Bordeaux
20
(3) (2008), 783-797.
[347]
G. Leurent and P. Q. Nguyen, How risky is the random oracle model?. In
CRYPTO 2009
(S. Halevi, ed.),
LNCS
, vol. 5677, Springer, 2009, pp. 445-464.
[348]
K.-Z. Li and F. Oort, Moduli of supersingular abelian varieties,
LNM
, vol. 1680, Springer,
1998.
[349]
W.-C. Li, M. Naslund and I. E. Shparlinski, Hidden number problem with the trace and bit
security of XTR and LUC. In
CRYPTO 2002
(M. Yung, ed.),
LNCS
, vol. 2442, Springer, 2002,
pp. 433-448.
