首页> 外文会议>International Conference on Communication Systems and Network Technologies >A New Symmetric Key Cryptography Algorithm Using Extended MSA Method: DJSA Symmetric Key Algorithm
【24h】

A New Symmetric Key Cryptography Algorithm Using Extended MSA Method: DJSA Symmetric Key Algorithm

机译:使用扩展MSA方法的新对称密钥加密算法:DJSA对称密钥算法

获取原文

摘要

In the present work the authors introduced a new symmetric key cryptographic method for encryption as well as decryption of any file such as binary file, text file or any other file. Nath et. al. (1) developed an algorithm called MSA for encryption and decryption of any file using a random key square matrix containing 256 elements. The weak point of MSA algorithm is that if someone applies the brute force method then he has to give a trial for factorial 256 to find the actual key matrix. Now in the modern world this number of trial runs may not be impossible for the hacker. To get rid of this problem here the authors suggest a better algorithm than MSA. In the present method the authors considered the size of the key matrix to be 65536 and in each cell we store 2 characters pattern instead of 1 character unlike MSA method. If someone wants to give a brute force method to find our actual key then one has to give a trial for factorial 65536 runs! Theoretically this is an intractable problem. Moreover the authors have also introduced multiple encryptions here to make the system more secured. This method will be suitable in any business house, government sectors, communication network, defense network system, sensor networks etc. In the present work the authors have introduced a square key matrix of size 256 by 256 where in each cell there are all possible 2-lettered words (ASCII code 0-255). The total number of words possible is 65536. The key matrix is then randomized using the method proposed by Nath et. al(1). The user has to enter some secret text-key. The maximum length of the text key should be 16 characters long. To calculate the randomization number and the number of encryption to be done is calculated from the text-key using a method proposed by Nath et.al(1). The present method will be most suitable for encryption of a file whose size is less than or equal to 2MB. If the file size is very big then we suggest choosing small encryption number to speed up the sy- - stem.
机译:在本工作中,作者推出了一种用于加密的新的对称密钥加密方法,以及任何文件的解密,如二进制文件,文本文件或任何其他文件。 nath et。 al。 (1)使用包含256个元素的随机密钥方矩阵开发了一种称为MSA的算法,用于加密和解密任何文件。 MSA算法的弱点是,如果有人应用蛮力方法,那么他必须为因子256提供试验以找到实际的键矩阵。现在在现代世界中,这次审判运行可能对黑客来说是不可能的。为了摆脱这个问题,作者建议比MSA更好的算法。在本方法中,作者认为关键矩阵的大小为65536,并且在每个小区中,我们存储2个字符模式而不是1个字符,而不是msa方法。如果有人想给出蛮力方法来找到我们的实际键,那么一个人必须为因子进行试验65536运行!理论上这是一个难以解决的问题。此外,作者还在此引入了多种加密,使系统更加安全。这种方法将适用于任何商业房屋,政府部门,通信网络,国防网络系统,传感器网络等。在本工作中,作者引入了256尺寸256的方形键矩阵,其中在每个单元中都有可能2 - 写词(ASCII代码0-255)。可能的单词总数是65536.然后使用Nath Et提出的方法随机化。 al(1)。用户必须输入一些秘密文本密钥。文本密钥的最大长度应为16个字符。为了计算随机化数字和要完成的加密数量是使用Nath et.al(1)提出的方法从文本密钥计算的。本方法最适合加密大小小于或等于2MB的文件。如果文件大小非常大,那么我们建议选择小的加密号以加快sy-step。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号