Cryptography Reference
In-Depth Information
References
[1]
M. Abdalla, M. Bellare and P. Rogaway,
DHIES: An Encryption Scheme based on the Diffie-
Hellman Problem
, Preprint, 2001.
[2]
L. M. Adleman and J. DeMarrais, A subexponential algorithm for discrete logarithms over all
finite fields,
Math. Comp.
61
(203) (1993), 1-15.
[3]
L. M. Adleman, K. L. Manders and G. L. Miller, On taking roots in finite fields,
Foundations
of Computer Science (FOCS)
,
IEEE
, 1977, 175-178.
[4]
L.M. Adleman, J. De Marrais and M.-D. Huang, A subexponential algorithm for discrete
logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over
finite fields. In
ANTS I
(L. M. Adleman and M.-D. Huang, eds.),
LNCS
, vol. 877, Springer,
1994, pp. 28-40.
[5]
G. B. Agnew, R. C. Mullin, I. M. Onyszchuk and S. A. Vanstone, An implementation for a
fast public-key cryptosystem,
J. Crypt.
3
(2) (1991), 63-79.
[6]
M. Agrawal, N. Kayal and N. Saxena, PRIMES is in P,
Ann. of Math.
160
(2) (2004), 781-
793.
[7]
E. Agrell, T. Eriksson, A. Vardy and K. Zeger, Closest point search in lattices,
IEEE Trans.
Inf. Theory
48
(8) (2002), 2201-2214.
[8]
A. Akavia, Solving hidden number problem with one bit oracle and advice. In
CRYPTO 2009
(S. Halevi, ed.),
LNCS
, vol. 5677, Springer, 2009, pp. 337-354.
[9]
W. Alexi, B. Chor, O. Goldreich and C.-P. Schnorr, RSA and Rabin functions: certain parts
are as hard as the whole,
SIAM J. Comput
.
17
(2) (1988), 194-209.
[10]
W. R. Alford, A. Granville and C. Pomerance, There are infinitely many Carmichael numbers,
Ann. of Math.
139
(3) (1994), 703-722.
[11]
A. Antipa, D. R. L. Brown, R. P. Gallant, R. J. Lambert, R. Struik and S. A. Vanstone,
Accelerated verification of ECDSA signatures. In
SAC 2005
(B. Preneel and S. E. Tavares,
eds.),
LNCS
, vol. 3897, Springer, 2006, pp. 307-318.
[12]
C. Arene, T. Lange, M. Naehrig and C. Ritzenthaler, Faster computation of the Tate pairing,
J. Number Theory
131
(5) (2011), 842-857.
[13]
J. Arney and E. D. Bender, Random mappings with constraints on coalescence and number of
origins,
Pacific J. Math.
103
(1982), 269-294.
[14]
E. Artin,
Galois Theory
, 2nd edn, Notre Dame, 1959.
[15]
M. F. Atiyah and I. G. Macdonald,
Introduction to Commutative Algebra
, Addison-Wesley,
1969.
[16]
R. Avanzi, H. Cohen, C. Doche, G. Frey, T. Lange, K. Nguyen and F. Vercauteren,
Handbook
of Elliptic and Hyperelliptic Cryptography
, Chapman & Hall/CRC, 2006.
[17]
L. Babai, On Lovasz lattice reduction and the nearest lattice point problem,
Combinatorica
6
(1) (1986), 1-13.
