default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiacomo Micheli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i19]Giacomo Cherubini, Giacomo Micheli:
A New Class of Linear Codes. CoRR abs/2401.07986 (2024)- [i18]Luca Bastioni, Mohamed O. Darwish, Giacomo Micheli:
Optimal Rank-Metric Codes with Rank-Locality from Drinfeld Modules. CoRR abs/2407.06081 (2024) - 2023
- [j16]Austin Dukes, Giacomo Micheli
, Vincenzo Pallozzi Lavorante:
Optimal Locally Recoverable Codes With Hierarchy From Nested F-Adic Expansions. IEEE Trans. Inf. Theory 69(11): 6981-6988 (2023) - [c7]Jean-François Biasse, Giacomo Micheli:
A Search-to-Decision Reduction for the Permutation Code Equivalence Problem. ISIT 2023: 602-607 - [c6]Clifton Garrison, Giacomo Micheli, Logan Nott, Vincenzo Pallozzi Lavorante, Phillip Waitkevich:
On a Class of Optimal Locally Recoverable Codes with Availability. ISIT 2023: 2021-2026 - [i17]Luca Bastioni, Giacomo Micheli:
On complete m-arcs. CoRR abs/2303.13670 (2023) - [i16]Andrea Ferraguti, Dorian Goldfeld, Giacomo Micheli:
Number Theoretical Locally Recoverable Codes. CoRR abs/2304.09071 (2023) - 2022
- [j15]Daniele Bartoli, Giacomo Micheli:
Algebraic Constructions of Complete m-Arcs. Comb. 42(5): 673-700 (2022) - [j14]Austin Dukes, Andrea Ferraguti, Giacomo Micheli:
Optimal selection for good polynomials of degree up to five. Des. Codes Cryptogr. 90(6): 1427-1436 (2022) - [j13]Daniele Bartoli, Giacomo Micheli, Giovanni Zini, Ferdinando Zullo:
r-fat linearized polynomials over finite fields. J. Comb. Theory A 189: 105609 (2022) - [c5]Andrea Ferraguti, Giacomo Micheli:
On a Conjecture on Irreducible Polynomials over Finite Fields with Restricted Coefficients. WAIFI 2022: 3-13 - [i15]Austin Dukes, Giacomo Micheli, Vincenzo Pallozzi Lavorante:
Optimal locally recoverable codes with hierarchy from nested F-adic expansions. CoRR abs/2207.10383 (2022) - [i14]Daniele Bartoli, Lukas Kölsch, Giacomo Micheli:
Differential biases, c-differential uniformity, and their relation to differential attacks. CoRR abs/2208.03884 (2022) - 2021
- [j12]Karan Khathuria, Giacomo Micheli, Violetta Weger:
On the algebraic structure of Ep(m) and applications to cryptography. Appl. Algebra Eng. Commun. Comput. 32(4): 495-505 (2021) - [i13]Austin Dukes, Andrea Ferraguti, Giacomo Micheli:
Optimal Selection for Good Polynomials of Degree up to Five. CoRR abs/2104.01434 (2021) - 2020
- [j11]Andrea Ferraguti, Giacomo Micheli:
Full classification of permutation rational functions and complete rational functions of degree three over finite fields. Des. Codes Cryptogr. 88(5): 867-886 (2020) - [j10]Giacomo Micheli:
Constructions of Locally Recoverable Codes Which are Optimal. IEEE Trans. Inf. Theory 66(1): 167-175 (2020) - [j9]Giacomo Micheli, Alessandro Neri:
New Lower Bounds for Permutation Codes Using Linear Block Codes. IEEE Trans. Inf. Theory 66(7): 4019-4025 (2020) - [c4]Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, Paolo Santini:
LESS is More: Code-Based Signatures Without Syndromes. AFRICACRYPT 2020: 45-65 - [i12]Dorian Goldfeld, Giacomo Micheli:
The Algebraic Theory of Fractional Jumps. CoRR abs/2001.00474 (2020) - [i11]Andrea Ferraguti, Giacomo Micheli:
Exceptional scatteredness in prime degree. CoRR abs/2002.00500 (2020) - [i10]Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, Paolo Santini:
LESS is More: Code-Based Signatures without Syndromes. IACR Cryptol. ePrint Arch. 2020: 594 (2020)
2010 – 2019
- 2019
- [j8]Giacomo Micheli, Violetta Weger:
Cryptanalysis of the CLR-cryptosystem. Des. Codes Cryptogr. 87(5): 1069-1086 (2019) - [j7]Federico Amadio Guidi, Sofia Lindqvist, Giacomo Micheli:
Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation. Math. Comput. 88(318): 2005-2025 (2019) - [j6]Giacomo Micheli:
On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic. SIAM J. Appl. Algebra Geom. 3(2): 256-265 (2019) - [j5]Giacomo Micheli, Violetta Weger:
On Rectangular Unimodular Matrices over the Algebraic Integers. SIAM J. Discret. Math. 33(1): 425-437 (2019) - [i9]Giacomo Micheli, Alessandro Neri:
New Lower Bounds for Permutation Codes using Linear Block Codes. CoRR abs/1901.08858 (2019) - 2018
- [c3]Daniel Hart, DoHoon Kim, Giacomo Micheli, Guillermo Pascual-Perez, Christophe Petit, Yuxuan Quek:
A Practical Cryptanalysis of WalnutDSA TM. Public Key Cryptography (1) 2018: 381-406 - [c2]Federico Amadio Guidi, Giacomo Micheli:
Fractional Jumps: Complete Characterisation and an Explicit Infinite Family. WAIFI 2018: 250-263 - [i8]Andrea Ferraguti, Giacomo Micheli:
Complete Classification of permutation rational functions of degree three over finite fields. CoRR abs/1805.03097 (2018) - [i7]Giacomo Micheli:
Constructions of Locally Recoverable Codes which are Optimal. CoRR abs/1806.11492 (2018) - [i6]Karan Khathuria, Giacomo Micheli, Violetta Weger:
Cryptanalysis of the DHDP and EGDP protocols over Ep(m). CoRR abs/1810.02964 (2018) - 2017
- [i5]Andrea Ferraguti, Giacomo Micheli, Reto Schnyder:
Irreducible compositions of degree two polynomials over finite fields have regular structure. CoRR abs/1701.06040 (2017) - [i4]Giacomo Micheli:
On the selection of polynomials for the DLP algorithm. CoRR abs/1706.08447 (2017) - [i3]Daniel Hart, DoHoon Kim, Giacomo Micheli, Guillermo Pascual-Perez, Christophe Petit, Yuxuan Quek:
A Practical Cryptanalysis of WalnutDSA. IACR Cryptol. ePrint Arch. 2017: 1160 (2017) - 2016
- [j4]Edoardo Dotti, Giacomo Micheli:
Eisenstein polynomials over function fields. Appl. Algebra Eng. Commun. Comput. 27(2): 159-168 (2016) - [c1]Andrea Ferraguti, Giacomo Micheli, Reto Schnyder:
On Sets of Irreducible Polynomials Closed by Composition. WAIFI 2016: 77-83 - 2015
- [j3]Giacomo Micheli:
Cryptanalysis of a noncommutative key exchange protocol. Adv. Math. Commun. 9(2): 247-253 (2015) - [j2]Giacomo Micheli:
On coefficient constraints and evaluation restrictions for linearized polynomials. Finite Fields Their Appl. 34: 139-152 (2015) - 2014
- [j1]Giacomo Micheli, Michele Schiavina:
A general construction for monoid-based knapsack protocols. Adv. Math. Commun. 8(3): 343-358 (2014) - 2013
- [i2]Giacomo Micheli:
Cryptanalysis of a non-commutative key exchange protocol. CoRR abs/1306.5326 (2013) - [i1]Giacomo Micheli, Michele Schiavina:
A general construction for monoid-based knapsack protocols. CoRR abs/1311.1442 (2013)
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 2024-08-13 21:52 CEST 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:
