Algorithmic number theory and cryptography — Comité des projets, Bordeaux Damien R󰀻󰀮󰀱󰀾󰁀 Équipe LFANT, Inria Bordeaux Sud-Ouest - Finite fields - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-08-21 15:44:55 Cryptography Public-key cryptography Elliptic curve cryptography Finite fields Elliptic curve RSA Security National Security Agency Index of cryptography articles Book:Cryptography		Algorithmic number theory and cryptography — Comité des projets, Bordeaux Damien R󰀻󰀮󰀱󰀾󰁀 Équipe LFANT, Inria Bordeaux Sud-Ouest Add to Reading List Source URL: www.normalesup.org Download Document from Source Website File Size: 310,07 KB Share Document on Facebook

	Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology The 12th Workshop on Elliptic Curve Cryptography DocID: 1vnty - View Document
	Analysis of Efficient Techniques for Fast Elliptic Curve Cryptography on x86-64 based Processors Patrick Longa, and Catherine Gebotys Department of Electrical and Computer Engineering, University of Waterloo, Canada, {pl DocID: 1vaTL - View Document
	Elliptic Curves over Q Peter Birkner Technische Universiteit Eindhoven DIAMANT Summer School on Elliptic and Hyperelliptic Curve Cryptography DocID: 1v7hw - View Document
	Crafting Certiﬁed Elliptic Curve Cryptography Implementations in Coq Andres Erbsen Submitted to the Department of Electrical Engineering and Computer Science in partial fulﬁllment of the requirements for the degree o DocID: 1uYe1 - View Document
	Elliptic curve cryptography on FPGAs: How fast can we go with a single chip? Kimmo Järvinen Department of Information and Computer Science Aalto University, Finland DocID: 1uOhT - View Document