Cryptography Reference
In-Depth Information
[18]
L. Babai and E. Szemeredi, On the complexity of matrix group problems
I
,
Foundations of
Computer Science (FOCS)
(1996), 229-240.
[19]
E. Bach, Bounds for primality testing and related problems,
Math. Comp.
55
(191) (1990),
355-380.
[20]
Toward a theory of Pollard's rho method,
Inf. Comput
.
90
(2) (1991), 139-155.
[21]
E. Bach and J. Shallit,
Algorithmic Number Theory
, MIT Press, 1996.
[22]
E. Bach and J. Sorenson, Sieve algorithms for perfect power testing,
Algorithmica
9
(1993),
313-328.
[23]
S. Bai and R. P. Brent, On the efficiency of Pollard's rho method for discrete logarithms,
CATS 2008
(J. Harland and P. Manyem, eds.), Australian Computer Society, 2008, pp. 125-
131.
[24]
D. V. Bailey, L. Batina, D. J. Bernstein, P. Birkner, J. W. Bos, H.-C. Chen, C.-M. Cheng, G. van
Damme, G. de Meulenaer, L. Julian Dominguez Perez, J. Fan, T. G uneysu, F. Gurkaynak,
T. Kleinjung, T. Lange, N. Mentens, R. Niederhagen, C. Paar, F. Regazzoni, P. Schwabe,
L. Uhsadel, A. Van Herrewege and B.-Y. Yang,
Breaking ECC2K-130
, Cryptology ePrint
Archive, Report 2009/541, 2009.
[25]
R. Balasubramanian and N. Koblitz, The improbability that an elliptic curve has sub-
exponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm,
J. Crypt.
11
(2) (1998), 141-145.
P. S. L. M. Barreto, S. D. Galbraith, C.
´
OhEigeartaigh and M. Scott, Efficient pairing
computation on supersingular abelian varieties,
Des. Codes Crypt.
42
(3) (2007), 239-271.
[26]
[27]
P. S. L. M. Barreto, H. Y. Kim, B. Lynn and M. Scott, Efficient algorithms for pairing-based
cryptosystems,
CRYPTO 2002
(M. Yung, ed.),
LNCS
, vol. 2442, Springer, 2002, pp. 354-369.
[28]
P. S. L. M. Barreto and M. Naehrig, Pairing-friendly elliptic curves of prime order,
SAC 2005
(B. Preneel and S. E. Tavares, eds.),
LNCS
, vol. 3897, Springer, 2006, pp. 319-331.
[29]
A. Bauer, Vers une generalisation rigoureuse des methodes de Coppersmith pour la recherche
de petites racines de polynmes, Ph.D. thesis, Universite de Versailles Saint-Quentin-en-
Yvelines, 2008.
[30]
M. Bellare, R. Canetti and H. Krawczyk, A modular approach to the design and analysis of
authentication and key exchange protocols,
Symposium on the Theory of Computing (STOC)
,
ACM, 1998, pp. 419-428.
[31]
M. Bellare, J. A. Garay and T. Rabin, Fast batch verification for modular exponentiation and
digital signatures,
EUROCRYPT 1998
(K. Nyberg, ed.),
LNCS
, vol. 1403, Springer, 1998,
pp. 236-250.
[32]
M. Bellare, S. Goldwasser and D. Micciancio, “Pseudo-Random” number generation within
cryptographic algorithms: the DSS case,
CRYPTO 1997
(B. S. Kaliski Jr., ed.),
LNCS
,
vol. 1294, Springer, 1997, pp. 277-291.
[33]
M. Bellare and G. Neven, Multi-signatures in the plain public-key model and a general forking
lemma,
CCS 2006
(A. Juels, R. N. Wright and S. De Capitani di Vimercati, eds.), ACM, 2006,
pp. 390-399.
[34]
M. Bellare, D. Pointcheval and P. Rogaway, Authenticated key exchange secure against dictio-
nary attacks,
EUROCRYPT
2000 (B. Preneel, ed.),
LNCS
, vol. 1807, Springer, 2000, pp. 139-
155.
[35]
M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient
protocols,
CCS 1993
, ACM, 1993, pp. 62-73.
[36]
Entity authentication and key distribution,
CRYPTO 1993
(D. R. Stinson, ed.),
LNCS
,
vol. 773, Springer, 1994, pp. 232-249.
[37]
Optimal asymmetric encryption - how to encrypt with RSA,
EUROCRYPT 1994
(A.DeSantis,ed.),
LNCS
, vol. 950, Springer, 1995, pp. 92-111.
