Faster compact Diffie-Hellman: Endomorphisms on the x-line
Abstract
We describe an implementation of fast elliptic curve scalar multiplication, optimized for Diffie-Hellman Key Exchange at the 128-bit security level. The algorithms are compact (using only x-coordinates), run in constant time with uniform execution pattern
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84901674442&doi=10.1007%2f978-3-642-55220-5_11&partnerID=40&md5=0079e434e9b74008344fa1f147440140https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10440
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..