{"title":"一个基于随机块长度的密码系统,通过多个级联排列组合和块链","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":"{\"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}","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}
A random block length based cryptosystem through multiple cascaded permutation-combinations and chaining of blocks
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.