Elisa Gorla

Orcid: 0000-0002-6418-4887

Affiliations:
  • University of Neuchatel, Switzerland


According to our database1, Elisa Gorla authored at least 40 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
MacWilliams' Extension Theorem for rank-metric codes.
J. Symb. Comput., May, 2024

2023
Generalized Weights of Convolutional Codes.
IEEE Trans. Inf. Theory, August, 2023

Quasi optimal anticodes: structure and invariants.
Des. Codes Cryptogr., May, 2023

The complexity of solving a random polynomial system.
CoRR, 2023

Integer sequences that are generalized weights of a linear code.
CoRR, 2023

Sum-rank metric codes.
CoRR, 2023

2022
Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric.
IEEE Trans. Inf. Theory, 2022

Stronger bounds on the cost of computing Gröbner bases for HFE systems.
J. Symb. Comput., 2022

Generalized column distances.
CoRR, 2022

Generalized weights of codes over rings and invariants of monomial ideals.
CoRR, 2022

2021
Solving degree, last fall degree, and related invariants.
IACR Cryptol. ePrint Arch., 2021

The complexity of solving Weil restriction systems.
IACR Cryptol. ePrint Arch., 2021

2020
Stronger bounds on the cost of computing Groebner bases for HFE systems.
IACR Cryptol. ePrint Arch., 2020

Semi-regular sequences and other random systems of equations.
IACR Cryptol. ePrint Arch., 2020

2019
The complexity of MinRank.
IACR Cryptol. ePrint Arch., 2019

Rank-metric codes.
CoRR, 2019

2018
An Algebraic Framework for End-to-End Physical-Layer Network Coding.
IEEE Trans. Inf. Theory, 2018

Weight distribution of rank-metric codes.
Des. Codes Cryptogr., 2018

Rank-Metric Codes and q-Polymatroids.
CoRR, 2018

2017
Solving Multivariate Polynomial Systems and an Invariant from Commutative Algebra.
IACR Cryptol. ePrint Arch., 2017

Compression for trace zero points on twisted Edwards curves.
IACR Cryptol. ePrint Arch., 2017

Scalar multiplication in compressed coordinates in the trace-zero subgroup.
IACR Cryptol. ePrint Arch., 2017

An optimal representation for the trace zero subgroup.
Des. Codes Cryptogr., 2017

Codes Endowed With the Rank Metric.
CoRR, 2017

2016
Optimal Ferrers Diagram Rank-Metric Codes.
IEEE Trans. Inf. Theory, 2016

2015
Point compression for the trace zero subgroup over a small degree extension field.
Des. Codes Cryptogr., 2015

Equidistant subspace codes.
CoRR, 2015

Rank distribution of Delsarte codes.
CoRR, 2015

Index calculus in the trace zero variety.
Adv. Math. Commun., 2015

2014
Partial spreads in random network coding.
Finite Fields Their Appl., 2014

Subspace codes from Ferrers diagrams.
CoRR, 2014

Computing the dimension of ideals in group algebras, with an application to coding theory.
CoRR, 2014

2012
An algebraic approach for decoding spread codes.
Adv. Math. Commun., 2012

2011
Torus-Based Cryptography.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

2008
Spread codes and spread decoding in network coding.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Efficient FPGA-based multipliers for F_{3^97} and F_{3^{6*97}}
CoRR, 2007

Explicit formulas for efficient multiplication in F_{3^{6m}}
CoRR, 2007

Cryptanalysis of the CFVZ cryptosystem.
Adv. Math. Commun., 2007

Explicit Formulas for Efficient Multiplication in \mathbb<i>F</i><sub>3<sup>6<i>m</i></sup></sub>.
Proceedings of the Selected Areas in Cryptography, 14th International Workshop, 2007

Efficient FPGA-based multipliers for F_3^97 and F_3^(6*97).
Proceedings of the FPL 2007, 2007


  Loading...