Machine-Level Software Optimization of Cryptographic Protocols

cryptography;cryptology;key-exchange;pairings;BN-curves;isogenies;elliptic curves;Tate pairing;Optimal Ate pairing;mobile devices;post-quantum cryptography;assembly language;Combinatorics and Optimization

Fishbein, Dieter

University of Waterloo

关键词: cryptography;    cryptology;    key-exchange;    pairings;    BN-curves;    isogenies;    elliptic curves;    Tate pairing;    Optimal Ate pairing;    mobile devices;    post-quantum cryptography;    assembly language;    Combinatorics and Optimization;   

Others  :  https://uwspace.uwaterloo.ca/bitstream/10012/8400/1/Fishbein_Dieter.pdf

瑞士|英语

来源: UWSPACE Waterloo Institutional Repository

【 摘 要 】

This work explores two methods for practical cryptography on mobile devices. The first method is a quantum-resistant key-exchange protocol proposed by Jao et al.. As the use of mobile devices increases, the deployment of practical cryptographic protocols designed for use on these devices is of increasing importance. Furthermore, we are faced with the possible development of a large-scale quantum computer in the near future and must take steps to prepare for this possibility.We describe the key-exchange protocol of Jao et al. and discuss their original implementation. We then describe our modifications to their scheme that make it suitable for use in mobile devices. Our code is between 18-26% faster (depending on the security level). The second is an highly optimized implementation of Miller;;s algorithm that efficiently computes the Optimal Ate pairing over Barreto-Naehrig curves proposed by Grewal et al.. We give an introduction to cryptographic pairings and describe the Tate pairing and its variants. We then proceed to describe Grewal et al.;;s implementation of Miller;;s algorithm, along with their optimizations. We describe our use of hand-optimized assembly code to increase the performance of their implementation. For the Optimal Ate pairing over the BN-446 curve, our code is between 7-8% faster depending on whether the pairing uses affine or projective coordinates.