RankSynd a PRNG Based on Rank Metric release_kfftjkzb3zexjo36iwmhaanjle

by Philippe Gaborit, Adrien Hauteville, Jean-Pierre Tillich

Released as a article .

2016  

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.
In text/plain format

Archived Files and Locations

application/pdf  207.0 kB
file_6vutb55f4bhfna4r2246semc2e
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-03-16
Version   v1
Language   en ?
arXiv  1603.05128v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 01a70ba1-ef5f-4326-8cdf-66e1f49c6264
API URL: JSON