CUI Lahore Repository

Analysing Security of Pseudorandom Sequences under Computational Constraints

Show simple item record

dc.contributor.author Nazir, Amna
dc.date.accessioned 2022-08-22T09:46:40Z
dc.date.available 2022-08-22T09:46:40Z
dc.date.issued 2022-07-22
dc.identifier.uri http://repository.cuilahore.edu.pk/xmlui/handle/123456789/3451
dc.description.abstract In this thesis, we evaluated Pseudo Random Number Generators (PRNGs) on the basis of a test called Next Bit Test (NBT). To see if a PRNG is suitable for specific purpose, we tested it to see the results. On testing various PRNGs, we got different results that are being discussed in detail. On the basis of our analysis on different PRNGs, we recommend the Logged Fibonacci generator extended to the subtract and borrow generator that holds the properties of NBT and is acceptable to be used in cryptography. en_US
dc.language.iso en en_US
dc.publisher Mathematics COMSATS University Islamabad Lahore Campus en_US
dc.relation.ispartofseries 7657;SP20-RMT-037
dc.subject evaluated Pseudo Random Number Generators en_US
dc.title Analysing Security of Pseudorandom Sequences under Computational Constraints en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

  • Thesis - MS / PhD
    This collection containts the Ms/PhD theses of the studetns of Mathematics Department

Show simple item record

Search DSpace


Advanced Search

Browse

My Account