A random block length based cryptosystem through multiple cascaded permutation-combinations and chaining of blocks

Jayanta Pal, J. K. Mandal
{"title":"A random block length based cryptosystem through multiple cascaded permutation-combinations and chaining of blocks","authors":"Jayanta Pal, J. K. Mandal","doi":"10.1109/ICIINFS.2009.5429895","DOIUrl":null,"url":null,"abstract":"In this paper a four stage character/bit level encoding technique (RBCMCPCC) has been proposed, where the first three steps take input block of length 128 bit, 192bit and 256 bit, respectively, and generate intermediate blocks of the same lengths using identical lengths of keys in each step. The fourth stage generates final cipher blocks based on random session-keys. Before execution of the fourth sage, all 256 bit blocks are passed through the chaining process to ensure the generation of non-identical intermediate stream. A two dimensional matrix based substitution and folding operation is performed in the first stage of encryption, whereas a three dimensional matrix based permutation and substitution operation is done in the next sage. Again, a four dimensional matrix oriented substitution and transposition operation is applied in the third stage. Finally, wrapping operation is done to produce the cipher text. To expound the effectiveness of the algorithm, the obtained results are compared with BAM, TDES, CTSCCT and RSA algorithms.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Industrial and Information Systems (ICIIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIINFS.2009.5429895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

In this paper a four stage character/bit level encoding technique (RBCMCPCC) has been proposed, where the first three steps take input block of length 128 bit, 192bit and 256 bit, respectively, and generate intermediate blocks of the same lengths using identical lengths of keys in each step. The fourth stage generates final cipher blocks based on random session-keys. Before execution of the fourth sage, all 256 bit blocks are passed through the chaining process to ensure the generation of non-identical intermediate stream. A two dimensional matrix based substitution and folding operation is performed in the first stage of encryption, whereas a three dimensional matrix based permutation and substitution operation is done in the next sage. Again, a four dimensional matrix oriented substitution and transposition operation is applied in the third stage. Finally, wrapping operation is done to produce the cipher text. To expound the effectiveness of the algorithm, the obtained results are compared with BAM, TDES, CTSCCT and RSA algorithms.
一个基于随机块长度的密码系统,通过多个级联排列组合和块链
本文提出了一种四阶段字符/位级编码技术(RBCMCPCC),其中前三步分别取长度为128位、192位和256位的输入块,并在每步中使用相同长度的密钥生成相同长度的中间块。第四阶段根据随机会话密钥生成最终的密码块。在执行第四步之前,所有256位块都经过链化过程,以确保生成不相同的中间流。在加密的第一阶段进行基于二维矩阵的替换和折叠操作,而在第二阶段进行基于三维矩阵的排列和替换操作。同样,在第三阶段应用了面向四维矩阵的替换和转置操作。最后,进行封装操作生成密文。为了说明该算法的有效性,将得到的结果与BAM、TDES、CTSCCT和RSA算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信