DNA与密码分析  

DNA-Based Cryptanalysis

作　　者：谯通旭 张文政 霍家佳 

机构地区：[1]现代通信国家重点实验室,四川成都610041

出　　处：《信息安全与通信保密》2006年第12期184-187,共4页Information Security and Communications Privacy

摘　　要：论文首先介绍了Weng-LongChang等人[1]用DNA方法分解整数(2k比特长)的算法,并与Beaver[2]的算法相比较。针对文献[1]中的算法,其瓶颈问题是所需溶液的体积随整数的规模而指数地增加,可改进文献[1]中的算法,使体积减少一半,但体积仍是指数级的。用DNA破解AES等分组密码面临同样的问题,因此,体积问题是破译RSA、AES等公钥(分组)密码共同面临的问题,而对这一问题,作者认为很难解决。In this paper, we first present Weng-Long Chang and Minyi Gao＇s algorithm[1] factoring integers （with bit length 2k） by DNA method .Then, it is compared with Beaver＇s algorithm[2].For the algorithm in [ 1 ], the bottleneck problem is that volume of DNA solution required is exponent function in bit length of integers.The algorithm in [1] can be improved so that volume required is decreased by a factor of two, but the volume remains exponent function in k.Cracking block ciphers such as AES is confronted with the same problem.Therefore, the problem of volume is common bottleneck problem for breaking cryptosystems such as RSA and AES.We think that this problem is very hard to resolve.

关 键 词：DNA 分解整数 密码分析 

分 类 号：TN918[电子电信—通信与信息系统]