| Title | TMVP-Friendly Primes for Efficient Elliptic Curve Cryptography |
| Publication Type | Conference Paper |
| Year of Publication | 2020 |
| Authors | Taşkın, H. K., Cenk, M. |
| Conference Name | 2020 International Conference on Information Security and Cryptology (ISCTURKEY) |
| Keywords | cryptography, Elliptic curve cryptography, Elliptic curves, Finite field multiplication, Information security, Metrics, Montgomery curves, NIST, pubcrawl, Registers, Resiliency, Scalability, Toeplitz-matrix vector product, Upper bound |
| Abstract | The need for faster and practical cryptography is a research topic for decades. In case of elliptic curve cryptography, which was proposed by Koblitz and Miller in 1985 as a more efficient alternative to RSA, the applications in real life started after 2000s. Today, most of the popular applications and protocols like Whatsapp, Signal, iOS, Android, TLS, SSH, Bitcoin etc. make use of Elliptic curve cryptography. One of the important factor for high performance elliptic curve cryptography is the finite field multiplication. In this paper, we first describe how to choose proper prime fields that makes use of Topelitz-matrices to get faster field multiplication, then we give parameter choice details to select prime fields that supports Toeplitz-matrix vector product operations. Then, we introduce the safe curve selection rationale and discuss about security. We propose new curves, discuss implementation and benchmark results and conclude our work. |
| DOI | 10.1109/ISCTURKEY51113.2020.9307999 |
| Citation Key | taskin_tmvp-friendly_2020 |
TMVP-Friendly Primes for Efficient Elliptic Curve Cryptography