Encryption Schemes using Finite Frames and Hadamard Arrays
Ryan Harkins, Eric Weber, Andrew Westmeyer
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.
Create a lesson
Related papers
Integrated Identity Protection for Semantic Communications in Embodied IoT Systems
Yu Zhang, JingQi Liu, Shuangrui Zhao et al.
Signed, Sealed, Leaked: Trust Beyond Signature for MCP Toolchains
Yichiet Aun, Mohammed A. Alhartomi, Jing Jie Tan et al.
Signed but Steerable: Measuring and Closing the Text-Vector Integrity Gap in Offline Retrieval-Augmented Generation
Georgios Feretzakis, Alexandros Papaspyridis
Towards Early Warning of Real-World Vulnerabilities: An Evidence-Aware Decoupled Method for CVSS Vector Prediction Based on Unstructured Disclosures
Jianhong Ma, Wenhao Li, Xixing Li et al.
Shoot on (Core)Sight: Re-enabling Secure Debug on the RP2350 with Photon-Emission Microscopy and Laser Fault Injection
Antoine Plin
CoRTeC: A Differentially Private Release for Synthetic Tabular Data, Decodable by Any Generator
Calister Nnona