The algorithms linked from this page provide the MAGMA code used to obtain the timings given for each of the nine TNFS-secure families presented in the article: 'Optimal TNFS-secure pairings on elliptic curves with even embedding degree' by Georgios Fotiadis and Chloe Martindale.
<br><br>
The file names describe each family as follows:<br>
OA = implementation of the Optimal Ate pairing<br>
TA = implementation of the Twisted Ate pairing<br>
kn = embedding degree k=n<br>
Dn = CM discriminant D=n<br><br>

Date:        Oct. 10, 2018<br>
Last update: Oct. 10, 2018<br><br>

(c) 2018, Georgios Fotiadis & Chloe Martindale<br><br>
                 
Georgios Fotiadis, University of the Aegean, Greece <br>
email: gfotiadis@aegean.gr<br><br>

Chloe Martindale, Technische Universiteit Eindhoven, the Netherlands<br>
email: chloemartindale@gmail.com<br><br>

<a href="[OAk10D15].rtf">OAk10D15</a><br>
<a href="[OAk10D1].rtf">OAk10D1</a><br>
<a href="[OAk10D5].rtf">OAk10D5</a><br>
<a href="[OAk12D2].rtf">OAk12D2</a><br>
<a href="[OAk14D1].rtf">OAk14D1</a><br>
<a href="[OAk8D1].rtf">OAk8D1</a><br>
<a href="[OAk8D2].rtf">OAk8D2</a><br>
<a href="[OAk8D3].rtf">OAk8D3</a><br>
<a href="[TAk12D3].rtf">TAk12D3</a>