most citedEfficient decoding up to a constant fraction of the code length for asymptotically good quantum codes

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

collaborators
Showing cs.CRShow all

1 paper · 1 filter

cs.CR2022

LRPC codes with multiple syndromes: near ideal-size KEMs without ideals

Carlos Aguilar-Melchor, Nicolas Aragon, Victor Dyseryn +2

We introduce a new rank-based key encapsulation mechanism (KEM) with public key and ciphertext sizes around 3.5 Kbytes each, for 128 bits of security, without using ideal structure…