A Note on Yao’s Theorem About Pseudo-Random Generators

Cryptography and Communications - United States
doi 10.1007/s12095-011-0047-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On Improving Pseudo-Random Number Generators

English

Evaluation of Splittable Pseudo-Random Generators

Journal of Functional Programming
Software
2015English

Pseudo-Random Sequence Generators Using Structured Noise

1990English

How to Strengthen Pseudo-Random Generators by Using Compression

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Pseudo-Random Number Generators and an Improved Steganographic Algorithm

English

Efficient Amplification of the Security of Weak Pseudo-Random Function Generators

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2003English

Using Hadamard Transform for Cryptanalysis of Pseudo-Random Generators in Stream Ciphers

EAI Endorsed Transactions on Energy Web
ControlSystems EngineeringInformation SystemsEnergy EngineeringMarketingSustainabilityRenewable EnergyPower Technologythe Environment
2018English

A Note on Maurin’s Theorem

Atti della Accademia Nazionale dei Lincei, Classe di Scienze Fisiche, Matematiche e Naturali, Rendiconti Lincei Matematica E Applicazioni
Mathematics
2010English

On Pseudo-Random Oracles

Tatra Mountains Mathematical Publications
Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy