1 citations · 3 across the 4 of their papers we have counts for
5 papers
Linear Code Equivalence via Plücker Coordinates
Gessica Alecci, Giuseppe D'Alconzo
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functional…
A note on a Code-Based Signature Scheme
Giuseppe D'Alconzo
In this work, we exploit a serious security flaw in a code-based signature scheme from a 2019 work by Liu, Yang, Han and Wang. They adapt the McEliece cryptosystem to obtain a new…
A Note on the Hardness of Problems from Cryptographic Group Actions
Giuseppe D'Alconzo
Given a cryptographic group action, we show that the Group Action Inverse Problem (GAIP) and other related problems cannot be NP-hard unless the Polynomial Hierarchy collapses. We…
Security issues of CFS-like digital signature algorithms
Giuseppe D'Alconzo, Alessio Meneghetti, Paolo Piasenti
We analyse the security of some variants of the CFS code-based digital signature scheme. We show how the adoption of some code-based hash-functions to improve the efficiency of CFS…
Vanishing ideals of binary Hamming spheres
Giuseppe D'Alconzo, Alessio Meneghetti
We consider the simplified Algebraic Normal Form (sANF) of Boolean functions vanishing on Hamming spheres centred at zero and the associated sANF vector. We show that this vector i…