Encryption Schemes using Finite Frames and Hadamard Arrays

Simple item page
dc.creatorHarkins, Ryan
dc.creatorWeber, Eric
dc.creatorWestmeyer, Andrew
dc.date2004-05-06
dc.date.accessioned2026-07-07T03:21:13Z
dc.date.available2026-07-07T03:21:13Z
dc.descriptionWe 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.
dc.description14 pages, 11 figures
dc.identifierhttps://arxiv.org/abs/cs/0405022
dc.identifierhttp://arxiv.org/abs/cs/0405022
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32110
dc.subjectCryptography and Security
dc.subjectE.3
dc.titleEncryption Schemes using Finite Frames and Hadamard Arrays
dc.typetext

Files

Collections

arXiv