Cryptography Reference
In-Depth Information
[376]
A.J. Menezes, P.C. van Oorschot and S.A. Vanstone,
Handbook of Applied Cryptography
,
CRC Press, 1996.
[377]
J.-F. Mestre, La methode des graphes. exemples et applications,
Proceedings of the Inter-
national Conference on Class Numbers and Fundamental Units of Algebraic Number fields
(Katata, 1986), Nagoya University
, 1986, pp. 217-242.
[378]
D. Micciancio and S. Goldwasser,
Complexity of Lattice Problems: A Cryptographic Perspec-
tive
, Kluwer, 2002.
[379]
D. Micciancio and O. Regev, Lattice-based cryptography. In
Post Quantum Cryptography
(D. J. Bernstein, J. Buchmann and E. Dahmen, eds.), Springer, 2009, pp. 147-191.
[380]
D. Micciancio and P. Voulgaris, Faster exponential time algorithms for the shortest vector
problem. In
SODA
(M. Charikar, ed.),
SIAM
, 2010, pp. 1468-1480.
[381]
D. Micciancio and B. Warinschi, A linear space algorithm for computing the Hermite normal
form. In
ISSAC
, 2001, pp. 231-236.
[382]
S. D. Miller and R. Venkatesan, Spectral analysis of Pollard rho collisions. In
ANTS VII
(F. Hess, S. Pauli and M. E. Pohst, eds.),
LNCS
, vol. 4076, Springer, 2006, pp. 573-581.
[383]
V. S. Miller, Short programs for functions on curves, Unpublished manuscript, 1986.
[384]
Use of elliptic curves in cryptography. In
CRYPTO 1985
(H. C. Williams, ed.),
LNCS
,
vol. 218, Springer, 1986, pp. 417-426.
[385]
The Weil pairing, and its efficient calculation,
J. Crypt.
17
(4) (2004), 235-261.
[386]
A. Miyaji, T. Ono and H. Cohen, Efficient elliptic curve exponentiation. In
ICICS 1997
(Y. Han,
T. Okamoto and S. Qing, eds.),
LNCS
, vol. 1334, Springer, 1997, pp. 282-291.
[387]
B. Moller, Algorithms for multi-exponentiation. In
SAC 2001
(S. Vaudenay and A. M. Youssef,
eds.),
LNCS
, vol. 2259, Springer, 2001, pp. 165-180.
[388]
Improved techniques for fast exponentiation. In
ICISC 2002
(P.-J. Lee and C.-H. Lim,
eds.),
LNCS
, vol. 2587, Springer, 2003, pp. 298-312.
[389]
Fractional windows revisited: improved signed-digit representations for efficient expo-
nentiation. In
ICISC 2004
(C. Park and S. Chee, eds.),
LNCS
, vol. 3506, Springer, 2005,
pp. 137-153.
[390]
R. Montenegro and P. Tetali, How long does it take to catch a wild kangaroo?. In
Symposium
on Theory of Computing (STOC)
, 2009, pp. 553-559.
[391]
P. L. Montgomery, Modular multiplication without trial division,
Math. Comp.
44
(170) (1985),
519-521.
[392]
Speeding the Pollard and elliptic curve methods of factorization,
Math. Comp.
48
(177)
(1987), 243-264.
[393]
F. Morain and J.-L. Nicolas,
On Cornacchia's Algorithm for Solving the Diophantine Equation
u
2
+
dv
2
=
m
, Preprint, 1990.
[394]
F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-
subtraction chains. In
Theoretical Informatics and Applications
, vol. 24, 1990, pp. 531-
543.
[395]
C. J. Moreno,
Algebraic Curves over Finite Fields
, Cambridge University Press, 1991.
[396]
W. H. Mow, Universal lattice decoding: principle and recent advances,
Wireless Communica-
tions and Mobile Computing
3
(5) (2003), 553-569.
[397]
V. Muller, Fast multiplication on elliptic curves over small fields of characteristic two,
J. Crypt.
11
(4) (1998), 219-234.
[398]
D. Mumford,
Abelian Varieties
, Oxford University Press, 1970.
[399]
Tata lectures on theta II,
Progess in Mathematics
, vol. 43, Birkhauser, 1984.
[400]
M. R. Murty, Ramanujan graphs,
J. Ramanujan Math. Soc.
18
(1) (2003), 1-20.
[401]
R. Murty and I. E. Shparlinski, Group structure of elliptic curves over finite fields and appli-
cations,
Topics in Geometry, Coding Theory and Cryptography
(A. Garcia and H. Stichtenoth,
eds.), Springer-Verlag, 2006, pp. 167-194.
