Генератор псеудослучајних бројева (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Генератор псеудослучајних бројева" in Serbian language version.

refsWebsite

Global rank Serbian rank

355^th place

258^th place

2^nd place

4^th place

2web.archive.org

1^st place

1^st place

1khanacademy.org

3,659^th place

1,802^nd place

1,077^th place

3,017^th place

low place

low place

6^th place

5^th place

low place

low place

9,889^th place

low place

8,888^th place

low place

1cryptographyengineering.com

low place

low place

2,092^nd place

6,699^th place

archive.org (Global: 6^th place; Serbian: 5^th place)

Panneton, François; L'Ecuyer, Pierre; Matsumoto, Makoto (2006). „Improved long-period generators based on linear recurrences modulo 2”. ACM Transactions on Mathematical Software. 32 (1): 1—16. doi:10.1145/1132973.1132974.

bund.de (Global: 2,092^nd place; Serbian: 6,699^th place)

bsi.bund.de

Schindler, Werner (2. 12. 1999). „Functionality Classes and Evaluation Methodology for Deterministic Random Number Generators” (PDF). Anwendungshinweise und Interpretationen (AIS). Bundesamt für Sicherheit in der Informationstechnik. стр. 5—11. Архивирано из оригинала (PDF) 19. 01. 2018. г. Приступљено 19. 8. 2013.

cryptographyengineering.com (Global: low place; Serbian: low place)

blog.cryptographyengineering.com

Matthew Green. „The Many Flaws of Dual_EC_DRBG”.

doi.org (Global: 2^nd place; Serbian: 4^th place)

Matsumoto, Makoto; Nishimura, Takuji (1998). „Mersenne twister: a 623-dimensionally equi-distributed uniform pseudo-random number generator”. ACM Transactions on Modeling and Computer Simulation. ACM. 8 (1): 3—30. doi:10.1145/272991.272995.
Panneton, François; L'Ecuyer, Pierre; Matsumoto, Makoto (2006). „Improved long-period generators based on linear recurrences modulo 2”. ACM Transactions on Mathematical Software. 32 (1): 1—16. doi:10.1145/1132973.1132974.

java.net (Global: low place; Serbian: low place)

hg.openjdk.java.net

Random.java at OpenJDK.

jstatsoft.org (Global: low place; Serbian: low place)

Marsaglia, George (2003). „Xorshift RNGs”. Journal of Statistical Software. 8 (14).

khanacademy.org (Global: 3,659^th place; Serbian: 1,802^nd place)

„Pseudorandom number generators”. Khan Academy. Приступљено 11. 1. 2016.

nist.gov (Global: 355^th place; Serbian: 258^th place)

csrc.nist.gov

Barker, Elaine; Barker, William; Burr, William; Polk, William; Smid, Miles (2012). „Recommendation for Key Management” (PDF). NIST Special Publication 800-57. NIST. Приступљено 19. 8. 2013.
„Security requirements for cryptographic modules”. FIPS. NIST. 11. 1. 1994. стр. 4.11.1 Power—Up Tests. Архивирано из оригинала 27. 5. 2013. г. Приступљено 19. 8. 2013.

schneier.com (Global: 8,888^th place; Serbian: low place)

Ferguson, Niels; Schneier, Bruce; Kohno, Tadayoshi (2010). „Cryptography Engineering: Design Principles and Practical Applications, Chapter 9.4: The Generator” (PDF).

unimi.it (Global: 9,889^th place; Serbian: low place)

prng.di.unimi.it

S.Vigna. „xorshift*/xorshift+ generators and the PRNG shootout”.

usc.edu (Global: 1,077^th place; Serbian: 3,017^th place)

dornsifecms.usc.edu

Von Neumann, John (1951). „Various techniques used in connection with random digits” (PDF). National Bureau of Standards Applied Mathematics Series. 12: 36—38.

web.archive.org (Global: 1^st place; Serbian: 1^st place)

Schindler, Werner (2. 12. 1999). „Functionality Classes and Evaluation Methodology for Deterministic Random Number Generators” (PDF). Anwendungshinweise und Interpretationen (AIS). Bundesamt für Sicherheit in der Informationstechnik. стр. 5—11. Архивирано из оригинала (PDF) 19. 01. 2018. г. Приступљено 19. 8. 2013.
„Security requirements for cryptographic modules”. FIPS. NIST. 11. 1. 1994. стр. 4.11.1 Power—Up Tests. Архивирано из оригинала 27. 5. 2013. г. Приступљено 19. 8. 2013.