This SkillsCast is currently only available to registered attendees of Rust Forum
It will be freely available to all Skills Matter members once the Rust Forum early-access window expires on August 22, 2022.
The talk discusses the results of experiments improving the efficiency of constant-time cryptographic algorithms implemented in Rust, with applications to faster Elliptic Curve Cryptography of practical interest.
Links and Resources Mentioned in this Session
- This is the fork of the bls12381 crate from ZCash implementing the ideas in the talk: https://github.com/dfaranha/bls12381-bench
- The subtle crate for constant-time programming: https://crates.io/crates/subtle
- The RELIC library in C+ASM implementing pairings over many curves: https://github.com/relic-toolkit/relic/
- If one is interested in learning more about the math behind pairings: https://www.craigcostello.com.au/s/PairingsForBeginners.pdf
YOU MAY ALSO LIKE:
- Experimenting with Faster Elliptic Curves in Rust (SkillsCast recorded in June 2021)
- Introduction to Rust (Online Workshop on 7th - 14th September 2022)
- Embedded Rust: Beginners Workshop (Online Workshop on 8th December 2022)
- Java Forum (Online Conference on 31st August 2022)
- YOW! Perth Developer Conference 2022: In-Person (in Perth on 19th - 20th September 2022)
- Bazel eXchange Panel: Day 2 (SkillsCast recorded in June 2022)
- Fast, Green — Choose Two: A Buildkite Case Study (SkillsCast recorded in June 2022)