default search action
Javier A. Verbel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier A. Verbel, Floyd Zweydinger:
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(2): 304-328 (2024) - [c16]Luk Bettale, Delaram Kahrobaei, Ludovic Perret, Javier A. Verbel:
Biscuit: New MPCitH Signature Scheme from Structured Multivariate Polynomials. ACNS (1) 2024: 457-486 - [c15]Andre Esser
, Javier A. Verbel
SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation. AsiaCCS 2024 - [i18]John Baena, Daniel Cabarcas, Sharwan K. Tiwari, Javier A. Verbel, Luis Villota:
Admissible Parameters for the Crossbred Algorithm and Semi-regular Sequences over Finite Fields. IACR Cryptol. ePrint Arch. 2024: 758 (2024) - [i17]Daniel Cabarcas, Peigen Li, Javier A. Verbel, Ricardo Villanueva-Polanco:
Improved Attacks for SNOVA by Exploiting Stability under a Group Action. IACR Cryptol. ePrint Arch. 2024: 1770 (2024) - 2023
- [j2]John B. Baena, Daniel Cabarcas, Javier A. Verbel:
On the complexity of solving generic overdetermined bilinear systems. Adv. Math. Commun. 17(5): 1210-1234 (2023) - [c14]Gora Adj
MinRank in the Head - Short Signatures from Zero-Knowledge Proofs. AFRICACRYPT 2023: 3-27 - [i16]Andre Esser, Javier A. Verbel, Floyd Zweydinger, Emanuele Bellini:
ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation. IACR Cryptol. ePrint Arch. 2023: 589 (2023) - [i15]Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier A. Verbel, Floyd Zweydinger:
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head. IACR Cryptol. ePrint Arch. 2023: 1666 (2023) - [i14]Luk Bettale, Delaram Kahrobaei, Ludovic Perret, Javier A. Verbel:
Biscuit: New MPCitH Signature Scheme from Structured Multivariate Polynomials. IACR Cryptol. ePrint Arch. 2023: 1760 (2023) - 2022
- [j1]Stefano Barbero
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems. Discret. Appl. Math. 309: 13-31 (2022) - [c13]Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, Javier A. Verbel:
An Estimator for the Hardness of the MQ Problem. AFRICACRYPT 2022: 323-347 - [c12]Andre Esser
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. CRYPTO (3) 2022: 346-375 - [c11]John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow. CRYPTO (3) 2022: 376-405 - [c10]Emanuele Bellini
MR-DSS - Smaller MinRank-Based (Ring-)Signatures. PQCrypto 2022: 144-169 - [i13]Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen:
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. IACR Cryptol. ePrint Arch. 2022: 259 (2022) - [i12]Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, Javier A. Verbel:
An Estimator for the Hardness of the MQ Problem. IACR Cryptol. ePrint Arch. 2022: 708 (2022) - [i11]Emanuele Bellini, Andre Esser, Carlo Sanna, Javier A. Verbel:
MR-DSS - Smaller MinRank-based (Ring-)Signatures. IACR Cryptol. ePrint Arch. 2022: 973 (2022) - [i10]Gora Adj, Luis Rivera-Zamarripa, Javier A. Verbel:
MinRank in the Head: Short Signatures from Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2022: 1501 (2022) - 2021
- [c9]Morten Øygarden, Daniel Smith-Tone, Javier A. Verbel:
On the Effect of Projection on Rank Attacks in Multivariate Cryptography. PQCrypto 2021: 98-113 - [c8]Pierre Briaud, Jean-Pierre Tillich, Javier A. Verbel:
A Polynomial Time Key-Recovery Attack on the Sidon Cryptosystem. SAC 2021: 419-438 - [i9]Morten Øygarden, Daniel Smith-Tone, Javier A. Verbel:
On the Effect of Projection on Rank Attacks in Multivariate Cryptography. IACR Cryptol. ePrint Arch. 2021: 655 (2021) - [i8]Stefano Barbero, Emanuele Bellini, Carlo Sanna, Javier A. Verbel:
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems. IACR Cryptol. ePrint Arch. 2021: 913 (2021) - [i7]Pierre Briaud, Jean-Pierre Tillich, Javier A. Verbel:
A polynomial time key-recovery attack on the Sidon cryptosystem. IACR Cryptol. ePrint Arch. 2021: 929 (2021) - [i6]John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Improving Support-Minors rank attacks: applications to GeMSS and Rainbow. IACR Cryptol. ePrint Arch. 2021: 1677 (2021) - 2020
- [c7]Magali Bardet, Maxime Bros
Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems. ASIACRYPT (1) 2020: 507-536 - [c6]Daniel Apon, Dustin Moody, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme. PQCrypto 2020: 307-322 - [c5]Daniel Smith-Tone, Javier A. Verbel:
A Rank Attack Against Extension Field Cancellation. PQCrypto 2020: 381-401 - [i5]Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray A. Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, Javier A. Verbel:
Algebraic attacks for solving the Rank Decoding and MinRank problems without Gröbner basis. CoRR abs/2002.08322 (2020) - [i4]John B. Baena, Daniel Cabarcas, Javier A. Verbel:
On the Complexity of Solving Generic Over-determined Bilinear Systems. CoRR abs/2006.09442 (2020) - [i3]Daniel Apon, Dustin Moody, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme. IACR Cryptol. ePrint Arch. 2020: 1086 (2020)
2010 – 2019
- 2019
- [c4]Javier A. Verbel, John Baena, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone:
On the Complexity of "Superdetermined" Minrank Instances. PQCrypto 2019: 167-186 - [i2]Javier A. Verbel, John Baena, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone:
On the Complexity of "Superdetermined" Minrank Instances. IACR Cryptol. ePrint Arch. 2019: 731 (2019) - 2018
- [c3]John Baena, Daniel Cabarcas, Daniel E. Escudero, Karan Khathuria
Rank Analysis of Cubic Multivariate Cryptosystems. PQCrypto 2018: 355-374 - [i1]John Baena, Daniel Cabarcas, Daniel E. Escudero, Karan Khathuria, Javier A. Verbel:
Rank Analysis of Cubic Multivariate Cryptosystems. IACR Cryptol. ePrint Arch. 2018: 110 (2018) - 2017
- [c2]Daniel Cabarcas, Daniel Smith-Tone, Javier A. Verbel:
Key Recovery Attack for ZHFE. PQCrypto 2017: 289-308 - 2016
- [c1]John B. Baena
Efficient ZHFE Key Generation. PQCrypto 2016: 213-232
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: