RankSynd a PRNG Based on Rank Metric
Philippe Gaborit, Adrien Hauteville, Jean-Pierre Tillich
TL;DR
This paper introduces RankSynd, a new pseudo-random generator based on the rank metric syndrome decoding problem, demonstrating its efficiency and quantum resistance without relying on structured matrices.
Contribution
The paper presents a novel PRNG based on rank metric codes that is fast, requires small public data, and resists quantum attacks, without needing structured matrices.
Findings
Fast PRNG with small public data
Quantum resistance of the rank metric problem
No need for structured matrices like quasi-cyclicity
Abstract
In this paper, we consider a pseudo-random generator based on the difficulty of the syndrome decoding problem for rank metric codes. We also study the resistance of this problem against a quantum computer. Our results show that with rank metric it is possible to obtain fast PRNG with small public data, without considering additional structure for public matrices like quasi-cyclicity for Hamming distance.
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 · Chaos-based Image/Signal Encryption · graph theory and CDMA systems