Pseudorandom Generators Based on One-Way Functions

Shu Jing Gao; Ting Qiang Song; Wei Zhang

doi:10.4028/www.scientific.net/AMM.577.820

Paper Titles

Research of Discrete Curvature Estimation Method Based on Local Space Parabola
p.802

The HIS_MSR Algorithm for Foggy Image Enhancement
p.806

Sub-Optimum Detector Based on Reverbertion-Whiten in FrFT Field
p.810

Active Control Research of SαS Impulse Noise Based on the Nonlinear Transformation
p.816

Pseudorandom Generators Based on One-Way Functions
p.820

A Class of Nonlinear Singular Difference Inequality in Engineering
p.824

Research on General DEA Model Based on the Grey Linear Programming
p.828

230MHz Wireless Communication Network Architecture and Design of Power Consumption Information Collection System Based on WiMAX
p.835

A Gossip-Based AOA Distributed Localization Algorithm for Wireless Sensor Networks
p.841

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 577Pseudorandom Generators Based on One-Way Functions

Pseudorandom Generators Based on One-Way Functions

Abstract:

Pseudorandom Generators is an important notion of cryptography. A new randomized iterating method of one-way function is proposed, after the analyzing of current research on pseudorandom generators based on one-way function. On the basis of this randomized iteration, a pseudorandom generator with linear seeds length is constructed using general regular one-way function and universal hash function. The output sequence of the proposed PRNG is unpredictable and the length of the seeds is linear to the input length of the one-way function.

You might also be interested in these eBooks

Applied Decisions in Area of Mechanical Engineering and Industrial Manufacturing

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 577)

Pages:

820-823

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.577.820

Citation:

Cite this paper

Online since:

July 2014

Authors:

Shu Jing Gao*, Ting Qiang Song, Wei Zhang

Keywords:

One-Way Function, Pseudo-Random Number Generator, Randomized Iterate

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Ishai Y, Kushilevitz E, Li X, et al. Robust pseudorandom generators[M]/Automata, Languages, and Programming. Springer Berlin Heidelberg, 2013: 576-588.

DOI: 10.1007/978-3-642-39206-1_49

Google Scholar

[2] M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo random bits[C]. In 23th Annual Symposium on Foundations of Computer Science, 1982. pages112-117.

DOI: 10.1109/sfcs.1982.72

Google Scholar

[3] A. C. Yao. Theory and application of trapdoor functions[C]. In 23rd IEEE Symposium on Foundations of Computer Science, 1982. pages 80-91.

DOI: 10.1109/sfcs.1982.45

Google Scholar

[4] O. Goldreich, H. Krawczyk, and M. Luby. On the existence of pseudorandom generators[J]. SIAM Journal of Computing, 1993. 22(6): 1163: 1175.

DOI: 10.1137/0222069

Google Scholar

[5] L. A. Levin, One-way functions and pseudorandom generators[J], Combinatorica, 1987. 7: p.357–363.

DOI: 10.1007/bf02579323

Google Scholar