Middle Square Method Analysis of Number Pseudorandom Process
Random numbers can be generated from a calculation of mathematical formulas. Such random numbers are often referred to as pseudo random numbers, random numbers are used for various algorithms, especially cryptographic algorithms such as AES, RSA, IDEA, GOST that require the use of Middle-Square Method random numbers which is very useful for adding research references to algorithms concerning random number generator and better understand how random numbers are generated using the Middle-Square Method algorithm. Both data collection and report making as for the objectives achieved in the form of understanding random numbers and knowing the algorithm process, compile a program designed to be used as an alternative to random numbers for various purposes, especially in cryptographic algorithms.
Article MetricsAbstract View: 155 times | PDF View: 35 times
Yosua P.W Simare mare ,”Middle Square Method ”, Penerbit Andi, Jogyakarta, Edisi II, 2013.
Primananda Arif Aditya,” Dasar-dasar Pemrograman Database Destop dengan Visual Net C ++ 2008”, Penerbit PT. Elex MediA Komputino, Jakarta 2013.
Wikipedia, The Free Encyclopedia [Online],Available :http://en.wikipedia.org John von Neuman.
Abdul Kadir ( 2003 : 12 )
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Middle Square Method Analysis of Number Pseudorandom Process
- There are currently no refbacks.
Copyright (c) 2020 The IJICS (International Journal of Informatics and Computer Science)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
The IJICS (International Journal of Informatics and Computer Science)
Published by STMIK Budi Darma.
Jl. Sisingamangaraja No.338 Simpang Limun, Medan, North Sumatera
This work is licensed under a Creative Commons Attribution 4.0 International License.