5 papers
Decoding Desarguesian spread codes beyond half minimum distance
Ermes Franch, Chunlei Li, Angelica Piccirillo
Spread codes are a well-known family of constant-dimension subspace-metric codes. For constant dimension and ambient space dimension being a multiple of , these codes ha…
Removing the Trigger, Not the Backdoor: Alternative Triggers and Latent Backdoors
Gorka Abad, Ermes Franch, Stefanos Koffas +1
Current backdoor defenses assume that neutralizing a known trigger removes the backdoor. We show this trigger-centric view is incomplete: \emph{alternative triggers}, patterns perc…
NegaBent, No Regrets: Evolving Spectrally Flat Boolean Functions
Claude Carlet, Marko Ãurasevic, Ermes Franch +3
Negabent Boolean functions are defined by having a flat magnitude spectrum under the nega-Hadamard transform. They exist in both even and odd dimensions, and the subclass of functi…
NoMod: A Non-modular Attack on Module Learning With Errors
Cristian Bassotto, Ermes Franch, Marina KrÄek +1
The advent of quantum computing threatens classical public-key cryptography, motivating NIST's adoption of post-quantum schemes such as those based on the Module Learning With Erro…
Bounded-degree Low Rank Parity Check Codes
Ermes Franch, Chunlei Li
Low-rank parity-check (LRPC) codes are the rank-metric analogue of low-density parity-check codes and they found important applications in code-based cryptography. In this paper we…