A Video Scrambling Technique Based On Space Filling Curves (Extended Abstract)
In this paper we propose a video scrambling technique which scans a picture stored in a frame buffer along a pseudo-random space filling curve. We describe several efficient methods for generating cryptographically strong curves, and show that they actually decrease the bandwidth required to transmit the picture.
KeywordsSpan Tree Video Signal Hamiltonian Path Grid Graph Frame Buffer
- [IPS]— A. Itai, C.H. Papadimitriou and J.L. Szwarcfiter. “Hamilton paths in grid graphs”. Siam J. Comput. (1982).Google Scholar
- [Kast]— P.W. Kasteleyn, “Graph theory and crystal physics”. in “Graph theory and theoretical physics”. ed. F. Harary. Academic Press. London, 1967. — “A soluble self-avoiding walk problem.” Physica, 29, 1329–1337, 1963.Google Scholar
- [NL]— A.N. Netravali and J.O. Limb, “Picture Coding: A Review”. Proc. IEEE, vol. 68, no. 3, March 1980.Google Scholar
- [OID]— H. Orland, C. Itzykson and C. de Dominicis, “An evaluation of the number of Hamiltonian paths”. J. Physique Lett. 46, L-353–L-357, April 1985.Google Scholar