RankSynd a PRNG Based on Rank Metric

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.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-01289338
Contributor : Jean-Pierre Tillich <>
Submitted on : Wednesday, March 16, 2016 - 3:26:00 PM
Last modification on : Thursday, April 26, 2018 - 10:28:12 AM
Long-term archiving on : Sunday, November 13, 2016 - 7:52:09 PM

File

Rank_PRNG_finale.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Philippe Gaborit, Adrien Hauteville, Jean-Pierre Tillich. RankSynd a PRNG Based on Rank Metric. Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016, Feb 2016, Fukuoka, Japan. pp.18-28, ⟨10.1007/978-3-319-29360-8_2⟩. ⟨hal-01289338⟩

Share

Metrics

Record views

419

Files downloads

139