Cryptography Reference
In-Depth Information
[557]
E. R. Verheul and H. C. A. van Tilborg, Cryptanalysis of 'less short' RSA secret exponents,
Applicable Algebra in Engineering
,
Communication and Computing
8
(5) (1997), 425-435.
[558]
M.-F. Vigneras, Arithmetique des algebres de quaternions,
LNM
, vol. 800, Springer, 1980.
[559]
J. F. Voloch, A note on elliptic curves over finite fields,
Bulletin de la Societ´eMathematique
de France
116
(4) (1988), 455-458.
[560]
L. C. Washington,
Elliptic Curves: Number Theory and Cryptography
, 2nd edn, CRC Press,
2008.
E. Waterhouse, Abelian varieties over finite fields,
Ann. Sci. Ecole Norm. Sup.
2
(1969),
521-560.
[561]
[562]
D. H. Wiedemann, Solving sparse linear equations over finite fields,
IEEE Trans. Inf. Theory
32
(1986), 54-62.
[563]
M. J. Wiener,
Bounds on Birthday Attack Times
, Cryptology ePrint Archive, Report 2005/318.
[564]
Cryptanalysis of short RSA secret exponents,
IEEE Trans. Inf. Theory
36
(3) (1990),
553-558.
[565]
M. J. Wiener and R. J. Zuccherato, Faster attacks on elliptic curve cryptosystems. In
SAC 1998
(S. E. Tavares and H. Meijer, eds.),
LNCS
, vol. 1556, Springer, 1998, pp. 190-200.
[566]
H. C. Williams, A modification of the RSA public key encryption procedure,
IEEE Trans. Inf.
Theory
26
(6) (1980), 726-729.
[567]
A
p
+
1 method of factoring,
Math. Comp.
39
(159) (1982), 225-234.
[568]
D. J. Winter,
The Structure of Fields
,
GTM
16, Springer, 1974.
[569]
M. Woodroofe,
Probability with Applications
, McGraw-Hill, 1975.
[570]
S.-M. Yen and C.-S. Laih, Improved digital signature suitable for batch verification,
IEEE
Trans. Computers
44
(7) (1995), 957-959.
[571]
S.-M. Yen, C.-S. Laih, and A. K. Lenstra, Multi-exponentiation,
IEEE Proceedings Computers
and Digital Techniques
141
(6) (1994), 325-326.
[572]
N. Yui, On the jacobian varieties of hyperelliptic curves over fields of characteristic
p>
2,
J.
Algebra
52
(1978), 378-410.
[573]
O. Zariski and P. Samuel,
Commutative Algebra (Vol. I and II)
, Van Nostrand, Princeton
University Press, 1960.
N. Zierler, A conversion algorithm for logarithms on
GF
(2
n
),
J. Pure Appl. Algebra
4
(1974),
353-356.
[574]
[575]
P. Zimmermann, Private communication, 10 March 2009.
