_:N78acef32532941c58d4242aa614b983e .
"practical cryptographic implications" .
"true"^^ .
.
.
_:N00ad5d4e915c4398a94fe334938edc58 .
_:N66caedef5b024a40b08d9b22c7764abb .
"enemies" .
.
"sequence" .
"cryptographic implications" .
"resources" .
"applications" .
.
"James L." .
_:Nb677ead4bf5f4afb8e835f268192b3a9 .
_:N4d35d7a6a5a24c68af2d9919c6c6fe20 _:N66caedef5b024a40b08d9b22c7764abb .
"https://doi.org/10.1007/0-387-34805-0_11" .
"infinite computational resources" .
"Ueli M." .
"Schnorr" .
"pseudo-random sequences" .
"chapter" .
_:Nb677ead4bf5f4afb8e835f268192b3a9 "Brassard" .
"randomness" .
"cryptographic security" .
.
"Computation Theory and Mathematics" .
"The concept of provable cryptographic security for pseudo-random number generators that was introduced by Schnorr is investigated and extended. The cryptanalyst is assumed to have infinite computational resources and hence the security of the generators does not rely on any unproved hypothesis about the difficulty of solving a certain problem, but rather relies on the assumption that the number of bits of the generated sequence the enemy can access is limited. The concept of perfect local randomness of a sequence generator is introduced and investigated using some results from coding theory. The theoretical and practical cryptographic implications of this concept are discussed. Possible extensions of the concept of local randomness as well as some applications are proposed." .
"difficulties" .
_:Nc489006d72034fdc8d844eb861f55976 "978-0-387-97317-3" .
.
_:Nc489006d72034fdc8d844eb861f55976 "978-0-387-34805-6" .
"bits" .
"https://scigraph.springernature.com/explorer/license/" .
.
_:N78acef32532941c58d4242aa614b983e "Springer Nature" .
.
_:Nd5a231598ee4416381bd508d503f82ed .
_:N00ad5d4e915c4398a94fe334938edc58 "pub.1048976759" .
"results" .
"concept" .
_:Nb2cb6731845b43e6933cca22e7e64025 .
"Institute for Signal and Information Processing, Swiss Federal Institute of Technology, CH-8092, Z\u00FCrich, Switzerland" .
"extension" .
"computational resources" .
"provable cryptographic security" .
"implications" .
"problem" .
_:Nc489006d72034fdc8d844eb861f55976 "Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings" .
"generator" .
_:N78acef32532941c58d4242aa614b983e .
_:Nd5a231598ee4416381bd508d503f82ed .
_:N66caedef5b024a40b08d9b22c7764abb .
"number of bits" .
"number generator" .
_:Nc489006d72034fdc8d844eb861f55976 .
_:Nc489006d72034fdc8d844eb861f55976 .
"Information and Computing Sciences" .
.
"1990" .
"unproved hypothesis" .
_:Nb2cb6731845b43e6933cca22e7e64025 .
.
_:Nb677ead4bf5f4afb8e835f268192b3a9 "Gilles" .
_:N00ad5d4e915c4398a94fe334938edc58 "dimensions_id" .
"Maurer" .
.
"theory" .
"Institute for Signal and Information Processing, Swiss Federal Institute of Technology, CH-8092, Z\u00FCrich, Switzerland" .
_:N3a0b60e117d44c0687c9ff0c9ec30dfa .
.
"1990-01-01" .
"certain problems" .
.
"assumption" .
.
"en" .
"chapters" .
_:N00ad5d4e915c4398a94fe334938edc58 .
_:N3a0b60e117d44c0687c9ff0c9ec30dfa "Springer Nature - SN SciGraph project" .
_:Nb2cb6731845b43e6933cca22e7e64025 "10.1007/0-387-34805-0_11" .
"pseudo-random number generator" .
"local randomness" .
"hypothesis" .
_:N3a0b60e117d44c0687c9ff0c9ec30dfa .
"security" .
.
"possible extensions" .
_:N4d35d7a6a5a24c68af2d9919c6c6fe20 .
"100-112" .
"number" .
.
_:Nd5a231598ee4416381bd508d503f82ed _:Nb677ead4bf5f4afb8e835f268192b3a9 .
"cryptanalyst" .
_:N4d35d7a6a5a24c68af2d9919c6c6fe20 .
"sequence generator" .
"Massey" .
"2022-01-01T19:12" .
.
"perfect local randomness" .
"Perfect Local Randomness in Pseudo-random Sequences" .
_:Nb2cb6731845b43e6933cca22e7e64025 "doi" .