{"title":"一种新的语音置乱方法:比较分析与快速算法","authors":"V. Delić, V. Šenk, V. S. Mibsevic","doi":"10.5281/ZENODO.36005","DOIUrl":null,"url":null,"abstract":"Conventional speech scrambling concept is based on permutation of time segments and/or frequency subbands. Although this approach is regarded as an insecure speech encryption method, almost all published scramblers are of that type. W e found out that a linear combination based on Hadamardm atrices instead of conventional permutation gives better cryptographic performances, maintaining all the good features of the scrambling concept. The new scrambling method provides a large key space and a simpler key selection. It attainsnegligible residualintelligibility and higher degree of cryptanalytic immunity. The price of these great improvements is a potential complexity increase. That is why we designed a fast algorithm for the new scrambling method.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new speech scrambling method: Comparative analysis and a fast algorithm\",\"authors\":\"V. Delić, V. Šenk, V. S. Mibsevic\",\"doi\":\"10.5281/ZENODO.36005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Conventional speech scrambling concept is based on permutation of time segments and/or frequency subbands. Although this approach is regarded as an insecure speech encryption method, almost all published scramblers are of that type. W e found out that a linear combination based on Hadamardm atrices instead of conventional permutation gives better cryptographic performances, maintaining all the good features of the scrambling concept. The new scrambling method provides a large key space and a simpler key selection. It attainsnegligible residualintelligibility and higher degree of cryptanalytic immunity. The price of these great improvements is a potential complexity increase. That is why we designed a fast algorithm for the new scrambling method.\",\"PeriodicalId\":282153,\"journal\":{\"name\":\"1996 8th European Signal Processing Conference (EUSIPCO 1996)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1996 8th European Signal Processing Conference (EUSIPCO 1996)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5281/ZENODO.36005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.36005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new speech scrambling method: Comparative analysis and a fast algorithm
Conventional speech scrambling concept is based on permutation of time segments and/or frequency subbands. Although this approach is regarded as an insecure speech encryption method, almost all published scramblers are of that type. W e found out that a linear combination based on Hadamardm atrices instead of conventional permutation gives better cryptographic performances, maintaining all the good features of the scrambling concept. The new scrambling method provides a large key space and a simpler key selection. It attainsnegligible residualintelligibility and higher degree of cryptanalytic immunity. The price of these great improvements is a potential complexity increase. That is why we designed a fast algorithm for the new scrambling method.