Maria Corte-Real Santos

Orcid: 0000-0003-2651-8951

According to our database1, Maria Corte-Real Santos authored at least 15 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Evaluation of Modular Polynomials from Supersingular Elliptic Curves.
IACR Cryptol. ePrint Arch., 2025

Efficient algorithms for the detection of (N,N)-splittings and endomorphisms.
IACR Cryptol. ePrint Arch., 2025

Qlapoti: Simple and Efficient Translation of Quaternion Ideals to Isogenies.
IACR Cryptol. ePrint Arch., 2025

PRISM: Simple and Compact Identification and Signatures from Large Prime Degree Isogenies.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

2024
Isogenies on Kummer Surfaces.
Math. Comput., 2024

Return of the Kummer: a toolbox for genus 2 cryptography.
IACR Cryptol. ePrint Arch., 2024

Efficient (3,3)-isogenies on fast Kummer surfaces.
IACR Cryptol. ePrint Arch., 2024

Efficient (3, 3)-isogenies on fast Kummer surfaces.
CoRR, 2024

Finding Practical Parameters for Isogeny-based Cryptography.
IACR Commun. Cryptol., 2024

An Algorithm for Efficient Detection of (N, N)-Splittings and Its Application to the Isogeny Problem in Dimension 2.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

AprèsSQI: Extra Fast Verification for SQIsign Using Extension-Field Signing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

On Cycles of Pairing-Friendly Abelian Varieties.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Cryptographic Smooth Neighbors.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root Detection.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
SuperSolver: accelerating the Delfs-Galbraith algorithm with fast subfield root detection.
IACR Cryptol. ePrint Arch., 2021


  Loading...