Predicting masked linear pseudorandom number generators over finite fields

Jaime Gutierrez; Álvar Ibeas; Domingo Gómez-Pérez; Igor E. Shparlinski

doi:10.1007/s10623-012-9615-4

Predicting masked linear pseudorandom number generators over finite fields

Jaime Gutierrez^*, Álvar Ibeas, Domingo Gómez-Pérez, Igor E. Shparlinski

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

We study the security of the linear generator over a finite field. It is shown that the seed of a linear generator can be deduced from partial information of a short sequence of consecutive outputs of such generators.

Original language	English
Pages (from-to)	395-402
Number of pages	8
Journal	Designs, Codes and Cryptography
Volume	67
Issue number	3
DOIs	https://doi.org/10.1007/s10623-012-9615-4
Publication status	Published - Jun 2013

Access to Document

10.1007/s10623-012-9615-4

Cite this

@article{55d2c08e17aa4aec80e0a9cec066fb68,

title = "Predicting masked linear pseudorandom number generators over finite fields",

abstract = "We study the security of the linear generator over a finite field. It is shown that the seed of a linear generator can be deduced from partial information of a short sequence of consecutive outputs of such generators.",

author = "Jaime Gutierrez and {\'A}lvar Ibeas and Domingo G{\'o}mez-P{\'e}rez and Shparlinski, {Igor E.}",

year = "2013",

month = jun,

doi = "10.1007/s10623-012-9615-4",

language = "English",

volume = "67",

pages = "395--402",

journal = "Designs, Codes and Cryptography",

issn = "0925-1022",

publisher = "Springer, Springer Nature",

number = "3",

}

TY - JOUR

T1 - Predicting masked linear pseudorandom number generators over finite fields

AU - Gutierrez, Jaime

AU - Ibeas, Álvar

AU - Gómez-Pérez, Domingo

AU - Shparlinski, Igor E.

PY - 2013/6

Y1 - 2013/6

N2 - We study the security of the linear generator over a finite field. It is shown that the seed of a linear generator can be deduced from partial information of a short sequence of consecutive outputs of such generators.

AB - We study the security of the linear generator over a finite field. It is shown that the seed of a linear generator can be deduced from partial information of a short sequence of consecutive outputs of such generators.

UR - http://www.scopus.com/inward/record.url?scp=84876193365&partnerID=8YFLogxK

U2 - 10.1007/s10623-012-9615-4

DO - 10.1007/s10623-012-9615-4

M3 - Article

AN - SCOPUS:84876193365

SN - 0925-1022

VL - 67

SP - 395

EP - 402

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

IS - 3

ER -

Predicting masked linear pseudorandom number generators over finite fields

Abstract

Access to Document

Other files and links

Fingerprint

Cite this