default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandro Budroni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Alessandro Budroni
, Erik Mårtensson:
Further improvements of the estimation of key enumeration with applications to solving LWE. Cryptogr. Commun. 16(5): 1163-1182 (2024)- [j4]Slim Bettaieb, Loïc Bidoux, Alessandro Budroni, Marco Palumbi, Lucas Pandolfo Perin:
Enabling PERK and other MPC-in-the-Head Signatures on Resource-Constrained Devices. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(4): 84-109 (2024) - [c8]Slim Bettaieb, Alessandro Budroni, Marco Palumbi, Décio Luiz Gazzoni Filho:
Quasi-optimal Permutation Ranking and Applications to PERK. AFRICACRYPT 2024: 49-65 - [c7]Alessandro Budroni, Jesús-Javier Chi-Domínguez, Giuseppe D'Alconzo, Antonio J. Di Scala, Mukul Kulkarni:
Don't Use it Twice! Solving Relaxed Linear Equivalence Problems. ASIACRYPT (8) 2024: 35-65 - [c6]Benjamin Bencina, Alessandro Budroni, Jesús-Javier Chi-Domínguez, Mukul Kulkarni:
Properties of Lattice Isomorphism as a Cryptographic Group Action. PQCrypto (1) 2024: 170-201 - [i14]Alessandro Budroni, Isaac Andrés Canales Martinez, Lucas Pandolfo Perin:
SoK: Methods for Sampling Random Permutations in Post-Quantum Cryptography. IACR Cryptol. ePrint Arch. 2024: 8 (2024) - [i13]Slim Bettaieb, Loïc Bidoux, Alessandro Budroni, Marco Palumbi, Lucas Pandolfo Perin:
Enabling PERK on Resource-Constrained Devices. IACR Cryptol. ePrint Arch. 2024: 88 (2024) - [i12]Alessandro Budroni, Jesús-Javier Chi-Domínguez, Giuseppe D'Alconzo, Antonio J. Di Scala, Mukul Kulkarni:
Don't Use It Twice! Solving Relaxed Linear Code Equivalence Problems. IACR Cryptol. ePrint Arch. 2024: 244 (2024) - [i11]Slim Bettaieb, Alessandro Budroni, Marco Palumbi, Décio Luiz Gazzoni Filho:
Quasi-Optimal Permutation Ranking and Applications to PERK. IACR Cryptol. ePrint Arch. 2024: 412 (2024) - [i10]Alessandro Budroni, Andrea Natale:
On the Sample Complexity of Linear Code Equivalence for all Code Rates. IACR Cryptol. ePrint Arch. 2024: 1757 (2024) - 2023
- [c5]Alessandro Budroni, Erik Mårtensson:
Improved Estimation of Key Enumeration with Applications to Solving LWE. ISIT 2023: 495-500 - [i9]Alessandro Budroni, Erik Mårtensson:
Improved Estimation of Key Enumeration with Applications to Solving LWE. IACR Cryptol. ePrint Arch. 2023: 139 (2023) - [i8]Alessandro Budroni, Jesús-Javier Chi-Domínguez, Mukul Kulkarni:
Lattice Isomorphism as a Group Action and Hard Problems on Quadratic Forms. IACR Cryptol. ePrint Arch. 2023: 1093 (2023) - [i7]Alessandro Budroni, Erik Mårtensson:
Further Improvements of the Estimation of Key Enumeration with Applications to Solving LWE. IACR Cryptol. ePrint Arch. 2023: 1547 (2023) - 2022
- [j3]Alessandro Budroni, Federico Pintore:
Efficient hash maps to ${\mathbb {G}}_2$ on BLS curves. Appl. Algebra Eng. Commun. Comput. 33(3): 261-281 (2022) - 2021
- [j2]Alessandro Budroni, Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
Improvements on Making BKW Practical for Solving LWE. Cryptogr. 5(4): 31 (2021) - [i6]Alessandro Budroni, Igor Semaev:
New Public-Key Crypto-System EHT. CoRR abs/2103.01147 (2021) - [i5]Alessandro Budroni, Igor Semaev:
New Public-Key Crypto-System EHT. IACR Cryptol. ePrint Arch. 2021: 234 (2021) - 2020
- [c4]Alessandro Budroni, Benjamin Chetioui, Ermes Franch:
Attacks on Integer-RLWE. ICICS 2020: 528-542 - [c3]Alessandro Budroni, Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
Making the BKW Algorithm Practical for LWE. INDOCRYPT 2020: 417-439 - [i4]Alessandro Budroni, Benjamin Chetioui, Ermes Franch:
Attacks on Integer-RLWE. IACR Cryptol. ePrint Arch. 2020: 1007 (2020) - [i3]Alessandro Budroni, Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
Making the BKW Algorithm Practical for LWE. IACR Cryptol. ePrint Arch. 2020: 1467 (2020)
2010 – 2019
- 2019
- [c2]Alessandro Budroni, Andrea Tenti:
The Mersenne Low Hamming Combination Search Problem Can Be Reduced to an ILP Problem. AFRICACRYPT 2019: 41-55 - [i2]Alessandro Budroni, Andrea Tenti:
The Mersenne Low Hamming Combination Search Problem can be reduced to an ILP Problem. IACR Cryptol. ePrint Arch. 2019: 468 (2019) - 2018
- [j1]Alessandro Budroni, Federico Pintore:
Hashing to G2 on BLS pairing-friendly curves. ACM Commun. Comput. Algebra 52(3): 63-66 (2018) - 2017
- [i1]Alessandro Budroni, Federico Pintore:
Efficient hash maps to 픾2 on BLS curves. IACR Cryptol. ePrint Arch. 2017: 419 (2017) - 2016
- [c1]Quoc-Tin Phan, Alessandro Budroni, Cecilia Pasquini, Francesco G. B. De Natale:
A Hybrid Approach for Multimedia Use Verification. MediaEval 2016
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-06 01:51 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:
