{"title":"跨字节边界应用的分割块和乘积密码","authors":"Albert H Carlson, R. Hiromoto, R. Wells","doi":"10.1109/IDAACS.2011.6072867","DOIUrl":null,"url":null,"abstract":"The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed form three (3) alphabetic characters (metacharacters) where the applications of P and S upon the ASCII byte representation of each of the three characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.","PeriodicalId":106306,"journal":{"name":"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems","volume":"7 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Breaking block and product ciphers applied across byte boundaries\",\"authors\":\"Albert H Carlson, R. Hiromoto, R. Wells\",\"doi\":\"10.1109/IDAACS.2011.6072867\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed form three (3) alphabetic characters (metacharacters) where the applications of P and S upon the ASCII byte representation of each of the three characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.\",\"PeriodicalId\":106306,\"journal\":{\"name\":\"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems\",\"volume\":\"7 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IDAACS.2011.6072867\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDAACS.2011.6072867","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Breaking block and product ciphers applied across byte boundaries
The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed form three (3) alphabetic characters (metacharacters) where the applications of P and S upon the ASCII byte representation of each of the three characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.