In this work we apply information theoretically optimal arithmetic coding and a number of novel side-channel blinding countermeasure techniques to create BLZZRD, a practical, compact, and more quantum-resistant variant of the BLISS Ring-LWE Signature Scheme. We show how the hash-based random oracle can be modified to be more secure against quantum preimage attacks while decreasing signature siz...

progressive image compression, Laplacian density, run-length coding, rate distortion We present a new low-complexity method for modeling and coding the bitplanes of a wavelet-transformed image in a fully embedded fashion. The scheme uses a simple ordering model for embedding, based on the principle that coefficient bits that are likely to reduce the distortion the most should be described first...

We propose an optimal buffered compression algorithm for shape coding as defined in the forthcoming MPEG-4 international standard. The MPEG-4 shape coding scheme consists of two steps: first, distortion is introduced by down and up scaling; then, context-based arithmetic encoding is applied. Since arithmetic coding is "lossless," the down up scaling step is considered as a virtual quantizer. We...

This paper describes cryptographic methods for concealing information during data compression processes. These include novel approaches of adding pseudo random shuffles into the processes of dictionary coding (Lampel-Ziv compression), arithmetic coding, and Huffman

The context-tree weighting algorithm 6] is an eecient universal source coding method for tree sources. Although a nite accuracy version of this algorithm has been analysed in 8], it is better to implement the algorithm as proposed in 7]. There it was suggested to store in each node s of the context tree, instead of an estimated probability P s e and a weighted probability P s w , the (logarithm...

Scalable video compression is becoming increasingly more important in diverse, heterogeneous networks of today. In our previous work 2], we developed a scalable codec capable of generating bit rates from tens of kilo bits per second to several mega bits per second with ne granularity of available bit rates. This codec is based on 3-D subband coding and multi-rate quantization of subband coeecie...

In this paper, a wavelet-based spatially scalable video coding scheme with in-band prediction is investigated in combination with JPEG 2000 quantization and arithmetic coding. The wavelet decomposition of each frame of the video data is succeeded by the computation of a blockwise motion compensated prediction for the individual subbands. To achieve half-pixel motion vector accuracy the shift-in...

The YK (Yang-Kieffer) algorithm [1,2] is a sequential lossless data compression built upon an efficient greedy grammar transform. This grammar transform constructs a sequence of irreducible context-free grammars from which the original data sequence can be recovered incrementally. The transform sequentially parses the original data into nonoverlapping variable-length phrases, and updates the gr...