-
2
-
-
84968494137
-
Computing in the Jacobian of a hyperelliptic curve
-
D.G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Mathematics of Computation 48 (1987), pp. 95-101.
-
(1987)
Mathematics of Computation
, vol.48
, pp. 95-101
-
-
Cantor, D.G.1
-
4
-
-
0000267548
-
Sequences of numbers generated by addition in formal groups and new primality and factorization tests
-
D.V. Chudnovsky and G.V. Chudnovsky, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Advances in Applied Mathematics 7 (1986), pp. 385-434.
-
(1986)
Advances in Applied Mathematics
, vol.7
, pp. 385-434
-
-
Chudnovsky, D.V.1
Chudnovsky, G.V.2
-
5
-
-
21144448858
-
Montgomery scalar multiplication for genus 2 curves
-
ANTS-VI (D. Buell, ed.) Springer-Verlag
-
S. Duquesne, Montgomery scalar multiplication for genus 2 curves. ANTS-VI (D. Buell, ed.), Lecture Notes in Computer Science 3076, pp. 153-168. Springer-Verlag, 2004.
-
(2004)
Lecture Notes in Computer Science
, vol.3076
, pp. 153-168
-
-
Duquesne, S.1
-
6
-
-
35048820123
-
Construction of secure random curves of genus 2 over prime fields. Advances in cryptology - EUROCRYPT 2004
-
C. Cachin and J. Camenisch, eds. Springer-Verlag
-
P. Gaudry and E. Schost, Construction of Secure Random Curves of Genus 2 over Prime Fields. Advances in Cryptology - EUROCRYPT 2004 (C. Cachin and J. Camenisch, eds.), Lecture Notes in Computer Science 3027, pp. 239-256. Springer-Verlag, 2004.
-
(2004)
Lecture Notes in Computer Science
, vol.3027
, pp. 239-256
-
-
Gaudry, P.1
Schost, E.2
-
8
-
-
35248874869
-
The montgomery powering ladder. CHES 2002
-
B. Kaliski, Ç. Koç, and C. Paar, eds. Springer-Verlag
-
M. Joye and S.-M. Yen, The Montgomery powering ladder. CHES 2002 (B. Kaliski, Ç. Koç, and C. Paar, eds.), Lecture Notes in Computer Science 2523, pp. 291-320. Springer-Verlag, 2003.
-
(2003)
Lecture Notes in Computer Science
, vol.2523
, pp. 291-320
-
-
Joye, M.1
Yen, S.-M.2
-
9
-
-
0013266180
-
Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology
-
Kiran S. Kedlaya, Counting points on hyperelliptic curves using Monsky-Washnitzer cohomol-ogy, J. Ramanujan Math. Soc. 16 (2001), pp. 323-338.
-
(2001)
J. Ramanujan Math. Soc.
, vol.16
, pp. 323-338
-
-
Kiran, S.1
Kedlaya2
-
10
-
-
0003323285
-
Introductory lectures on Siegel modular forms
-
Cambridge University Press
-
H. Klingen, Introductory lectures on Siegel modular forms, Cambridge studies in advanced mathematics 20. Cambridge University Press, 1990.
-
(1990)
Cambridge Studies in Advanced Mathematics
, vol.20
-
-
Klingen, H.1
-
12
-
-
21144436640
-
Montgomery addition for genus two curves
-
ANTS-VI (D. Buell, ed.) Springer-Verlag
-
T. Lange, Montgomery addition for genus two curves. ANTS-VI (D. Buell, ed.), Lecture Notes in Computer Science 3076, pp. 309-317. Springer-Verlag, 2004.
-
(2004)
Lecture Notes in Computer Science
, vol.3076
, pp. 309-317
-
-
Lange, T.1
-
13
-
-
13644249451
-
Formulae for arithmetic on genus 2 hyperelliptic curves
-
DOI 10.1007/s00200-004-0154-8
-
-, Formulae for Arithmetic on Genus 2 Hyperelliptic Curves, Applicable Algebra in Engineering, Communication and Computing 15 (2005), pp. 295-328. (Pubitemid 40226354)
-
(2005)
Applicable Algebra in Engineering, Communications and Computing
, vol.15
, Issue.5
, pp. 295-328
-
-
Lange, T.1
-
14
-
-
0003358349
-
Tata lectures on theta i
-
Birkhäuser
-
D. Mumford, Tata lectures on theta I, Progress in Mathematics 28. Birkhäuser, 1983.
-
(1983)
Progress in Mathematics
, vol.28
-
-
Mumford, D.1
-
15
-
-
0003358349
-
Tata lectures on theta II
-
Birkhäuser
-
-, Tata lectures on theta II, Progress in Mathematics 43. Birkhäuser, 1984.
-
(1984)
Progress in Mathematics
, vol.43
-
-
Mumford, D.1
-
16
-
-
84944875437
-
Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve
-
Cryptographic Hardware and Embedded Systems - CHES 2001
-
O. Okeya and K. Sakurai, Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve. CHES 2001 (Ç. Koç, D. Naccache, and C. Paar, eds.), Lecture Notes in Computer Science 2162, pp. 126-141. Springer-Verlag, 2001. (Pubitemid 33329059)
-
(2001)
Lecture Notes in Computer Science
, Issue.2162
, pp. 126-141
-
-
Okeya, K.1
Sakurai, K.2
-
17
-
-
33747207490
-
A fast Diffie-Hellman protocol in genus 2
-
N. Smart and S. Siksek, A fast Diffie-Hellman protocol in genus 2, Journal of Cryptology 12 (1999), pp. 67-73.
-
(1999)
Journal of Cryptology
, vol.12
, pp. 67-73
-
-
Smart, N.1
Siksek, S.2
-
19
-
-
0037235338
-
Constructing hyperelliptic curves of genus 2 suitable for cryptography
-
A. Weng, Constructing hyperelliptic curves of genus 2 suitable for cryptography, Mathematics of Computation 72 (2003), pp. 435-458. (Pubitemid 36363869)
-
(2003)
Mathematics of Computation
, vol.71
, Issue.241
, pp. 435-458
-
-
Weng, A.1
|