Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦
ÇѱÛÁ¦¸ñ(Korean Title) |
SDRAMÀ» »ç¿ëÇÑ ³¼ö ¹ß»ý |
¿µ¹®Á¦¸ñ(English Title) |
Random Number Generation using SDRAM |
ÀúÀÚ(Author) |
ǥâ¿ì
Changwoo Pyo
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 16 NO. 04 PP. 0415 ~ 0420 (2010. 04) |
Çѱ۳»¿ë (Korean Abstract) |
º¸¾ÈÀ» À§ÇÑ ¾ÏÈ£ Å°´Â Áø³¼ö ¹ß»ý±â¸¦ »ç¿ëÇÏ¿© ¸¸µé¾î¾ß ÇÑ´Ù. Áø³¼ö ¹ß»ý±â´Â »óÅ ¿¹ÃøÀÌ °ÅÀÇ ºÒ°¡´ÉÇÑ È¥¶õ Áø¿øÁö¿¡¼ ÃʱⰪÀ» ÃßÃâÇÏ¿© ºñ°¡¿ªÀû Çؽà ¾Ë°í¸®ÁòÀ» Àû¿ëÇØ ³¼ö¸¦ ¸¸µé¾î³½´Ù. DRAM Á¢±Ù ´ë±â ½Ã°£(latency)¿¡µµ ºÒ±ÔÄ¢¼ºÀÌ Á¸ÀçÇÏ¿© È¥¶õ Áø¿øÁö ¿ªÇÒÀ» ÇÒ ¼ö ÀÖÀ½ÀÌ ¾Ë·ÁÁ® Àִµ¥, ¿äÁò ³Î¸® »ç¿ëµÇ´Â µ¿±â½Ä DRAM (SDRAM)À» ÀåÂøÇÑ ½Ã½ºÅÛ¿¡¼´Â Á¢±Ù ´ë±â ½Ã°£ÀÇ ºÒ±ÔÄ¢¼ºÀÌ Àß ³ëÃâµÇÁö ¾ÊÀ¸¸ç, ³¼ö ºñÆ® ÆÐÅÏÀÇ ¹¶Ä§ Çö»óÀÌ ½ÉÇØÁø´Ù. ÀÌ ¹®Á¦¸¦ xor ¿¬»êÀ» »ç¿ëÇÏ¿© ÇØ°áÇÏ¿´´Ù. ÀÌ ¹æ¹ýÀ¸·Î ¸¸µç ³¼ö¸¦ Åë°èÇÐÀûÀ¸·Î Æò°¡ÇÏ¿© Áø³¼ö¿¡ ÇÊÀûÇÏ´Â Ç°ÁúÀ» È®ÀÎÇÏ¿´´Ù. ÀÌ¿Í °°Àº ³¼ö ¹ß»ý ¹æ¹ýÀÇ ¼º´ÉÀº 100 Kbits/sec ¼öÁØÀ̸ç, º°µµÀÇ ÀåÄ¡³ª ȸ·Î¸¦ ¿ä±¸ÇÏÁö ¾Ê¾Æ DRAMÀ» ÀåÂøÇÏ°í ÀÖ´Â ¿©·¯ ÇüÅÂÀÇ ÄÄÇ»ÅÍ Àåºñ¿¡¼ »ç¿ë °¡´ÉÇÏ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
Cryptographic keys for security should be generated by true random number generators that apply irreversible hashing algorithms to initial values taken from a random source. As DRAM shows randomness in its access latency, it can be used as a random source. However, systems with synchronous DRAM (SDRAM) do not easily expose such randomness resulting in highly clustered random numbers. We resolved this problem by using the xor instruction. Statistical testing shows that the generated random bits have the quality comparable to true random bit sequences. The performance of bit generation is at the order of 100 Kbits/sec. Since the proposed random number generation requires neither external devices nor any special circuits, this method may be used in any computing device that employs DRAM. |
Å°¿öµå(Keyword) |
¾ÏÈ£ Å°
³¼ö ¹ß»ý
DRAM
Á¢±Ù ´ë±â ½Ã°£
SDRAM
Cryptographic key
random number generation
access latency
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|