{"title":"一种基于整数实现的安全算术编码算法","authors":"Yuh-Ming Huang, Y. Liang","doi":"10.1109/ISCIT.2011.6092162","DOIUrl":null,"url":null,"abstract":"This paper presents a novel modification of integer arithmetic code, which performs compression and encryption at the same time. It is quite different from the randomized arithmetic code (RAC), the interval splitting arithmetic code (ISAC), and the secure arithmetic code (SAC). In security, we apply the Pseudo-Random Bit Generator (PRBG) and the Secure Hash Algorithm (SHA-256) to construct the key vector. Each bit of the key vector known to both the encoder and decoder is used to determine whether the source intervals respectively allocated to each of the different symbols are needed to be adjusted prior to encoding each new symbol. Experimental results indicate that our proposed code does not compromise the coding efficiency.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A secure arithmetic coding algorithm based on integer implementation\",\"authors\":\"Yuh-Ming Huang, Y. Liang\",\"doi\":\"10.1109/ISCIT.2011.6092162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel modification of integer arithmetic code, which performs compression and encryption at the same time. It is quite different from the randomized arithmetic code (RAC), the interval splitting arithmetic code (ISAC), and the secure arithmetic code (SAC). In security, we apply the Pseudo-Random Bit Generator (PRBG) and the Secure Hash Algorithm (SHA-256) to construct the key vector. Each bit of the key vector known to both the encoder and decoder is used to determine whether the source intervals respectively allocated to each of the different symbols are needed to be adjusted prior to encoding each new symbol. Experimental results indicate that our proposed code does not compromise the coding efficiency.\",\"PeriodicalId\":226552,\"journal\":{\"name\":\"2011 11th International Symposium on Communications & Information Technologies (ISCIT)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 11th International Symposium on Communications & Information Technologies (ISCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2011.6092162\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2011.6092162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A secure arithmetic coding algorithm based on integer implementation
This paper presents a novel modification of integer arithmetic code, which performs compression and encryption at the same time. It is quite different from the randomized arithmetic code (RAC), the interval splitting arithmetic code (ISAC), and the secure arithmetic code (SAC). In security, we apply the Pseudo-Random Bit Generator (PRBG) and the Secure Hash Algorithm (SHA-256) to construct the key vector. Each bit of the key vector known to both the encoder and decoder is used to determine whether the source intervals respectively allocated to each of the different symbols are needed to be adjusted prior to encoding each new symbol. Experimental results indicate that our proposed code does not compromise the coding efficiency.