Efficient Pairings on Various Platforms

ARM processor;cryptography;pairing-based cryptography;pairings;pairing computation;O-Ate pairing;Combinatorics and Optimization

Grewal, Gurleen

University of Waterloo

关键词: ARM processor;    cryptography;    pairing-based cryptography;    pairings;    pairing computation;    O-Ate pairing;    Combinatorics and Optimization;   

Others  :  https://uwspace.uwaterloo.ca/bitstream/10012/6722/1/Grewal_Gurleen.pdf

瑞士|英语

来源: UWSPACE Waterloo Institutional Repository

【 摘 要 】

Pairings have found a range of applications in many areas of cryptography. As such, toutilize the enormous potential of pairing-based protocols one needs to efficiently computepairings across various computing platforms. In this thesis, we give an introduction topairing-based cryptography and describe the Tate pairing and its variants. We then describesome recent work to realize efficient computation of pairings. We further extendthese optimizations and implement the O-Ate pairing on BN-curves on ARM and x86-64platforms. Specifically, we extend the idea of lazy reduction to field inversion, optimizecurve arithmetic, and construct efficient tower extensions to optimize field arithmetic. Wealso analyze the use of affine coordinates for pairing computation leading us to the conclusionthat they are a competitive choice for fast pairing computation on ARM processors,especially at high security level. Our resulting implementation is more than threetimes faster than any previously reported implementation on ARM processors.