A random number generator using ring oscillators and the Keccak as post-processing

• Autorzy: Łoza S. , Matuszewski Ł. , Jessa M. , Kubczak P.
• Języki publikacji: EN

Abstrakty

EN

In cryptography, sequences of numbers with unpredictable elements are often required. Such sequences should pass all known statistical tests for random sequences. Because sequences produced in real circuits are biased, they do not pass many statistical tests, e.g., the distribution of numbers is not uniform. Such random number sequences should be subjected to a transformation called post-processing. In this paper, a true random number generator is considered. It uses ring oscillators and the Keccak hash function as post-processing. This paper presents only simulation conditions for this approach since the post-processing part was done using x86 architecture on a PC.

Słowa kluczowe

EN

true random number generator; ring oscillator; cryptography; field programmable gate array (FPGA); hash function

• Wydawca: Wydawnictwo PAK
• Czasopismo: Measurement Automation Monitoring
• Rocznik: 2015
• Tom: Vol. 61, No. 7
• Strony: 290--292
• Opis fizyczny: Bibliogr. 18 poz., rys., schem., tab.

Twórcy

autor

Łoza S.

• Poznan University of Technology, Faculty of Electronics and Ttelecommunications, 3 Polanka St., 61-131 Poznań

autor

Matuszewski Ł.

• Poznan University of Technology, Faculty of Electronics and Ttelecommunications, 3 Polanka St., 61-131 Poznań

autor

Jessa M.

• Poznan University of Technology, Faculty of Electronics and Ttelecommunications, 3 Polanka St., 61-131 Poznań

autor

Kubczak P.

• Poznan University of Technology, Faculty of Electronics and Ttelecommunications, 3 Polanka St., 61-131 Poznań

Bibliografia

• [1] Menezes A. J., van Oorschot P. C., and Vanstone S. C.: Handbook of Applied Cryptography. Boca Raton: CRC, 1997.
• [2] Sunar B., Martin W. J., and Stinson D. R.: A provably secure true random number generator with built-in tolerance to active attacks. IEEE Trans., Comput., vol. 56, pp. 109-119, Jan. 2007.
• [3] Wieczorek P., Golofit K.: Dual-Metastability Time-Competitive True Random Number Generator. IEEE Trans. On Circuits and Systems, v. 61, I. 1, pp. 134-145 (2014).
• [4] Wold K. and Petrović S.: Security properties of oscillator rings in true random number generators. In Proc. of 15th International Symposium on Components, Circuits, Devices and Systems, pp. 145-150, 2012.
• [5] Valtchanov B., Aubert A., Bernard F., and Fischer V.: Modeling and observing the jitter in ring oscillators implemented in FPGAs. In Proc. of IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems, DDECS’08, pp. 1-6, 2008.
• [6] Güler Ü., Ergün S., and Dündar G.: A digital IC random number generator with logic gates only. Proc. of 17th IEEE International Conference on Electronics, Circuits, and Systems (ICECS), Dec. 2010, pp. 239-242.
• [7] Jessa M. and Matuszewski L.: Producing random bits with delay-line-based ring oscillators. Int. Journal of Electronics and Telecommunications, vol. 59, No. 1, pp. 41-50, 2013.
• [8] Sunar B., Martin W. J., and Stinson D. R.: A provably secure true random number generator with built-in tolerance to active attacks. IEEE Trans., Comput., vol. 56, pp. 109-119, Jan. 2007.
• [9] Wold K. and Tan C. H.: Analysis and enhancement of random number generator in FPGA based on oscillator rings. Int. J. of Reconfiugurable Computing, vol. 2009, pp. 1-8, 2009.
• [10] Jessa M. and Jaworski M.: Randomness of a combined RBG based on the ring oscillator sampling method. Proc. of International Conference on Signals and Electronic Systems, ICSES’10, pp. 323-326, 2010.
• [11] Markettos A. T. and Moore S. M.: The frequency injection attack on ring-oscillator-based true random number generators. In Proc. Workshop Cryptograph. Hardware Embed. Syst. CHES’2009, Sept., 2009, LNCS 5747, pp. 317-331.
• [12] Jessa M.: On the Quality of Random Sequences Produced with a Combined Random Bit Generator. IEEE Transactions on Computers, Vol. 64, No. 3, March 2015, pp. 791-804.
• [13] Bucci M. and Luzzi R.: Fully digital random bit generators for cryptographic applications. IEEE Trans. Circuits and Syst. I: Regular Papers, vol. 55, pp. 861-875, April 2008.
• [14] Łoza Sz., Matuszewski Ł., Jessa M.: A Random Number Generator Using Ring Oscillators and SHA-256 as Post-Processing. Int. Journal of Electronics and Telecommunications, vol. 61, No. 2, pp. 199-204.
• [15] Bertoni G., Daemen J., Peeters M., Van Assche G.: Keccak sponge function family main document. Available at: http://keccak. noekeon.org/Keccak-main-2.1.pdf.
• [16] Bertoni G., Daemen J., Peeters M., Van Assche G.: Cryptographic sponge functions. Available at: http://sponge.noekeon.org/.
• [17] 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-22, Revised: April 2010, Available at: http://csrc.nist.gov/rng/.
• [18] Krishna Dahal R., Bhatta J., Nath Dhamala T. L Performance Analysis of SHA-2 and SHA-3 finalists. International Journal on Cryptography and Information Security, Vol.3, No. 3, September 2013.