No abstract

Haar transform is known to have the smallest computational requirement with a considerable interest and attraction drawn towards its spectral properties of Boolean functions. This paper presents Haar transform of Linear Boolean functions, where by the discussion is based on the transformation from the Boolean domain to the Haar domain. The resulting spectrum is given with the corresponding calculations presented, while the analysis of the respective spectral coefficients and their general properties being explored. Furthermore, the general formulation and/or equation derivation for the transformation is introduced.

In this paper, we discuss using CTR mode, another standard encryption mode, to attack other standard encryption modes and using other standard encryption modes to attack CTR mode under the related-mode attack model. In particular, we point out that when the adversary has access to an oracle under one proper mode, then almost all other related-cipher modes, whether they are encryption modes or authentication modes or authenticated encryption modes, can be attacked with ease under the relatedmode attack model.

No abstract

Transform decoding of BCH codes over Z,,, B. SUNDAR RAJANt and M. U. SIDDIQIf For BCH codes with symbols from rings of residue class integers modulo m, denoted by Z,, we introduce the analogue of Blahut's frequency domain approach for codes over finite fields and show that the problem of decoding these codes is equivalent to the minimal shift register synthesis problem over Galois rings. A minimal shift register synthesis algorithm over Galois rings is obtained by straightforward extention of the Reeds-Sloane algorithm which is for shift register synthesis over 2,.