On the security of binary arithmetic coding based on interval shrinking

Arithmetic coding (AC) is often chosen for joint compression and encryption. In this paper, we conduct a careful analysis of secure binary AC schemes based on interval shrinking regarding its security. We first give theoretical conditions for our attacks, then under these conditions we are able to r...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Multimedia tools and applications Ročník 75; číslo 8; s. 4245 - 4258
Hlavní autoři: Xiang, Tao, Sun, Jianglin, Fu, Xinwen
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2016
Springer Nature B.V
Témata:
Algorithms
Alternating current
Arithmetic
Arithmetic coding
Binary codes
Bismuth
Compressing
Computer Communication Networks
Computer information security
Computer Science
Computer simulation
Cybersecurity
Data encryption
Data Structures and Information Theory
Economic conditions
Encryption
Feasibility
Intervals
Mathematics
Multimedia
Multimedia Information Systems
Remedies
Special Purpose and Application-Based Systems
Symmetry
Cryptanalysis
Joint compression and encryption
Interval shrinking
Arithmetic coding
ISSN:1380-7501, 1573-7721
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Arithmetic coding (AC) is often chosen for joint compression and encryption. In this paper, we conduct a careful analysis of secure binary AC schemes based on interval shrinking regarding its security. We first give theoretical conditions for our attacks, then under these conditions we are able to recover the plaintext using traditional AC decoder without knowing any shrinking information. The attacks are feasible to uni-shrinking and symmetric bi-shrinking in different AC models. Extensive simulations are carried out and experimental results have validated our theoretical analysis. Effective remedy is also given in the end.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1380-7501
1573-7721
DOI:10.1007/s11042-015-2468-x