Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time <i>O(n</i> log <i>n</i>) over all Finite Fields.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Automated Search for Conjectures on Mathematical Constants using Analysis of Integer Sequences.
Proceedings of the International Conference on Machine Learning, 2023
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II).
IACR Cryptol. ePrint Arch., 2022
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves.
Electron. Colloquium Comput. Complex., 2022
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields.
Electron. Colloquium Comput. Complex., 2021
Proximity Gaps for Reed-Solomon Codes.
Electron. Colloquium Comput. Complex., 2020