References

1. Henk Barendregt & Erik Barendsen (2002): Autarchic Computations in Formal Proofs. Journal of Automated Reasoning 28, pp. 321–336, doi:10.1023/A:1015761529444.
2. Daniel J. Bernstein (2006): Curve25519: New Diffie-Hellman Speed Records. In: 9th International Conference on Theory and Practice of Public Key Cryptography. Springer, pp. 207–228, doi:10.1007/11745853_14.
3. Daniel J. Bernstein & Tanja Lange (2011): A Complete Set of Addition Laws for Incomplete Edwards Curves. Journal of Number Theory 131, pp. 858–872, doi:10.1016/j.jnt.2010.06.015.
4. Stefan Friedl (1998): An Elementary Proof of the Group Law for Elliptic Curve.
5. Benjamin Gregoire & Assia Mahboubi (2005): Proving Equalities in a Commutative Ring Done Right in Coq. In: Proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics. Springer-Verlag, pp. 98–113, doi:10.1007/11541868_7.
6. Henri Poincaré (1901): Sur les Propriétés Arithmetiques des Courbes Algébriques. Lournalde Mathématiques Pures et Appliuées 7, pp. 121–233.
7. Vaughn Pratt (1975): Every Prime Has a Succinct Certification. SIAM Journal on Computing 4, doi:10.1137/0204018.
8. David M. Russinoff: Polynomial Terms and Sparse Horner Normal Form. Available at http://www.russinoff.com/papers/shnf.pdf.
9. David M. Russinoff: Pratt Certification and the Primality of 2^255-19. Available at http://www.russinoff.com/papers/pratt.pdf.
10. Joseph H. Silverman & John T. Tate (2015): Rational Points on Elliptic Curves. Springer-Verlag, doi:10.1007/978-3-319-18588-0.
11. Laurent Théry (2007): Proving the Group Law for Elliptic Curves Formally. Technical Report RT-0330. Inria.
12. Thomas Tymoczko (1998): Computers and Mathematical Practice: A Case Study. Princeton University Press.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org