activity
20182026
most citedA Note on the Hardness of Problems from Cryptographic Group Actions

1 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing math.AGShow all

1 paper · 1 filter

math.AG2026

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…