Cited by 186Chaos-based Image/Signal EncryptionCryptographic Implementations and SecurityComputer Science and Engineering

Fast encryption of image data using chaotic Kolmogorov flows

Scharinger, Josef·1998·Journal of Electronic Imaging

Abstract

To guarantee security and privacy in image and video archival applications, efficient bulk encryption techniques are necessary which are easily implementable in soft- and hardware and are able to cope with the vast amounts of data involved. Experience has shown that block-oriented symmetric product ciphers constitute an adequate design paradigm for resolving this task, since they can offer a very high level of security as well as very high encryption rates. In this contribution we introduce a new product cipher which encrypts large blocks of plaintext by repeated intertwined application of substitution and permutation operations. While almost all of the current product ciphers use fixed (predefined) permutation operations on small data blocks, our approach involves parametrizable (keyed) permutations on large data blocks (whole images) induced by specific chaotic systems (Kolmogorov flows). By combining these highly unstable dynamics with an adaption of a very fast shift register based pseudo-random number generator, we obtain a new class of computationally secure product ciphers which offer many features that make them superior to contemporary bulk encryption systems when aiming at efficient image and video data encryption.

Integrity signals

Registry

Crossref · 10.1117/1.482647

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A scheme involving parametrizable permutations on large data blocks (whole images) induced by Kolmogorov flows was presented by Josef Scharinger.

    “Instead of the usual operation on small data blocks, a scheme involving parametrizable permutations on large data blocks (whole images) induced by Kolmogorov flows was presented by Josef Scharinger [27].”

Cited by

Sorted by citations

Authors
Scharinger, J.
Affiliations
Johannes Kepler University of Linz (AT)
Corresponding author
Scharinger, Josef
Venue
Journal of Electronic Imaging
Published
1998-04-01
Volume
7
Issue
02
Pages
318-325
ISSN
  • 1017-9909 (ISSN-L)
  • 1560-229X
OpenAlex
W2088694610
Cited by
186
References
0
Citations by year
2026: 2 · 2025: 2 · 2024: 1 · 2023: 3 · 2022: 1 · 2021: 5 · 2020: 3 · 2019: 2 · 2018: 10 · 2017: 9 · 2016: 3 · 2015: 7 · 2014: 9 · 2013: 13 · 2012: 7
FWCI
1.56
Type
journal article
Language
en
Open access
closed
Locations
Journal of Electronic Imaging (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
Keywords
image encryption, chaotic maps, Kolmogorov flow, fast encryption, image security

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review