Left ideal LRPC codes and a ROLLO-type cryptosystem based on group algebras
Martino Borello, Paolo Santonastaso, Ferdinando Zullo
TL;DR
This paper introduces a new class of low-rank parity-check codes derived from group algebras and applies them to enhance the ROLLO-I key encapsulation mechanism, aiming for improved cryptographic security.
Contribution
It presents the novel concept of left ideal LRPC codes based on group algebras and extends the ROLLO-I cryptosystem using these codes.
Findings
Introduction of left ideal LRPC codes from group algebras
Extension of ROLLO-I KEM with new codes
Potential for improved cryptographic security
Abstract
In this paper we introduce left ideal low-rank parity-check codes by using group algebras and we finally use them to extend ROLLO-I KEM.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Wireless Communication Techniques · graph theory and CDMA systems