Javascript must be enabled to continue!
Information encoding by linear permutations of discrete Walsh transform
View through CrossRef
The paper proposes a method for using a code matrix as a private key for the Walsh-Hadamard
code. The number of possible code matrices has been calculated. For example, there are almost 10 million possible keys for a Walsh matrix of the order 32, they are also level 5. The paper describes the method of decoding information and the procedure for isolating the code matrix from the encrypted Walsh matrix.
Title: Information encoding by linear permutations of discrete Walsh transform
Description:
The paper proposes a method for using a code matrix as a private key for the Walsh-Hadamard
code.
The number of possible code matrices has been calculated.
For example, there are almost 10 million possible keys for a Walsh matrix of the order 32, they are also level 5.
The paper describes the method of decoding information and the procedure for isolating the code matrix from the encrypted Walsh matrix.
Related Results
METHODS FOR CONSTRUCTING PERMUTATIONS OF AN ARBITRARY FINITE FIELD AND THEIR LINEAR CHARACTERISTICS
METHODS FOR CONSTRUCTING PERMUTATIONS OF AN ARBITRARY FINITE FIELD AND THEIR LINEAR CHARACTERISTICS
Permutations in a finite field (bijective transformations) are actively studied in many applications, including in information security theory. Permutations are often used as eleme...
Transcriptomics extract the key chromium resistance genes of Cellulomonas
Transcriptomics extract the key chromium resistance genes of Cellulomonas
Abstract
Cellulomonas fimi Clb-11 can reduce high toxic Cr (VI) to low toxic Cr (III). In this study, transcriptomics was used to analyze the key genes, which was involved ...
The Application of S‐transform Spectrum Decomposition Technique in Extraction of Weak Seismic Signals
The Application of S‐transform Spectrum Decomposition Technique in Extraction of Weak Seismic Signals
AbstractIn processing of deep seismic reflection data, when the frequency band difference between the weak useful signal and noise both from the deep subsurface is very small and h...
Distribution of Segment Lengths in Genome Rearrangements
Distribution of Segment Lengths in Genome Rearrangements
The study of gene orders for constructing phylogenetic trees was introduced by Dobzhansky and Sturtevant in 1938. Different genomes may have homologous genes arranged in different...
Novel Techniques for Classifying Exotic Spheres in High Dimensions
Novel Techniques for Classifying Exotic Spheres in High Dimensions
Discrete calculus deals with developing the concepts and techniques of differential and integral calculus in a discrete setting, often using difference equations and discrete funct...
The locally crooked permutations and the complete permutations over F2n
The locally crooked permutations and the complete permutations over F2n
Abstract
The crooked function has a fixed point $0$ and all its difference set is the complement of the hyperplane. In this paper, we proposed the locally crooked permutati...
A lower bound for general t-stack sortable permutations via pattern avoidance
A lower bound for general t-stack sortable permutations via pattern avoidance
There is no formula for general t-stack sortable permutations. Thus, we attempt to study them by establishing lower and upper bounds. Permutations that avoid certain pattern sets p...
Performance Comparison of Hartley Transform with Hartley Wavelet and Hybrid Hartley Wavelet Transforms for Image Data Compression
Performance Comparison of Hartley Transform with Hartley Wavelet and Hybrid Hartley Wavelet Transforms for Image Data Compression
This paper proposes image compression using Hybrid Hartley wavelet transform. The paper compares the results of Hybrid Hartley wavelet transform with that of orthogonal Hartley tra...

