Tate Pairing Computation on Jacobi's Elliptic Curves
暂无分享,去创建一个
[1] Steven D. Galbraith,et al. Ordinary abelian varieties having small embedding degree , 2007, Finite Fields Their Appl..
[2] Gerhard Frey,et al. Background on Pairings , 2005, Handbook of Elliptic and Hyperelliptic Curve Cryptography.
[3] Marc Joye,et al. The Jacobi Model of an Elliptic Curve and Side-Channel Analysis , 2003, AAECC.
[4] Steven D. Galbraith,et al. Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings , 2008, Pairing.
[5] Samir Siksek,et al. Explicit 4-descents on an elliptic curve , 1996 .
[6] Tanja Lange,et al. Faster Computation of the Tate Pairing , 2009, IACR Cryptol. ePrint Arch..
[7] Hovav Shacham,et al. Pairing-Based Cryptography - Pairing 2009, Third International Conference, Palo Alto, CA, USA, August 12-14, 2009, Proceedings , 2009, Pairing.
[8] Information Security and Privacy , 1996, Lecture Notes in Computer Science.
[9] Tanja Lange,et al. Faster Pairing Computations on Curves with High-Degree Twists , 2010, Public Key Cryptography.
[10] Jeffrey Shallit,et al. Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.
[11] Colin Boyd,et al. Cryptography and Coding , 1995, Lecture Notes in Computer Science.
[12] Alfred Menezes,et al. Reducing elliptic curve logarithms to logarithms in a finite field , 1993, IEEE Trans. Inf. Theory.
[13] Palash Sarkar,et al. Pairing Computation on Twisted Edwards Form Elliptic Curves , 2008, Pairing.
[14] Vincent Rijmen,et al. Progress in Cryptology - INDOCRYPT 2008, 9th International Conference on Cryptology in India, Kharagpur, India, December 14-17, 2008. Proceedings , 2008, INDOCRYPT.
[15] Ed Dawson,et al. Jacobi Quartic Curves Revisited , 2009, ACISP.
[16] Aggelos Kiayias,et al. Multi-query Computationally-Private Information Retrieval with Constant Communication Rate , 2010, Public Key Cryptography.
[17] Shu Lin,et al. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes , 1999, Lecture Notes in Computer Science.
[18] Antoine Joux. A One Round Protocol for Tripartite Diffie-Hellman , 2000, ANTS.
[19] Ratna Dutta,et al. Pairing-Based Cryptographic Protocols : A Survey , 2004, IACR Cryptol. ePrint Arch..
[20] Victor S. Miller,et al. The Weil Pairing, and Its Efficient Calculation , 2004, Journal of Cryptology.
[21] Michael Scott,et al. A Taxonomy of Pairing-Friendly Elliptic Curves , 2010, Journal of Cryptology.
[22] Ed Dawson,et al. Faster Group Operations on Elliptic Curves , 2009, AISC.
[23] Alfred Menezes,et al. Pairing-Based Cryptography at High Security Levels , 2005, IMACC.
[24] Bao Li,et al. Pairing Computation on Elliptic Curves of Jacobi Quartic Form , 2010, IACR Cryptol. ePrint Arch..
[25] Gerhard Frey,et al. The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems , 1999, IEEE Trans. Inf. Theory.
[26] Antoine Joux,et al. Another Approach to Pairing Computation in Edwards Coordinates , 2008, INDOCRYPT.
[27] Hongfeng Wu,et al. Twisted Jacobi Intersections Curves , 2010, TAMC.
[28] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[29] S. Galbraith,et al. Advances in Elliptic Curve Cryptography: Pairings , 2005 .
[30] Colin Boyd,et al. Faster Pairings on Special Weierstrass Curves , 2009, Pairing.
[31] D. Chudnovsky,et al. Sequences of numbers generated by addition in formal groups and new primality and factorization tests , 1986 .