SavedAdd your journal

Journals / Türkiye Bilişim Vakfı Bilgisayar Bilimleri ve Mühendisliği Dergisi / 2015 / Cilt: 8 Sayı: 2

Cryptographic Random Number Generators

Kriptolojik Rasgele Sayı Üreteçleri

Fatih Özkaynak(Fırat Üniversitesi, Yazılım Mühendisliği Bölümü 23119 Elazığ/Türkiye)
Pages
37–45
Publication Date
2016-06-24
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

This paper describes requirements of robust random number generators for cryptographic applications and an architecture to realize these requirements.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Random number generators are an important tool for cryptographic applications.
📊
Key Findings & Data:Therefore, random data generation should take into account the fact that the user can request either high quality random data or a great amount of pseudorandom data.
💡
Conclusion & Impact:This paper describes requirements of robust random number generators for cryptographic applications and an architecture to realize these requirements.
🔬Design:Makale
📍Scope:Comprehensive Sample
⚙️Variables:Kriptoloji · Rasgele sayı üreteci · Cryptography

Abstract

Random number generators are an important tool for cryptographic applications. Since inadequate source of randomness can be effect security of whole system. The frequency and the amount of required random data can differ greatly with the application. Therefore, random data generation should take into account the fact that the user can request either high quality random data or a great amount of pseudorandom data. There are several types of random number generators. This paper describes requirements of robust random number generators for cryptographic applications and an architecture to realize these requirements.

Özet

Rasgele sayı üreteçleri kriptolojik uygulamalar için önemli bir araçtır. Çünkü rasgelelik kaynağının yetersizliği tüm sistemin güvenliğini etkileyebilmektedir. Gerekli rasgele verinin frekansı ve miktarı uygulama ile büyük farklılık gösterebilmektedir. Bu yüzden kullanıcının ya yüksek kalitede rasgele veri ya da çok büyük miktarda sözde rasgele veri üretmek isteyebileceği hesaba katılmalıdır. Rasgele sayı üreteçlerinin çeşitli tipleri bulunmaktadır. Bu çalışmada kriptolojik uygulamalar için gürbüz rasgele sayı üreteçlerinin gereksinimlerini ve bu gereksinimleri gerçekleştirecek mimari tanımlanmıştır.

🔖

Cite This Article

Özkaynak, F. (2016). Cryptographic Random Number Generators. Türkiye Bilişim Vakfı Bilgisayar Bilimleri ve Mühendisliği Dergisi, Cilt: 8 Sayı: 2, 37–45. https://ajindex.com/articles/1561324

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (19)

  1. Katz J., Lindell Y. Introduction to modern cryptography: principles and protocols, Chapman & Hall. (2008).
  2. Paar C., Pelzl J., Understanding Cryptography A Textbook for Student and Practitioners, Springer. (2010).
  3. Koç Ç. K., Cryptographic Engineering, Springer-Verlag. (2009).
  4. Menezes A. J., Oorschot P. C., Vanstone S. A. Handbook of Applied Cryptography. CRC Press, Boca Raton (1997).
  5. Özkaynak F., Cryptographically secure random number generator with chaotic additional input, Nonlinear Dynamics (2014) 78 pp. 2015–2020.
  6. Lagarias J. C., Pseudorandom Number Generators in Cryptography and Number Theory. Proc. Symp. Appl. Math., 42: 1990, pp. 115–143,
  7. AIS 20. Functionality Classes and Evaluation Methodology for Deterministic Random Number Generators.
  8. AIS 31. Functionality Classes and Evaluation Methodology for Physical Random Number Generators. Security 9. NIST. Requirements for Cryptographic Modules. FIPS PUB 140-2.
  9. Marsaglia G. Diehard (Test Suite for Number http://www.stat.fsu.edu/pub/die hard/ Generators).
  10. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST Special Publication 800–22rev1a (2010).
  11. Knuth, D. 1981. The Art of Computer Programming, Vol. 2, Seminumerical Algorithms. 2nd ed. Addison-Wesley: Reading, Massachusetts.
  12. Ripley, B. 1983. Computer Generation of Variables: Random International Statistical Review. 51: 301- 319. A Tutorial.
  13. L'Ecuyer, P. 1990. Random Numbers for Simulation. Communications of the ACM. 33(1): 85-97.
  14. James, F. 1990. A review of pseudorandom number generators. Computer Physics Communications. 60: 329-344. North-Holland.
  15. Lagarias, J. 1990. Pseudorandom Number Generators in Cryptography and Number Theory. Proceedings of Symposia in Advanced Mathematics. 42: 115-143.
  16. Zeng, K., C. Yang, D. Wei and T. Rao. 1991. Pseudorandom Bit Generators in Stream-Cipher Cryptography. IEEE Computer. February. 8-17.
  17. Ritter, T. 1991. The Efficient Generation of Cryptographic Confusion Sequences. Cryptologia. 15(2): 81-13
  18. Katz J., Lindell Y. Introduction to modern cryptography: principles and protocols, Chapman & Hall. (2008).
  19. Menezes A. J., Oorschot P. C., Vanstone S. A. Handbook of Applied Cryptography. CRC Press, Boca Raton (1997).