Ryan Lehmkuhl
PhD Student at Massachusetts Institute of Technology
Berkeley, California, United States
Summary
👤
Senior🎓
Top SchoolRyan Lehmkuhl is a PhD student and software engineer in Berkeley with a decade of hands-on experience building secure, privacy-preserving systems and cryptographic primitives. His work spans industry and academia—from designing enclave-backed private analytics at Opaque Systems to researching privacy-preserving ML and argument systems at Berkeley RISE Lab under advisors like Raluca Ada Popa and Alessandro Chiesa. A strong Rust contributor, he has implemented sparse multivariate polynomial structures and generalized polynomial types in prominent arkworks libraries that underpin modern cryptographic and polynomial-commitment schemes. He also brings practical security teaching experience, having co-instructed and TAd for Berkeley’s CS161, and a background in applied wireless and ICS security from industry internships. Ryan combines rigorous theoretical foundations with production-minded engineering, frequently turning abstract cryptographic constructs into robust, reusable code.
11 years of coding experience
4 years of employment as a software developer
Bachelor of Science - BS, Electrical Engineering and Computer Science, Bachelor of Science - BS, Electrical Engineering and Computer Science at UC Berkeley College of Engineering
Github Skills (4)
elliptic-curve10
cryptography10
polynomials10
rust10
Programming languages (9)
Github contributions (5)
arkworks-rs/algebra
Oct 2020 - Jan 2022
Libraries for finite field, elliptic curve, and polynomial arithmetic
Role in this project:
Back-end Developer
Back-end DeveloperContributions:9 reviews, 25 commits, 11 PRs in 1 year 2 months
Contributions summary:Ryan primarily focused on adding and modifying polynomial interfaces and multivariate polynomial implementations within the arkworks-rs/algebra repository. Their work included defining a sparse multivariate polynomial structure, implementing core functions for polynomial evaluation, addition, negation, and subtraction. These contributions were crucial for building the underlying mathematical building blocks for cryptography.
elliptic-curvefinite-fieldrustcryptographyfinite-fields
arkworks-rs/poly-commit
Nov 2020 - Jan 2021
A Rust library for polynomial commitments
Role in this project:Back-end Developer
Back-end DeveloperContributions:1 review, 10 commits, 10 PRs in 2 months
Contributions summary:Ryan made significant contributions to generalizing the polynomial type within the `poly-commit` library. They modified the code to accommodate different polynomial types. The user also applied suggestions from code reviews and fixed various aspects of the code. These changes indicate a focus on improving the flexibility and robustness of the polynomial commitment scheme.
rustcryptographypairingspolynomial-commitmentsmarlin
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.