Cryptography Reference
In-Depth Information
[501]
I. E. Shparlinski and A. Winterhof, A nonuniform algorithm for the hidden number problem
in subgroups. In
PKC 2004
(F. Bao, R. H. Deng and J. Zhou, eds.),
LNCS
, vol. 2947, Springer,
2004, pp. 416-424.
[502]
A hidden number problem in small subgroups,
Math. Comp.
74
(252) (2005), 2073-
2080.
[503]
A. Sidorenko, Design and analysis of provably secure pseudorandom generators, Ph.D. thesis,
Eindhoven, 2007.
[504]
C. L. Siegel,
Lectures on the Geometry of Numbers
, Springer, 1989.
[505]
J. H. Silverman,
The Arithmetic of Elliptic Curves
, GTM, vol. 106, Springer, 1986.
[506]
Advanced Topics in the Arithmetic of Elliptic Curves
,
GTM
, vol. 151, Springer, 1994.
[507]
J. H. Silverman and J. Suzuki, Elliptic curve discrete logarithms and the index calculus. In
ASIACRYPT 1998
(K. Ohta and D. Pei, eds.),
LNCS
, vol. 1514, Springer, 1998, pp. 110-125.
[508]
J. H. Silverman and J. Tate,
Rational Points on Elliptic Curves
, Springer, 1994.
[509]
M. Sipser,
Introduction to the Theory of Computation
, Course Technology, 2005.
[510]
M. Skałba, Points on elliptic curves over finite fields,
Acta Arith
.
117
(3) (2005), 293-301.
[511]
N. P. Smart, The discrete logarithm problem on elliptic curves of trace one,
J. Cryptology
12
(3) (1999), 193-196.
[512]
Elliptic curve cryptosystems over small fields of odd characteristic,
J. Crypt.
12
(2)
(1999), 141-151.
[513]
Cryptography: An Introduction
, McGraw-Hill, 2004.
[514]
B. A. Smith, Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic
curves,
J. Crypt.
22
(4) (2009), 505-529.
[515]
P. J. Smith and M. J. J. Lennon, LUC: a new public key system. In
International Conference on
Information Security
(E. Graham Dougall, ed.),
IFIP Transactions
, vol. A-37, North-Holland,
1993, pp. 103-117.
[516]
P. J. Smith and C. Skinner, A public-key cryptosystem and a digital signature system based
on the Lucas function analogue to discrete logarithms. In
ASIACRYPT 1994
(J. Pieprzyk and
R. Safavi-Naini, eds.),
LNCS
, vol. 917, Springer, 1994, pp. 357-364.
[517]
J. A. Solinas, Efficient arithmetic on Koblitz curves,
Des. Codes Crypt.
19
(2000), 195-249.
[518]
Low-weight binary representations for pairs of integers, Technical Report CORR
2001-41, 2001.
M. Stam, On Montgomery-like representations of elliptic curves over GF(2
k
). In
PKC 2003
(Y. G. Desmedt, ed.),
LNCS
, vol. 2567, Springer, 2003, pp. 240-253.
[519]
[520]
Speeding up subgroup cryptosystems, Ph.D. thesis, Eindhoven, 2003.
[521]
M. Stam and A. K. Lenstra, Speeding up XTR. In
ASIACRYPT 2001
(C. Boyd, ed.),
LNCS
,
vol. 2248, Springer, 2001, pp. 125-143.
[522]
H. M. Stark, Class-numbers of complex quadratic fields. In
Modular Functions of One Variable
I
(W. Kuyk, ed.),
LNM
, vol. 320, Springer, 1972, pp. 153-174.
[523]
D. Stehle, Floating point LLL: Theoretical and practical aspects. In
The LLL Algorithm
(P. Q.
Nguyen and B. Vallee, eds.), Springer, 2010, pp. 179-213.
[524]
D. Stehle and P. Zimmermann, A binary recursive GCD algorithm. In
ANTS VI
(D. A. Buell,
ed.),
LNCS
, vol. 3076, Springer, 2004, pp. 411-425.
[525]
P. Stevenhagen, The number field sieve. In
Algorithmic Number Theory
(J. Buhler and
P. Stevenhagen, eds.), MSRI publications, Cambridge University Press, 2008, pp. 83-99.
[526]
I. Stewart,
Galois Theory
, 3rd edn, Chapman & Hall, 2003.
[527]
I. Stewart and D. Tall,
Algebraic Number Theory and Fermat's Last Theorem
, 3rd edn, AK
Peters, 2002.
[528]
H. Stichtenoth, Die Hasse-Witt Invariante eines Kongruenzfunktionenk orpers,
Arch. Math.
33
(1979), 357-360.
