Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Provably Secure Pseudo-Random Generators
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2013 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This report is a literary study on provably secure pseudo-random generators. In the report we explain what provably secure pseudo-random generators are and what they are most commonly used for. We also discuss one-way functions which are closely related to our subject. Furthermore, two well-known generators are described and compared, one generator by Blum and Micali, and one by Blum, Blum and Shub. What we have concluded is that the x

2 mod N generator by Blum, Blum and Shub seems to be the better one concerning speed, security and application areas. You will also be able to read about how the Blum-Blum-Shub generator can be implemented and why we believe that implementation is suitable.

Abstract [sv]

Den här rapporten är en litteraturstudie om bevisbart säkra pseudo-slumpmässiga generatorer. I rapporten förklarar vi vad bevisbart säkra pseudo-slumpmässiga generatorer är och vad de vanligtvis används till. Vi tar dessutom upp envägsfunktioner som är starkt kopplat till vårt ämne. Vidare beskrivs och jämförs två kända sådana generatorer, en generator av Blum och Micali och en generator av Blum, Blum och Shub. Den slutsats som vi kommit fram till är att x

2 mod N generatorn av Blum, Blum och Shub verkar vara den bättre utav dem vad gäller hastighet, säkerhet och applikationsområden. Ni kommer även kunna läsa om hur en sådan generator kan implementeras och vi förklarar varför den presenterade koden är bra.

Place, publisher, year, edition, pages
2013.
Series
Kandidatexjobb CSC, K13007
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-134830OAI: oai:DiVA.org:kth-134830DiVA: diva2:668253
Educational program
Master of Science in Engineering - Computer Science and Technology
Supervisors
Examiners
Available from: 2013-12-13 Created: 2013-11-29 Last updated: 2013-12-13Bibliographically approved

Open Access in DiVA

Provably Secure Pseudo-Random Generators(411 kB)712 downloads
File information
File name FULLTEXT01.pdfFile size 411 kBChecksum SHA-512
26d1f155a4a1d82951782e79ef0e1f01cac4b5fb2d158be2c3dcb4945303295a556324200015ab5db6f009d7478bc790fec86652f08b96941d028c02c733d1d4
Type fulltextMimetype application/pdf

Other links

http://www.csc.kth.se/utbildning/kth/kurser/DD143X/dkand13/Group2Douglas/report/agerblad_andersen.pdf
By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 712 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 351 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf