Àüü 4 page Áß 1 page±îÁö ¹Ì¸®º¸±â°¡ °¡´ÉÇÕ´Ï´Ù.
¼Ò°³±Û
Á¦¸ñ : ÆÛÁñ ÀÎÁõ ÇÁ·ÎÅäÄÝÀ» ÀÌ¿ëÇÑ DRM ½Ã½ºÅÛ¿¡ °üÇÑ ¿¬±¸
ÀúÀÚ : Á¤¿ëÈÆ, À̱¤Çü, ¹Î¼Ò¿¬, Àü¹®¼®
¹ßÇàÇÐȸ : Çѱ¹»êÇбâ¼úÇÐȸ [The Korea Academia-industrial cooperation Society]
¹ßÇàÁ¤º¸ : Ãá°è Á¦ 0±Ç 0È£ pp.199-202(4 pages)
¹ßÇà³âµµ : 2007
ÀúÀ۽ñâ : 2007³â
¸ñÂ÷
¿ä¾à
Abstract
¥°. ¼·Ð
¥±. °ü·Ã¿¬±¸
¥². Á¦¾ÈÇÏ´Â ½Ã½ºÅÛ
¥³. ½ÇÇèÆò°¡
¥´. °á·Ð
Âü°í¹®Çå
º»¹®³»¿ë
º» ³í¹®¿¡¼´Â ù°, ±âÁ¸ÀÇ ´Ü¼ø One-path XO
R ¹æ¹ýº¸´Ù ¾ÈÀüÇÑ M * N Puzzle ±â¹ýÀ» ÀÌ¿ëÇÑ Key Àü¼Û¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. µÑ°, »ý¼ºµÈ PuzzleÀº ¼¹ö¿¡ ÀúÀåÇÏÁö ¾ÊÀ¸¹Ç·Î ±âÁ¸ÀÇ ½Ã½ºÅÛº¸´Ù º¸¾È¼ºÀÌ ³ôÀº ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. ¼Â°, Ŭ¶óÀ̾ðÆ®¿¡¼ º¹È£È ÇÒ ¶§ OTP¿Í ÇÔ²² PuzzleÀ» º¹È£È Çϴ Ŭ¶óÀ̾ðÆ® º¹È£È ½Ã½ºÅÛÀ» Á¦¾ÈÇÑ´Ù. ³Ý°, M * N Puzzle±â¹ý°ú OTP¸¦ Á¶ÇÕÀ¸·Î º¸´Ù ¾ÈÀüÇÑ Å° Àü¼ÛÀ» Á¦¾ÈÇÑ´Ù.
In this paper, I suggest that
as follow. First, it is the algorithm to transmit the encryption key which use M * N Puzzle method more safe than the existing One-path XOR method. Second, it does provide the high quality of security than the existing system because it does not save the generated puzzle to the server side. Third, it does support the client decryption system which can decr¥ãpt the puzzle with OPT in decr¥ãption with client side. Fourth, it does adopt more of the safe transrmission method with the compound of M * N puzzle method and OPT. (ÀÌÇÏ »ý·«)
Âü°í¹®Çå
¾øÀ½
¹ÞÀº º°Á¡
0/5
0°³ÀÇ º°Á¡
¹®¼°øÀ¯ ÀڷḦ µî·ÏÇØ ÁÖ¼¼¿ä.
¹®¼°øÀ¯ Æ÷ÀÎÆ®¿Í Çö±ÝÀ» µå¸³´Ï´Ù.
Æ÷ÀÎÆ® : ÀÚ·á 1°Ç´ç ÃÖ´ë 5,000P Áö±Þ
Çö±Ý : ÀÚ·á 1°Ç´ç ÃÖ´ë 2,000¿ø Áö±Þ
ÀúÀÛ±Ç Á¤º¸
À§ Á¤º¸ ¹× °Ô½Ã¹° ³»¿ëÀÇ Áø½Ç¼º¿¡ ´ëÇÏ¿© ¾ÅÅ©Á¸Àº º¸ÁõÇÏÁö ¾Æ´ÏÇϸç, ÇØ´ç Á¤º¸ ¹× °Ô½Ã¹° ÀúÀ۱ǰú ±âŸ ¹ýÀû Ã¥ÀÓÀº ÀÚ·á µî·ÏÀÚ¿¡°Ô ÀÖ½À´Ï´Ù.
À§ Á¤º¸ ¹× °Ô½Ã¹° ³»¿ëÀÇ ºÒ¹ýÀû ÀÌ¿ë, ¹«´Ü ÀüÀ硤¹èÆ÷´Â ±ÝÁöµÇ¾î ÀÖ½À´Ï´Ù.
ÀúÀÛ±ÇħÇØ, ¸í¿¹ÈÑ¼Õ µî ºÐÀï¿ä¼Ò ¹ß°ß½Ã °í°´¼¾ÅÍÀÇ ÀúÀÛ±Ç Ä§ÇØ½Å°í¸¦ ÀÌ¿ëÇØ Áֽñ⠹ٶø´Ï´Ù.
ºê·£µå Á¤º¸
°í±Þ ³í¹®À» Á¦°øÇÏ´Â ÇÐÁö»ç ´º³í¹®Àº Àü¹® Çо÷ ºÐ¾ß¿¡ ÃÖ°íÀÇ ÀڷḦ º¸ÀåÇϸç
°¢Á¾ ¿¬±¸ »ç·Ê¿Í ¹Ì·¡ ºÐ¼® µîÀÇ ÀڷḦ ÅëÇØ Àι®ÇÐ, »çȸ ÀÚ¿¬°úÇÐ ºÐ¾ßÀÇ ±íÀÌ Àִ Ž»öÀ» ÇÒ ¼ö ÀÖ°Ô µµ¿Íµå¸®°Ú½À´Ï´Ù.
ÆǸÅÀÚ·á ¼ö : 32,704°Ç