Don’t Forget Your Roots Constant-Time Root Finding over ( \mathbb{F}_{2^m} )
Published in In *International Conference on Cryptology and Information Security in Latin America* (Latincrypt), 2019
This paper presents a constant-time algorithm for finding square roots in binary extension fields ( \mathbb{F}_{2^m} ), a critical operation in various cryptographic applications.
Key contributions:
- Designed to be immune to timing-based side-channel attacks
- Efficiently supports field sizes relevant to post-quantum schemes and ECC
- Offers performance improvements with predictable control flow
The proposed method enhances the security of cryptographic libraries that operate over binary fields.
Recommended citation: Douglas Marcelino Beppler Martins, Gustavo Banegas, Ricardo Felipe Custodio. (2019). Don\'t Forget Your Roots Constant-Time Root Finding over \( \mathbb{F}_{2^m} \). In International Conference on Cryptology and Information Security in Latin America (Latincrypt).
Download Paper | Download Slides | Download Bibtex