RankSynd a PRNG Based on Rank Metric - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

RankSynd a PRNG Based on Rank Metric


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.
Fichier principal
Vignette du fichier
Rank_PRNG_finale.pdf (442.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01289338 , version 1 (16-03-2016)



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⟩
386 View
160 Download



Gmail Facebook Twitter LinkedIn More