Share Email Print

Proceedings Paper

Fast unitary heap transforms: theory and application in cryptography
Author(s): Artyom M. Grigoryan; Khalil Naghdali
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper presents a novel approach to compose discrete unitary transforms that are induced by input signals which are considered to be generators of the transforms. Properties and examples of such transforms, which we call the discrete heap transforms are given. The transforms are fast, because of a simple form of decomposition of their matrices, and they can be applied for signals of any length. Fast algorithms of calculation of the direct and inverse heap transforms do not depend on the length of the processed signals. In this paper, we demonstrate the applications of the heap transforms for transformation and reconstruction of one-dimensional signals and two-dimensional images. The heap transforms can be used in cryptography, since the generators can be selected in different ways to make the information invisible; these generators are keys for recovering information. Different examples of generating and applying heap transformations over signals and images are considered.

Paper Details

Date Published: 4 May 2009
PDF: 12 pages
Proc. SPIE 7351, Mobile Multimedia/Image Processing, Security, and Applications 2009, 73510H (4 May 2009); doi: 10.1117/12.818946
Show Author Affiliations
Artyom M. Grigoryan, The Univ. of Texas at San Antonio (United States)
Khalil Naghdali, The Univ. of Texas at San Antonio (United States)

Published in SPIE Proceedings Vol. 7351:
Mobile Multimedia/Image Processing, Security, and Applications 2009
Sos S. Agaian; Sabah A. Jassim, Editor(s)

© SPIE. Terms of Use
Back to Top