Going out on a Limb: Accelerating Elliptic Curve Cryptography in OpenSSL
Turtle (Mill bee) | Wed 17 Apr 10:45 a.m.–11:30 a.m.
Presented by
-
Rohan McLure
https://rmclure.me
Rohan is an open source hacker at IBM, working on Linux Kernel support for the Power architecture, and serving as the community maintainer for OpenSSL on Power. The unifying factor is the performance lens Rohan employs when viewing software security on enterprise platforms.
With a mathematics and computer science background, Rohan has worked on HPC projects such as the Climate Modelling Alliance with California Institute of Technology, and now provides machine-optimised elliptic curve implementations in OpenSSL. Rohan's love for open source comes from the knowledge sharing that it permits - broadening the horizon of algorithms and hardware that programmers can reason with and apply to make the best possible software.
Rohan has spoken before at the inaugural Everything Open in 2023, explaining the difficulty on 64-bit (or even bi-endian) kernels of supporting multiple syscall ABIs, and providing a window into the world of Linux Kernel development.
Rohan McLure
https://rmclure.me
Abstract
Cryptographic libraries such as OpenSSL and GNU Nettle form the backbone of security in the current day. Proving authenticity online, establishing secure communication channels etc all depend on complex mathematical structures, including algebraic groups on Elliptic Curves.
But what is an Elliptic Curve? This talk will discuss the underlying arithmetic used in ECC, why it might be unwise to roll your own crypto (even if you understand the maths), and how to perform both fast (and secure) finite field arithmetic.
Come along if you have an interest in the mathematics of cryptography and better understanding how it is implemented.
Cryptographic libraries such as OpenSSL and GNU Nettle form the backbone of security in the current day. Proving authenticity online, establishing secure communication channels etc all depend on complex mathematical structures, including algebraic groups on Elliptic Curves. But what is an Elliptic Curve? This talk will discuss the underlying arithmetic used in ECC, why it might be unwise to roll your own crypto (even if you understand the maths), and how to perform both fast (and secure) finite field arithmetic. Come along if you have an interest in the mathematics of cryptography and better understanding how it is implemented.