
	Where results make sense

Topic: PRNG

Related Topics

Hardware random number generator

Mersenne twister

Blum Blum Shub

Cryptology

Books on cryptography

List of open problems in computer science

List of cryptographers

Ciphertext

Autokey cipher

Microsoft Internet Explorer

Topics in cryptography

Permutation cipher

CBC

List of cryptography topics

TKO

	PRNGD - Pseudo Random Number Generator Daemon
		Unlike EGD it does not generate a pool of random bits that can be called from other software.
		Rather more it feeds the bits gathered into the OpenSSL PRNG from which the "random bits" are obtained when requested.
		This way, PRNGD is never drained and can never block (unlike EGD), so it is also suitable to seed inetd-started programs.
	prngd.sourceforge.net (211 words)

	pseudo-random number generator
		A pseudo-random number generator, or PRNG, is a random number generator that produces a sequence of values based on a seed and a current state.
		The seed of a PRNG is analogous to a key of a cipher.
		The discovery of a PRNG's seed is analogous to the discovery of a cipher's key.
	www.lavarnd.org /faq/prng.html (264 words)

	[No title]
		The PRNG (implemented in source code file crypto/md_rand.c) uses a hash function, by default SHA-1, to update its internal secret state and to generate output.
		Also the number of bytes used from 'state' depended on the number of bytes requested as PRNG output and could be as small as one, allowing for easy brute-force analysis of all possible cases.
		When updating 'md' during PRNG output generation, all of the previous 'md' value is hashed, including the secret half.
	www.openssl.org /news/secadv_prng.txt (800 words)

	PRNG - Bots-United Wiki (Site not responding. Last check: )
		The standard PRNG used in most C/C++ programs is the one provided in the standard C library (defined in cstdlib).
		This means that this PRNG is unable to generate random numbers wider than 15 bits.
		Because PRNG is just ugly math stuff which returns the same sequence of "random" numbers, we must somehow change the starting point of generation, so we do not get same numbers every time we launch the program.
	wiki.bots-united.com /index.php?title=PRNG&redirect=no (770 words)

	pseudo-random number generator
		There exist PRNG's such as the Blum-Blum-Shub PRNG that have been proved to be cryptographically strong.
		The seed of a PRNG is analogous to a key of a cipher.
		The discovery of a PRNG's seed is analogous to the discovery of a cipher's key.
	lavarnd.org /faq/prng.html (264 words)

	[No title] (Site not responding. Last check: )
		PRNG can view all types of files but supports only txt, bmp and jpg in their native format.
		PRNG is designed to look at the digital bits themselves.
		PRNG also has three different compression engines which can be used to compress files.
	home.earthlink.net /~sroof/software/prng.txt (477 words)

	Whitepaper - Pseudo Random Number Generators
		PRNG needs a seed, or a key, as a input and then produces a stream of bits or numbers determined completely by the seed.
		Internally, a PRNG needs to have a mechanism for processing unpredictable samples, a mechanism for using those samples to update its internal state or its seed, and a mechanism to use some part of its internal state or its seed to generate pseudorandom outputs.
		State compromise extension attack succeeds when the attacker is able to recover unknown PRNG outputs from before internal state was compromised, or recover outputs from after the PRNG collected a sequence of inputs which the attacker cannot guess.
	www.ee.oulu.fi /research/ouspg/frontier/sota/whitepaper-prng (5523 words)

	SURE -- Tom Rogers Research Experience
		PRNG are used in large scale Monte Carlo simulations, such as, simulating the random motion of oxygen molecules diffusing through plastic food packaging.
		PRNGs have been used in cell phone wireless communication systems to help prevent eavesdropping and noise interference.
		The Java PRNG is not considered an excellent PRNG but was used as a useful starting point.
	www.clemson.edu /sure/2003/trogers/trogers2.htm (1123 words)

	linux, säkerhet
		The PRNG (implemented in source code file crypto/md_rand.c) uses a hash function, by default SHA-1, to update its internal secret state and to generate output.
		Also the number of bytes used from 'state' depended on the number of bytes requested as PRNG output and could be as small as one, allowing for easy brute-force analysis of all possible cases.
		The combination of these effects made it possible to reconstruct the complete internal PRNG state from the output of one PRNG request appropriately sized to gain knowledge on 'md' followed by enough consecutive 1-byte PRNG requests to traverse all of 'state'.
	www.lysator.liu.se /~kjell-e/tekla/linux/security/bugtraq/2001/juli/openssl-prng-2001-07.html (1003 words)

	15 Seconds : An Examination of Visual Basic's Random Number Generation
		PRNG is not a new Visual Basic statement, feature, referenced class, nor a new kind of potato chip.
		Although PRNG applications are not central to this article, it may help you determine likely places to look in your VB code for PRNGs.
		PRNGs are also used to generate random data when wiping a hard drive of sensitive data.
	www.15seconds.com /issue/051110.htm (3132 words)

	Advisory: OpenSSL 0.9.6a and earlier contain flaw in PRNG [REVISED]
		Problem Description A flaw in the pseudo-random number generator (PRNG) of OpenSSL versions previous to 0.9.6b allows an attacker to determine the PRNG state and future output under certain restricted conditions, thereby weakening the strength of the PRNG and any cryptographic protection which is derived from it.
		In effect, the flaw is that a portion of the PRNG state is incorrectly used as the PRNG output, allowing attackers to gain knowledge of the internal state of the PRNG by observing the output if they can sample it in a certain way.
		Impact By successfully exploiting a flaw in the PRNG, an attacker can gain important information that may allow him to deduce nonces (leading to the compromise of the protocol session) or encryption keys (allowing the attacker to obtain the plaintext of the encrypted data).
	www.securityfocus.com /advisories/3475 (607 words)

	Yarrow PRNG - Press Release
		This new pseudo-random number generator (PRNG), named Yarrow, is the result of several years' extensive research by the Counterpane team into the design and use of PRNGs.
		PRNGs are cryptographic algorithms used by information security systems to generate numbers that must appear random in cryptographic systems.
		The Counterpane team applied the results of their years of research as well as their expertise in cryptography to the design of Yarrow, a new PRNG superior to the past ad hoc PRNGs which have been easily compromised.
	www.schneier.com /yarrow-pressrel.html (635 words)

	Yarrow
		A PRNG is the unsexy part of a cryptographic system.
		When a couple of Berkeley students broke the security on Netscape Navigator, it was the PRNG they broke.
		Yarrow is a PRNG; it generates cryptographically secure pseudorandom numbers on a computer.
	www.schneier.com /yarrow.html (335 words)

	SecureRandom (Java 2 Platform SE v1.4.2)
		Additionally, SecureRandom must produce non-deterministic output and therefore it is required that the seed material be unpredictable and that output of SecureRandom be cryptographically strong sequences as described in RFC 1750: Randomness Recommendations for Security.
		Generates a SecureRandom object for the specified PRNG algorithm, as supplied from the specified provider, if such a PRNG implementation is available from the provider.
		If the PRNG is not available in the default package, other packages are searched.
	java.sun.com /j2se/1.4.2/docs/api/java/security/SecureRandom.html (1162 words)

	Cryptography (Site not responding. Last check: )
		In cryptography, PRNG's are used to construct session keys and stream ciphers.
		We derive an equivalent characterization of PRNG's to that of Yao that is easier to work with.
		Hardcore bits can be used to construct PRNGs using a method due to Blum and Micali.
	rooster.stanford.edu /~ben/crypto/prng.html (206 words)

	SSLeay 0.9.0b docs (Site not responding. Last check: )
		It should be noted that this PRNG is intended to be used to generate 'random' keys for various ciphers including generation of DH and RSA keys.
		If the PRNG is being used to generate 4096 bit RSA keys, 2 2048 bit random strings are required (at a minimum).
		When using data to seed the PRNG state, the data used should not be extractable from the PRNG state.
	www.umich.edu /~x509/ssleay/rand-design.html (681 words)

	IRandom (I2P)
		Instead a clone of an already initialised PRNG, that uses and underlying symmetric key block cipher, is another instance with a clone of the same cipher that operates with the same block size but without any knowledge of neither key material nor key size.
		Supplement, or possibly replace, the random state of this PRNG with a random byte.
		Supplement, or possibly replace, the random state of this PRNG with a sequence of new random bytes.
	www.i2p.net /javadoc/gnu/crypto/prng/IRandom.html (622 words)

	Konton2
		The PRNG could be seen as having two blocks of state data with two separate next-state functions.
		As outlined above (in Description of Konton2's PRNG), the most likely attack against Konton2 seems to be an attack on the non-linear function which updates the parts of the state data used for internal feedback and output.
		The tests are mostly byte-oriented because the PRNGs I was most interested in testing produce their output as bytes.
	www.geocities.com /da5id65536 (5419 words)

	Manpage of IPSEC_PRNG (Site not responding. Last check: )
		It is the user's responsibility to initialize a PRNG before using it, and not to use it again after it is closed down.
		Prng_init initializes, or re-initializes, the specified prng from the key, whose length is given by keylen.
		If such keys are used, the first few hundred pseudo-random bytes from each PRNG should be discarded, to give the PRNGs a chance to randomize their innards properly.
	www.freeswan.org /freeswan_trees/freeswan-2.06/doc/manpage.d/ipsec_prng_final.3.html (447 words)

	Security of Random Number Generation: An Annotated Bibliography
		Furthermore, it concludes it is not sufficient for a PRNG just to pass a variety of statistical tests, because the output of the generator may still be predictable.
		The paper identifies that many traditional PRNGs do not produce random numbers in a uniform distribution. However, by adding enough random variants, whether or not they are independent, the random variants sum will converge to a uniform distribution.
		PRNG designers must be extremely careful to use uniform algorithms, and ungues sable, large seeds.
	www.cs.virginia.edu /~rjg7v/annotated.html (3722 words)

	Letter to the Editor
		Typically a PRNG consists of four or five lines of code while the rest of the simulator functions such as scheduling future events and mimicking the operation of a complex system with dozens of queues taking up the vast majority of the processing time.
		When the PRNG cycles an identical random number stream is generated but this in and of itself is not sufficient to produce correlations with previous cycles.
		At the beginning of the next PRNG cycle, the chances that all queues are empty and in exactly the same state is infinitesimally small.
	www.comsoc.org /ci1/Public/2003/Mar/cileted.html (1681 words)

	Dr. Dobb's \| Randomness and the Netscape Browser \| July 22, 2001
		Since the function used by the PRNG to turn a seed into a pseudorandom number sequence is assumed to be known, a smaller set of possible seeds yields a correspondingly small set of sequences produced by the PRNG.
		If the seed values for the PRNG can easily be guessed, the level of security offered by the program is diminished significantly, since it requires less work for an attacker to decrypt an intercepted message.
		The method Netscape uses to seed its PRNG is shown in pseudocode in Figure 2.
	www.ddj.com /184409807 (2634 words)

	Mersenne Twist PRNG (Site not responding. Last check: )
		A number of implementations of the MT PRNG exist, in a number of languages.
		In addition to the PRNG code, my package also includes code to generate random variates following a number of common distributions (uniform, normal, lognormal, exponential, Erlang, Weibull, triangular, and empirical).
		Second, the PRNG state can be saved to a file (in ASCII) and restored later.
	www.cs.hmc.edu /~geoff/mtwist.html (505 words)

	853: OpenSSL PRNG Information Disclosure (Site not responding. Last check: )
		OpenSSL's PRNG (located in crypto/md_rand.c in the source) uses a hash function to update its internal secret state and to generate output.
		Unfortunately, in vulnerable versions, the half of "md" input passed to the hash function is the same half that's used as PRNG output.
		The combination of these effects made it possible to reconstruct the complete internal PRNG state from the output of one PRNG request appropriately sized to your hash function (to gain knowledge of "md") followed by enough consecutive 1-byte PRNG requests to traverse all of "state".
	osvdb.org /displayvuln.php?osvdb_id=853 (485 words)

	Math::Random::MT::Auto
		There is a functional interface to a single, standalone PRNG, and an OO interface (based on the inside-out object model as implemented by the Object::InsideOut module) for generating multiple PRNG objects.
		With no options, the PRNG is seeded using the default sources that were determined when the module was loaded, or that were last supplied to the "srand" subroutine.
		Sets a PRNG to the state contained in an array or array reference containing the state previously obtained using "get_state".
	cpan.uwinnipeg.ca /htdocs/Math-Random-MT-Auto/Math/Random/MT/Auto.html (4078 words)

	[No title] (Site not responding. Last check: )
		Thus, if the data at buf are unpredictable to an adversary, this increases the uncertainty about the state and makes the PRNG output less predictable.
		The seed values cannot be recovered from the PRNG output.
		On systems that provide /dev/urandom, the randomness device is used to seed the PRNG transparently.
	www.ibiblio.org /gferg/ldp/man/man3/RAND_add.3ssl.html (357 words)

	Ocotillo PRNG
		The Ocotillo PRNG is an attempt to create a cryptographically strong pseudo-random number generator for Unix implementations that do not have one.
		This PRNG, therefore, siphons what few sources of randomness are possible under "pure" Unix and uses proven crytographic components to combine them and produce a (hopefully unpredictable) output.
		The naming is in honor of the tradition of naming PRNG's after plants, and because ocotillo is a fascinating plant of the Sonoran Desert where Enhanced Software Technologies Inc. is located.
	twofish-py.sourceforge.net /ocotillo.html (417 words)

	[No title]
		The outputs of a PRNG are typically deterministic functions of the seed; i.e., all true randomness is confined to seed generation.
		Seed of a PRNG The PRNG needs a source of randomness that can provide it with an initial value (also called as a seed) to work with.
		Random Seed in DSA PRNG This PRNG uses a state register to keep a current state variable, and uses newly generated output and current state to get the next state.
	acc6.its.brooklyn.cuny.edu /~qsun/cg/tp/PRNG.doc (4898 words)

	Security Forums :: View topic - fighting entropy hunger (Of a PRNG)
		The PRNG is, basically, Fortuna as described in "Practical Cryptography".
		Cryptographically secure pseudorandom number generators (PRNGs) are deterministic functions that are designed generate numbers that are indistinguishable from random numbers, assuming certain limits on the resources of an adversary.
		However, that would mean that you would basically be using the PRNG as a one-time pad, so you would be required to never reuse your PRNG algorithm, and to keep it a secret.
	www.security-forums.com /viewtopic.php?p=257996 (1623 words)

Try your search on: Qwika (all wikis)