Giacomo Micheli

Vincenzo Pallozzi Lavorante

Phillip Waitkevich

CoRR, 2024

Optimal Rank-Metric Codes with Rank-Locality from Drinfeld Modules.

[BibT_eX]

[DOI]

Luca Bastioni

Mohamed O. Darwish

CoRR, 2024

A New Class of Linear Codes.

[BibT_eX]

[DOI]

Giacomo Cherubini

CoRR, 2024

2023

Optimal Locally Recoverable Codes With Hierarchy From Nested F-Adic Expansions.

[BibT_eX]

[DOI]

Austin Dukes

Vincenzo Pallozzi Lavorante

IEEE Trans. Inf. Theory, November, 2023

Number Theoretical Locally Recoverable Codes.

[BibT_eX]

[DOI]

Dorian Goldfeld

CoRR, 2023

On complete m-arcs.

[BibT_eX]

[DOI]

Luca Bastioni

CoRR, 2023

On a Class of Optimal Locally Recoverable Codes with Availability.

[BibT_eX]

[DOI]

Clifton Garrison

Vincenzo Pallozzi Lavorante

Logan Nott

Phillip Waitkevich

Proceedings of the IEEE International Symposium on Information Theory, 2023

A Search-to-Decision Reduction for the Permutation Code Equivalence Problem.

[BibT_eX]

[DOI]

Jean-François Biasse

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

r-fat linearized polynomials over finite fields.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2022

Optimal selection for good polynomials of degree up to five.

[BibT_eX]

[DOI]

Austin Dukes

Des. Codes Cryptogr., 2022

Differential biases, c-differential uniformity, and their relation to differential attacks.

[BibT_eX]

[DOI]

Daniele Bartoli

Lukas Kölsch

CoRR, 2022

Algebraic Constructions of Complete m-Arcs.

[BibT_eX]

[DOI]

Daniele Bartoli

Comb., 2022

On a Conjecture on Irreducible Polynomials over Finite Fields with Restricted Coefficients.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

2021

On the algebraic structure of Ep(m) and applications to cryptography.

[BibT_eX]

[DOI]

Karan Khathuria

Appl. Algebra Eng. Commun. Comput., 2021

2020

New Lower Bounds for Permutation Codes Using Linear Block Codes.

[BibT_eX]

[DOI]

Alessandro Neri

IEEE Trans. Inf. Theory, 2020

Constructions of Locally Recoverable Codes Which are Optimal.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

LESS is More: Code-Based Signatures without Syndromes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Full classification of permutation rational functions and complete rational functions of degree three over finite fields.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

Exceptional scatteredness in prime degree.

[BibT_eX]

[DOI]

CoRR, 2020

The Algebraic Theory of Fractional Jumps.

[BibT_eX]

[DOI]

Dorian Goldfeld

CoRR, 2020

2019

On Rectangular Unimodular Matrices over the Algebraic Integers.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., 2019

Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation.

[BibT_eX]

[DOI]

Federico Amadio Guidi

Sofia Lindqvist

Math. Comput., 2019

Cryptanalysis of the CLR-cryptosystem.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

2018

Cryptanalysis of the DHDP and EGDP protocols over Ep(m).

[BibT_eX]

[DOI]

Karan Khathuria

CoRR, 2018

Complete Classification of permutation rational functions of degree three over finite fields.

[BibT_eX]

[DOI]

CoRR, 2018

Fractional Jumps: Complete Characterisation and an Explicit Infinite Family.

[BibT_eX]

[DOI]

Federico Amadio Guidi

Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

A Practical Cryptanalysis of WalnutDSA TM.

[BibT_eX]

[DOI]

Daniel Hart

Dohoon Kim

Guillermo Pascual-Perez

Christophe Petit

Yuxuan Quek

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2017

A Practical Cryptanalysis of WalnutDSA.

[BibT_eX]

[DOI]

Daniel Hart

Dohoon Kim

Guillermo Pascual-Perez

Christophe Petit

Yuxuan Quek

IACR Cryptol. ePrint Arch., 2017

On the selection of polynomials for the DLP algorithm.

[BibT_eX]

[DOI]

CoRR, 2017

Irreducible compositions of degree two polynomials over finite fields have regular structure.

[BibT_eX]

[DOI]

Reto Schnyder

CoRR, 2017

2016

Eisenstein polynomials over function fields.

[BibT_eX]

[DOI]

Edoardo Dotti

Appl. Algebra Eng. Commun. Comput., 2016

On Sets of Irreducible Polynomials Closed by Composition.

[BibT_eX]

[DOI]

Reto Schnyder

Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

2015

On coefficient constraints and evaluation restrictions for linearized polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

Cryptanalysis of a noncommutative key exchange protocol.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

2014

A general construction for monoid-based knapsack protocols.

[BibT_eX]

[DOI]

Michele Schiavina

Adv. Math. Commun., 2014

2013

Cryptanalysis of a non-commutative key exchange protocol.

[BibT_eX]

[DOI]