Evidence map›Paper›PMID 34828072›Full record

ArticleEntropy (Basel, Switzerland)2021

An Image Encryption Algorithm Using Logistic Map with Plaintext-Related Parameter Values.

Jakub Oravec, Lubos Ovsenik, Jan Papaj

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

4 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Jakub OravecDepartment of Electronics and Multimedia Communications, Technical University of Kosice, Nemcovej 32, 040 01 Kosice, Slovakia.ORCID 0000-0002-0484-226X
Lubos OvsenikDepartment of Electronics and Multimedia Communications, Technical University of Kosice, Nemcovej 32, 040 01 Kosice, Slovakia.ORCID 0000-0002-5594-6157
Jan PapajDepartment of Electronics and Multimedia Communications, Technical University of Kosice, Nemcovej 32, 040 01 Kosice, Slovakia.ORCID 0000-0002-5428-4008

Funding

Slovak Research and Development Agency APVV-17-0208
6 · The paper itself

Abstract

This paper deals with a plaintext-related image encryption algorithm that modifies the parameter values used by the logistic map according to plain image pixel intensities. The parameter values are altered in a row-wise manner, which enables the usage of the same procedure also during the decryption. Furthermore, the parameter modification technique takes into account knowledge about the logistic map, its fixed points and possible periodic cycles. Since the resulting interval of parameter values achieves high positive values of Lyapunov exponents, the chaotic behavior of the logistic map should be most pronounced. These assumptions are verified by a set of experiments and the obtained numerical values are compared with those reported in relevant papers. It is found that the proposed design that uses a simpler, but well-studied, chaotic map with mitigated issues obtains results comparable with algorithms that use more complex chaotic systems. Moreover, the proposed solution is much faster than other approaches with a similar purpose.

Indexed as

chaotic mapimage encryptionlogistic mapLyapunov exponentplaintext-related

Identifiers

PMID34828072
PMCPMC8624481

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.