 |
Free and accessible knowledge |
Conference papers
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.
Cited literature [29 references]
https://hal.inria.fr/hal-01289338
Contributor : Jean-Pierre Tillich Connect in order to contact the contributor
Submitted on : Wednesday, March 16, 2016 - 3:26:00 PM
Last modification on : Thursday, February 3, 2022 - 11:14:22 AM
Long-term archiving on: : Sunday, November 13, 2016 - 7:52:09 PM
Contributor : Jean-Pierre Tillich Connect in order to contact the contributor
Submitted on : Wednesday, March 16, 2016 - 3:26:00 PM
Last modification on : Thursday, February 3, 2022 - 11:14:22 AM
Long-term archiving on: : Sunday, November 13, 2016 - 7:52:09 PM
File
Rank_PRNG_finale.pdf
Files produced by the author(s)