{"title":"A stream cipher design based on embedding of random bits","authors":"M. Mihaljević, H. Imai","doi":"10.1109/ISITA.2008.4895641","DOIUrl":null,"url":null,"abstract":"A novel approach for design of stream ciphers based on a combination of pseudo-randomness and randomness is proposed. The core element of the approach is a pseudo-random embedding of the random bits into the ciphertext. This embedding plays a role of a homophonic encoding and implies an additional communications overhead. Before its output to the public communication channel the ciphertext with the embedded random bits is also intentionally degraded via its exposure to a moderate noise binary symmetric channel. The proposed design has potential of providing that complexity of recovering the secret key in the known plaintext attacking scenario is close to the complexity of recovering the secret key via the exhaustive search, i.e. close to the maximal possible one for the given size of secret key. Accordingly, the proposed approach can be considered as a trade-off between the increased security and decreased communications efficiency.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895641","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
A novel approach for design of stream ciphers based on a combination of pseudo-randomness and randomness is proposed. The core element of the approach is a pseudo-random embedding of the random bits into the ciphertext. This embedding plays a role of a homophonic encoding and implies an additional communications overhead. Before its output to the public communication channel the ciphertext with the embedded random bits is also intentionally degraded via its exposure to a moderate noise binary symmetric channel. The proposed design has potential of providing that complexity of recovering the secret key in the known plaintext attacking scenario is close to the complexity of recovering the secret key via the exhaustive search, i.e. close to the maximal possible one for the given size of secret key. Accordingly, the proposed approach can be considered as a trade-off between the increased security and decreased communications efficiency.