Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
暂无分享,去创建一个
[1] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..
[2] J. Rafael Sendra,et al. Rational Algebraic Curves: A Computer Algebra Approach , 2007 .
[3] Gabriel Cardona,et al. Curves of genus 2 with group of automorphisms isomorphic to $D_8$ or $D_{12}$ , 2002 .
[4] Marc Joye,et al. Efficient Arithmetic on Hessian Curves , 2010, Public Key Cryptography.
[5] Thomas Icart,et al. How to Hash into Elliptic Curves , 2009, IACR Cryptol. ePrint Arch..
[6] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[7] A. Atkin,et al. ELLIPTIC CURVES AND PRIMALITY PROVING , 1993 .
[8] Christiaan E. van de Woestijne,et al. Construction of Rational Points on Elliptic Curves over Finite Fields , 2006, ANTS.
[9] M. Ulas. Rational points on certain hyperelliptic curves over finite fields , 2007, 0706.1448.
[10] Mehdi Tibouchi,et al. Deterministic Encoding and Hashing to Odd Hyperelliptic Curves , 2010, Pairing.
[11] Jean-Sébastien Coron,et al. Efficient Indifferentiable Hashing into Ordinary Elliptic Curves , 2010, CRYPTO.
[12] R. L. Borger. On DeMoivre's Quintic , 1908 .