Scalar multiplication unit for Elliptic curve cryptography. This repository is for the upcoming work :
Pedro Maat C. Massolino, Joost Renes, Lejla Batina. Implementing Complete Formulas on Weierstrass Curves in Hardware. Security, Privacy, and Applied Cryptography Engineering. Volume 10076 of the series Lecture Notes in Computer Science pp 89-108, Berlin, Heidelberg, 2016. Springer Berlin Heidelberg.
The scalar multiplication is based on the complete formulas for Weierstrass curves presented in :
J. Renes, C. Costello, and L. Batina. Complete addition formulas for prime order elliptic curves. In Advances in Cryptology – EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part I, pages 403–428, Berlin, Heidelberg, 2016. Springer Berlin Heidelberg.
While the hardware Montgomery multipliers are based on :
P. M. C. Massolino, L. Batina, R. Chaves, and N. Mentens. Low Power Montgomery Modular Multiplication on Reconfigurable Systems. Cryptology ePrint Archive, Report 2016/280, 2016.