CAJ | 학술논문

通常使用分布式系统来处理网络安全产品的口令算法测试,但基于一种特殊规格的密码字符集(密码的每一位的字符集都有不同的约定),一般需要先生成字典处理,效率低下;文章通过建立一种快速分片算法,使用了一系列的进制转换方法以及掩码对应法,找到这种密码字符集的潜在规律,绕过I/O效率低下的问题;通过实验将传统分片法与本算法对比,显示本算法的速度不随字符空间的增大而增大,整体性能是传统方法的3~600倍.完全可替代传统方法.
통상사용분포식계통래처리망락안전산품적구령산법측시,단기우일충특수규격적밀마자부집(밀마적매일위적자부집도유불동적약정),일반수요선생성자전처리,효솔저하;문장통과건립일충쾌속분편산법,사용료일계렬적진제전환방법이급엄마대응법,조도저충밀마자부집적잠재규률,요과I/O효솔저하적문제;통과실험장전통분편법여본산법대비,현시본산법적속도불수자부공간적증대이증대,정체성능시전통방법적3~600배.완전가체대전통방법.
Typically distributed system is used to deal with the password algorithm in network related security products. However if it is based on a password character set on a particular standard (e.g Every character set in the password follows different conven?tion), generally it has to be handled by first generating a dictionary, which is inefficient;this article introduce a method which in?volves establishing a rapid fragmentation algorithm,using binary conversion method and the relation of mask,the law was found that resolved the I/O efficiency ,the speed of which remain unchanged as the gap between characters gets bigger. By comparison in ex?periments, speed of algorithm is 3 to 600 times better then traditional method ,it proves to be able to be applied to replace the tradi?tional method.