Cryptography Reference
In-Depth Information
[86]
J. W. Bos, T. Kleinjung and A. K. Lenstra, On the use of the negation map in the Pollard rho
method. In
ANTS IX
(G. Hanrot, F. Morain and E. Thome, eds.),
LNCS
, vol. 6197, Springer,
2010, pp. 66-82.
[87]
W. Bosma and H. W. Lenstra Jr., Complete systems of two addition laws for elliptic curves,
J.
Number Theory
53
(1995), 229-240.
[88]
A. Bostan, F. Morain, B. Salvy and E. Schost, Fast algorithms for computing isogenies between
elliptic curves,
Math. Comp
.
77
(263) (2008), 1755-1778.
[89]
C. Boyd and A. Mathuria, Protocols for authentication and key establishment,
Information
Security and Cryptography
, Springer, 2003.
[90]
X. Boyen, The uber-assumption family. In
Pairing 2008
(S.D.GalbraithandK.G.Paterson,
eds.),
LNCS
, vol. 5209, Springer, 2008, pp. 39-56.
[91]
V. Boyko, M. Peinado and R. Venkatesan, Speeding up discrete log and factoring based
schemes via precomputations. In
EUROCRYPT 1998
(K. Nyberg, ed.),
LNCS
, vol. 1403,
Springer, 1998, pp. 221-235.
[92]
S. Brands, An efficient off-line electronic cash system based on the representation problem,
Tech. report, CWI Amsterdam, 1993, CS-R9323.
[93]
R. P. Brent, An improved Monte Carlo factorization algorithm,
BIT
(1980), 176-184.
[94]
R. P. Brent and J. M. Pollard, Factorization of the eighth Fermat number,
Math. Comp.
36
(154)
(1981), 627-630.
[95]
R. P. Brent and P. Zimmermann,
Modern Computer Arithmetic
, Cambridge University Press,
2010.
[96]
An
O
(
M
(
n
)
logn
) algorithm for the Jacobi symbol. In
ANTS IX
(G. Hanrot, F. Morain
and E. Thome, eds.),
LNCS
, vol. 6197, Springer, 2010, pp. 83-95.
[97]
E. Bresson, Y. Lakhnech, L. Mazare and B. Warinschi, A generalization of DDH with appli-
cations to protocol analysis and computational soundness. In
CRYPTO 2007
(A. J. Menezes,
ed.),
LNCS
, vol. 4622, Springer, 2007, pp. 482-499.
[98]
E. F. Brickell, D. Pointcheval, S. Vaudenay and M. Yung, Design validations for discrete log-
arithm based signature schemes. In
PKC 2000
(H. Imai and Y. Zheng, eds.),
LNCS
, vol. 1751,
Springer, 2000, pp. 276-292.
[99]
E. Brier, C. Clavier and D. Naccache, Cryptanalysis of RSA signatures with fixed-pattern
padding. In
CRYPTO 2001
(J. Kilian, ed.),
LNCS
, vol. 2139, Springer, 2001, pp. 433- 439.
[100]
R. Broker, Constructing supersingular elliptic curves,
J. Comb. Number Theory
1
(3) (2009),
269-273.
[101]
R. Broker, D. X. Charles and K. Lauter, Evaluating large degree isogenies and applications to
pairing based cryptography. In
Pairing 2008
(S.D.GalbraithandK.G.Paterson,eds.),
LNCS
,
vol. 5209, Springer, 2008, pp. 100-112.
R. Broker, K. Lauter and A. V. Sutherland, Modular polynomials via isogeny volcanoes,
http://arxiv.org/abs/1001.0402, 2010, to appear in
Math. Comp.
.
[102]
[103]
R. Broker and A. V. Sutherland, An explicit height bound for the classical modular polynomial,
The Ramanujan Journal
22
(3) (2010), 293-313.
[104]
D. R. L. Brown and R. P. Gallant, The static Diffie-Hellman problem, Cryptology ePrint
Archive, Report 2004/306, 2004.
[105]
B. B. Brumley and K. U. Jarvinen, Koblitz curves and integer equivalents of Frobenius
expansions. In
SAC 2007
(C. M. Adams, A. Miri and M. J. Wiener, eds.),
LNCS
, vol. 4876,
Springer, 2007, pp. 126-137.
[106]
J. P. Buhler and P. Stevenhagen,
Algorithmic Number Theory
, MSRI Publications, Cambridge
University Press, 2008.
[107]
M. Burmester and Y. Desmedt, A secure and efficient conference key distribution system. In
EUROCRYPT 1994
(A.DeSantis,ed.),
LNCS
, vol. 950, Springer, 1995, pp. 267-275.
