Encryption Schemes using Finite Frames and Hadamard Arrays
From MaRDI portal
Abstract: We propose a cipher similar to the One Time Pad and McEliece cipher based on a subband coding scheme. The encoding process is an approximation to the One Time Pad encryption scheme. We present results of numerical experiments which suggest that a brute force attack to the proposed scheme does not result in all possible plaintexts, as the One Time Pad does, but still the brute force attack does not compromise the system. However, we demonstrate that the cipher is vulnerable to a chosen-plaintext attack.
Recommendations
Cited in
(8)- Wavelet frames for (not necessarily reducing) affine subspaces
- On the orthogonality of frames and the density and connectivity of wavelet frames
- On hiding messages in the oversampled Fourier coefficients
- Weaknesses in Hadamard based symmetric key encryption schemes
- scientific article; zbMATH DE number 6125113 (Why is no real title available?)
- Encryption schemes based on Hadamard matrices with circulant cores
- Symmetric key end to end Cryptosystem using Plateaued functions and Hadamard matrix
- Enhanced multisecret-sharing schemes using LCD codes and weighing orthogonal matrices
This page was built for publication: Encryption Schemes using Finite Frames and Hadamard Arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378974)