Show simple item record

dc.contributor.authorFranch, Ermes
dc.contributor.authorGaborit, Philippe
dc.contributor.authorLi, Chunlei
dc.date.accessioned2024-08-12T08:51:16Z
dc.date.available2024-08-12T08:51:16Z
dc.date.created2024-01-11T16:05:34Z
dc.date.issued2023
dc.identifier.isbn979-8-3503-0149-6
dc.identifier.issn2475-4218
dc.identifier.urihttps://hdl.handle.net/11250/3145745
dc.description.abstractIn this work we propose a family of Fq-linear lowrank parity check (LRPC) codes based on a bilinear product over Fmq defined by a generic 3-tensor over Fq. A particular choice of this tensor corresponds to the classical Fqm-linear LRPC codes; and other tensors yield Fq-linear codes, which, with some caveats, can be efficiently decoded with the same idea of decoding LRPC codes. The proposed codes contribute to the diversity of rank metric codes for cryptographic applications, particularly for the cases where attacks utilize Fqm-linearity to reduce decoding complexity.en_US
dc.language.isoengen_US
dc.publisherIEEEen_US
dc.titleGeneralized low rank parity check codesen_US
dc.typeJournal articleen_US
dc.description.versionacceptedVersionen_US
dc.rights.holderCopyright 2023 IEEEen_US
cristin.ispublishedtrue
cristin.fulltextpostprint
dc.identifier.doi10.1109/ITW55543.2023.10160243
dc.identifier.cristin2224878
dc.source.journal2023 IEEE Information Theory Workshop (ITW)en_US
dc.relation.projectNorges forskningsråd: 311646en_US
dc.identifier.citationIn: 2023 IEEE Information Theory Workshop (ITW)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record