Javier A. Verbel

Orcid: 0000-0003-1388-6667

According to our database1, Javier A. Verbel authored at least 25 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Improved Attacks for SNOVA by Exploiting Stability Under a Group Action.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Admissible Parameters for the Crossbred Algorithm and Semi-regular Sequences over Finite Fields.
IACR Cryptol. ePrint Arch., 2024

SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation.
Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, 2024

Biscuit: New MPCitH Signature Scheme from Structured Multivariate Polynomials.
Proceedings of the Applied Cryptography and Network Security, 2024

2023
ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation.
IACR Cryptol. ePrint Arch., 2023

MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head.
IACR Cryptol. ePrint Arch., 2023

On the complexity of solving generic overdetermined bilinear systems.
Adv. Math. Commun., 2023

MinRank in the Head - Short Signatures from Zero-Knowledge Proofs.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2023, 2023

2022
MR-DSS - Smaller MinRank-Based (Ring-)Signatures.
Proceedings of the Post-Quantum Cryptography - 13th International Workshop, 2022

Partial Key Exposure Attacks on BIKE, Rainbow and NTRU.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

An Estimator for the Hardness of the MQ Problem.
Proceedings of the Progress in Cryptology, 2022

2021
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems.
IACR Cryptol. ePrint Arch., 2021

Improving Support-Minors rank attacks: applications to GeMSS and Rainbow.
IACR Cryptol. ePrint Arch., 2021

A Polynomial Time Key-Recovery Attack on the Sidon Cryptosystem.
Proceedings of the Selected Areas in Cryptography - 28th International Conference, 2021

On the Effect of Projection on Rank Attacks in Multivariate Cryptography.
Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

2020
On the Complexity of Solving Generic Over-determined Bilinear Systems.
CoRR, 2020

Algebraic attacks for solving the Rank Decoding and MinRank problems without Gröbner basis.
CoRR, 2020

A Rank Attack Against Extension Field Cancellation.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
On the Complexity of "Superdetermined" Minrank Instances.
Proceedings of the Post-Quantum Cryptography - 10th International Conference, 2019

2018
Rank Analysis of Cubic Multivariate Cryptosystems.
Proceedings of the Post-Quantum Cryptography - 9th International Conference, 2018

2017
Key Recovery Attack for ZHFE.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

2016
Efficient ZHFE Key Generation.
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016


  Loading...