×

The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines. (English) Zbl 1220.14023

Summary: The purpose of this paper is a description of a model of Kummer surfaces in characteristic 2, together with the associated formulas for the pseudo-group law. Since the classical model has bad reduction, a renormalization of the parameters is required, that can be justified using the theory of algebraic theta functions. The formulas that are obtained are very efficient and may be useful in cryptographic applications. We also show that applying the same strategy to elliptic curves gives Montgomery-like formulas in odd characteristic that are faster than the classical ones, and we recover already known formulas by Stam in characteristic 2.

MSC:

14J28 \(K3\) surfaces and Enriques surfaces

Software:

Curve25519; mpFq
Full Text: DOI

References:

[1] Bernstein, D., Curve25519: New Diffie-Hellman speed records, (Yung, M.; Dodis, Y.; Kiayias, A.; Malkin, T., PKC 2006. PKC 2006, Lecture Notes in Comput. Sci., vol. 3958 (2006), Springer-Verlag), 207-228 · Zbl 1151.94480
[2] Birkenhake, C.; Lange, H., Complex Abelian Varieties, Grundlehren Math. Wiss., vol. 302 (2004), Springer-Verlag: Springer-Verlag Berlin · Zbl 1056.14063
[3] Bernstein, D.; Lange, T., Faster addition and doubling on elliptic curves, (Kurosawa, K., ASIACRYPT 2007. ASIACRYPT 2007, Lecture Notes in Comput. Sci., vol. 4833 (2007), Springer-Verlag), 29-50 · Zbl 1153.11342
[4] Carls, R., Theta null points of 2-adic canonical lifts (2005), a preprint is available at
[5] Carls, R., Canonical coordinates on the canonical lift, J. Ramanujan Math. Soc., 22, 1, 1-14 (2007) · Zbl 1138.14031
[6] Chudnovsky, D. V.; Chudnovsky, G. V., Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Adv. in Appl. Math., 7, 385-434 (1986) · Zbl 0614.10004
[7] (Cohen, H.; Frey, G., Handbook of Elliptic and Hyperelliptic Curve Cryptography (2005), Chapman & Hall/CRC) · Zbl 1082.94001
[8] Gaudry, P., Fast genus 2 arithmetic based on Theta functions, J. Math. Cryptol., 1, 243-265 (2007) · Zbl 1145.11048
[9] Gaudry, P.; Thomé, E., The mpFq library and implementing curve-based key exchanges, (SPEED: Software Performance Enhancement for Encryption and Decryption (2007)), 49-64
[10] Igusa, Jun-ichi, Theta functions, Grundlehren Math. Wiss., Band 194 (1972), Springer-Verlag: Springer-Verlag New York · Zbl 0251.14016
[11] Laszlo, Y.; Pauly, C., The action of the Frobenius maps on rank 2 vector bundles in characteristic 2, J. Algebraic Geom., 11, 2, 219-243 (2002) · Zbl 1080.14527
[12] Laszlo, Y.; Pauly, C., The Frobenius map, rank 2 vector bundles and Kummer’s quartic surface in characteristic 2 and 3, Adv. Math., 185, 2, 246-269 (2004) · Zbl 1055.14038
[13] Moret-Bailly, L., Pinceaux de variétés abéliennes, Astérisque, 129, 266 (1985) · Zbl 0595.14032
[14] Mumford, D., On the equations defining abelian varieties. I, Invent. Math., 1, 287-354 (1966) · Zbl 0219.14024
[15] Mumford, D., On the equations defining abelian varieties. II, Invent. Math., 3, 75-135 (1967)
[16] Mumford, D., Abelian Varieties, Tata Inst. Fund. Res. Stud. Math., vol. 5 (1970), Tata Institute of Fundamental Research: Tata Institute of Fundamental Research Bombay · Zbl 0198.25801
[17] Mumford, D., Tata Lectures on Theta I, Progr. Math., vol. 28 (1983), Birkhäuser Boston Inc.: Birkhäuser Boston Inc. Boston, MA, with the assistance of C. Musili, M. Nori, E. Previato and M. Stillman · Zbl 0509.14049
[18] Stam, M., On Montgomery-like representations for elliptic curves over \(G F(2^k)\), (Desmedt, Y., PKC 2003. PKC 2003, Lecture Notes in Comput. Sci., vol. 2567 (2003), Springer-Verlag), 240-254 · Zbl 1033.94541
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.