default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlo Sanna
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]Carlo Sanna:
On the number of solutions to a random instance of the permuted kernel problem. J. Complex. 86: 101898 (2025)- 2024
- [j10]Antonio J. Di Scala
, Carlo Sanna, Edoardo Signorini:
RLWE and PLWE over cyclotomic fields are not equivalent. Appl. Algebra Eng. Commun. Comput. 35(3): 351-358 (2024) - [j9]Carlo Sanna:
On the distribution of the entries of a fixed-rank random matrix over a finite field. Finite Fields Their Appl. 93: 102333 (2024) - [j8]Emanuele Bellini, Juan Grados, Rusydi H. Makarim, Carlo Sanna:
Finding differential trails on ChaCha by means of state functions. Int. J. Appl. Cryptogr. 4(3/4): 156-175 (2024) - [j7]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) - [i11]Carlo Sanna:
On the number of solutions to a random instance of the permuted kernel problem. CoRR abs/2406.00453 (2024) - 2023
- [j6]Carlo Sanna:
A note on the distribution of weights of fixed-rank matrices over the binary field. Finite Fields Their Appl. 87: 102157 (2023) - [i10]Antonio J. Di Scala, Carlo Sanna:
Smaller public keys for MinRank-based schemes. CoRR abs/2302.12447 (2023) - [i9]Carlo Sanna:
A note on the power sums of the number of Fibonacci partitions. CoRR abs/2309.12724 (2023) - [i8]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) - 2022
- [j5]Stefano Barbero, Emanuele Bellini, Carlo Sanna, Javier A. Verbel:
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems. Discret. Appl. Math. 309: 13-31 (2022) - [c2]Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, Javier A. Verbel:
An Estimator for the Hardness of the MQ Problem. AFRICACRYPT 2022: 323-347 - [c1]Emanuele Bellini, Andre Esser, Carlo Sanna, Javier A. Verbel:
MR-DSS - Smaller MinRank-Based (Ring-)Signatures. PQCrypto 2022: 144-169 - [i7]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) - [i6]Emanuele Bellini, Andre Esser, Carlo Sanna, Javier A. Verbel:
MR-DSS - Smaller MinRank-based (Ring-)Signatures. IACR Cryptol. ePrint Arch. 2022: 973 (2022) - [i5]Simone Dutto, Davide Margaria, Carlo Sanna, Andrea Vesco:
Toward a Post-Quantum Zero-Knowledge Verifiable Credential System for Self-Sovereign Identity. IACR Cryptol. ePrint Arch. 2022: 1297 (2022) - 2021
- [j4]Antonio J. Di Scala, Carlo Sanna, Edoardo Signorini:
On the condition number of the Vandermonde matrix of the nth cyclotomic polynomial. J. Math. Cryptol. 15(1): 174-178 (2021) - [i4]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) - 2020
- [i3]Carlo Sanna, Jeffrey O. Shallit, Shun Zhang:
The Largest Entry in the Inverse of a Vandermonde Matrix. CoRR abs/2008.01012 (2020)
2010 – 2019
- 2019
- [j3]Daniel M. Kane, Carlo Sanna, Jeffrey O. Shallit:
Waring's Theorem for Binary Powers. Comb. 39(6): 1335-1350 (2019) - 2018
- [i2]Daniel M. Kane, Carlo Sanna, Jeffrey O. Shallit:
Waring's Theorem for Binary Powers. CoRR abs/1801.04483 (2018) - 2015
- [j2]Edinah K. Gnang, Maksym Radziwill, Carlo Sanna:
Counting arithmetic formulas. Eur. J. Comb. 47: 40-53 (2015) - 2014
- [j1]Carlo Sanna:
On the Exponential Sum With the Sum of Digits of Hereditary Base b Notation. Integers 14: A36 (2014) - [i1]Edinah K. Gnang, Maksym Radziwill, Carlo Sanna:
Counting arithmetic formulas. CoRR abs/1406.1704 (2014)
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-09 13:14 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:
