Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Pseudorandom generators and the frequency of simplicity (1996)
    Springer
    Journal of cryptology 9 (1996), S. 251-261 
    Details
    ISSN: 1432-1378
    Keywords: Pseudorandom generator ; Computational complexity ; Kolmogorov complexity ; Injectivity of pseudorandom generators
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Allender [2] showed that if there are dense P languages containing only a finite set of Kolmogorov-simple strings, then all pseudorandom generators are insecure. We extend this by proving that if there are dense P (or even BPP) languages containing only a sparse set of Kolmogorov-simple strings, then all pseudorandom generators are insecure.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00189263
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...