Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6866
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Srivastava, Abhijit | - |
dc.contributor.author | Singh, Yashwant [Guided by] | - |
dc.date.accessioned | 2022-09-27T04:48:41Z | - |
dc.date.available | 2022-09-27T04:48:41Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6866 | - |
dc.description.abstract | As we all know computer based "von Neumann Architecture" are designed to achieve 100% efficiency, i.e. Generation of any random data states that the computation went wrong. That is why for the generation of random numbers, programmers and mathematicians have been designing complex algorithms with a large period for the generation of pseudo-random numbers. The word ‘pseudo’ means the pseudo-random numbers are not purely random in a way you might expect, at least not if it is compared to dice rolls or lottery tickets. Essentially, pseudo-random numbers generators are algorithms that use some kind of mathematical formula or just a pre-calculated tables to generate sequences of numbers that appear to be randomly generated. An example of a pseudo-random numbers generator can be the linear congruential methodology. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | Number generator | en_US |
dc.subject | Cascade cdonstruction | en_US |
dc.title | Pure Random Number Generator | en_US |
dc.type | Project Report | en_US |
Appears in Collections: | B.Tech. Project Reports |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Pure Random Number Generator.pdf | 1.62 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.