Optimizations for Pairing-Based Cryptography

This repository contains the working Rust code that corresponds to a series of blog posts covering optimizations in pairing-based cryptography.

Please note: This code is for educational purposes, has not undergone a security audit and is not suitable for production. Use at your own risk.

Montgomery arithmetic (1 of 2)

This post will cover modular Montgomery arithmetic from start to finish, including context, alternatives, theory and practical working code in Rust running 9X faster than an generic Big Integer implementation. The next blog post will further optimize the (relatively) heavyweight multiplication routine in bare-metal x86-64 assembly language.

• The blog post: https://research.nccgroup.com/2020/08/13/pairing-over-bls12-381-part-3-pairing/
• The full code: https://github.com/eschorn1/ff_12381/tree/main/src

Montgomery arithmetic (2 of 2)

Coming soon...

---

Copyright 2021 Eric Schorn; Licensed under the 3-Clause BSD License.