Arithmetic on Abelian and Kummer Varieties

Article English OPEN
Lubicz , David ; Robert , Damien (2016)
  • Publisher: HAL CCSD
  • Related identifiers: doi: 10.1016/j.ffa.2016.01.009
  • Subject: [ INFO.INFO-SC ] Computer Science [cs]/Symbolic Computation [cs.SC]
    arxiv: Mathematics::Number Theory

International audience; A Kummer variety is the quotient of an abelian variety by the automorphism $(-1)$ acting on it. Kummer varieties can be seen as a higher dimensional generalisation of the $x$-coordinate representation of a point of an elliptic curve given by its Weierstrass model. Although there is no group law on the set of points of a Kummer variety, there remains enough arithmetic to enable the computation of exponentiations via a Montgomery ladder based on differential additions. In this paper, we explain that the arithmetic of a Kummer variety is much richer than usually thought. We describe a set of composition laws which exhaust this arithmetic and show that these laws may turn out to be useful in order to improve certain algorithms. We explain how to compute efficiently these laws in the model of Kummer varieties provided by level $2$ theta functions. We also explain how to recover the full group law of the abelian variety with a representation almost as compact and in many cases as efficient as the level $2$ theta functions model of Kummer varieties.
  • References (41)
    41 references, page 1 of 5

    [BBJ+08] D. Bernstein, P. Birkner, M. Joye, T. Lange, and C. Peters. “Twisted edwards curves”. In: Progress in Cryptology-AFRICACRYPT 2008 (2008), pp. 389-405 (cit. on p. 2).

    [Ber06] D. J. Bernstein. “Differential addition chains”. 2006. url: diffchain-20060219.pdf (cit. on pp. 5, 6).

    [BCL+14] D. J. Bernstein, C. Chuengsatiansup, T. Lange, and P. Schwabe. “Kummer strikes back: new DH speed records”. 2014. eprint: 2014/134.pdf (cit. on p. 2).

    [BL04] C. Birkenhake and H. Lange. Complex abelian varieties. Second. Vol. 302. Grundlehren der Mathematischen Wissenschaften [Fundament al Principles of Mathematical Sciences]. Berlin: Springer-Verlag, 2004, pp. xii+635. isbn: 3-540-20488-1 (cit. on pp. 7, 8, 10, 15).

    [BCH+13] J. W. Bos, C. Costello, H. Hisil, and K. Lauter. “Fast cryptography in genus 2”. In: Advances in Cryptology-EUROCRYPT 2013. Springer, 2013, pp. 194-210 (cit. on p. 2).

    [Bro06] D. R. Brown. “Multi-dimensional Montgomery ladders for elliptic curves”. 2006. eprint: 2006/220 (cit. on pp. 6, 16).

    [Can87] D. G. Cantor. “Computing in the Jacobian of a hyperelliptic curve”. In: Math. Comp. 48.177 (1987), pp. 95-101. issn: 0025-5718 (cit. on p. 1).

    [Cos11] R. Cosset. “Application des fonctions thêta à la cryptographie sur courbes hyperelliptiques”. PhD thesis. 2011 (cit. on p. 2).

    [CR13] R. Cosset and D. Robert. “An algorithm for computing (`; `)-isogenies in polynomial time on Jacobians of hyperelliptic curves of genus 2”. Accepted for publication in Mathematics of computation. 2013. url: articles/niveau.pdf. HAL: hal-00578991, eprint: 2011/143 (cit. on pp. 2, 12, 15).

    [Dup06] R. Dupont. “Moyenne arithmetico-geometrique, suites de Borchardt et applications”. In: These de doctorat, Ecole polytechnique, Palaiseau (2006) (cit. on p. 11).

  • Metrics
    No metrics available
Share - Bookmark