1. Pseudo Randomness (in digital system) PRESENTED BY GROUP 8 SHU-YU HUANG, FONG-JHENG LIN 12.9.2015

2. 919722885351316053124711931 81542174670263213849423838 606843469380126427698847653 1896629387602526015395295283 37930185349650520307880190566 75860368299210116615736381108 49318334196020233207448762217 98636668389640466414897500435 9487333437688081328297701000870 873442687513592265635517977717

3. Outline  Pseudo randomness  Example: M-Sequence  Application  Summary

4. Pseudo randomness  True RNG (Random Number Generator) Physical Source Sensor, Converter Transformer Numbers Unpredictable Irreproducible coin, dice, human guess, your girlfriend/boyfriend/mom * The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 3rd ed. by Donald E. Knuth. Reading, MA: Addison-Wesley, 1997

5. Pseudo randomness  True RNG (Random Number Generator) Physical Source Sensor, Converter Transformer Numbers Unpredictable Irreproducible quantum phenomena, radioactive decay * The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 3rd ed. by Donald E. Knuth. Reading, MA: Addison-Wesley, 1997

6. Pseudo randomness  Pros & Cons of True RNG ProsCons No periodicitiesSlow UnpredictableIrreproducible no dependencies presentNot portable High level of securityCostly Need no algorithmCould be manipulated * RANDOM.ORG https://www.random.org/

7. Pseudo randomness  Story of Caesar * http://www.mrdowling.com/702-augustus.html X(n)=X(n)+3 A->D B->E C->F ANDY->DQGB

8. Pseudo randomness  Pseudo RNG Seed Function, Algorithm Number Series * The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 3rd ed. by Donald E. Knuth. Reading, MA: Addison-Wesley, 1997 ANDYDQGB X(n)=X(n)+3

9. Pseudo randomness  Pseudo RNG Seed Function, Algorithm Number Series Deterministic Periodic Reproducible testing set, simulation set, gaming parameters * The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 3rd ed. by Donald E. Knuth. Reading, MA: Addison-Wesley, 1997 usually truly random 123 123123 123,312,231,123…

10. Pseudo randomness  Pseudo RNG True Random Number * The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 3rd ed. by Donald E. Knuth. Reading, MA: Addison-Wesley, 1997 Number Pseudo Random Numbers

11. Pseudo randomness  True RNG vs Pseudo RNG (512*512 pixal) * http://boallen.com/ True Pseudo

12. Pseudo randomness * RANDOM.ORG https://www.random.org/

13. Pseudo randomness * NIST (National Institute of Standards and Technology), A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. 2001

14. Pseudo randomness  Frequency test (for pseudorandom number with n bits) * K. M. Ramachandran, C. P. Tsokos, Mathematical Statistics with Applications, 1 st editionpublished by ELSEVIER, 2009

15. Pseudo randomness  Frequency test (for pseudorandom number with n bits) 10101100… 11 11 … * NIST (National Institute of Standards and Technology), A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. 2001

16. Pseudo randomness  Frequency test (for pseudorandom number with n bits) * NIST (National Institute of Standards and Technology), A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. 2001 For computer

17. Example: M-Sequence  Maximum length sequence

18. Example: M-Sequence  Calculation of pi

19. Summary of Pseudorandom Variables  Pros:  Accelerates the generation of patterns  Generate the same results  Cons:  Could be deciphered  Periodic

20. Thanks for your attention!