Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient Parallel Pseudorandom Number Generation

From MaRDI portal
Publication:3787921
Jump to:navigation, search

DOI10.1137/0217024zbMath0644.94019OpenAlexW2009971409MaRDI QIDQ3787921

J. D. Tygar, John H. Reif

Publication date: 1988

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0217024


zbMATH Keywords

randomized parallel algorithmparallel algorithmpseudorandom number generationcomplexity theoryRNCMultiplicative Inverse Problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Parallel numerical computation (65Y05) Random number generation in numerical analysis (65C10)


Related Items (2)

Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions




This page was built for publication: Efficient Parallel Pseudorandom Number Generation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3787921&oldid=17347598"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 14:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki