Asynchronous Updating Boolean Network Encryption Algorithm
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
An asynchronous updating Boolean network is employed to simulate and analyze the gene expression of a particular tissue or species, revealing the life activity process from a system perspective to reveal the disease mechanism and treat the disease. Therefore, to ensure the safe transmission of the asynchronous updating Boolean network in the network, we designed an asynchronous updating Boolean network encryption algorithm based on chaos (ABNEA). First, a novel 2D chaotic system (2D-FPSM) is designed. This system has better performance than the classical 2D chaotic system. It is very suitable for cryptographic systems to generate key streams. Second, an encoding rule is designed to convert the asynchronous updating Boolean network to a Boolean matrix and propagate it on the network as an image. The receiver and sender jointly save the encoding rule. Last, to protect the safe propagation of the Boolean network matrix on the network, the method of synchronous scrambling-diffusion is adapted to encrypt the Boolean network matrix based on the 2D-FPSM. Simulation experiments and security analysis show that the average correlation of adjacent pixels of ciphertext are 0.0010, -0.0010, -0.0020, and the average information entropy is 7.9984. The ABNEA can complete the encryption tasks of asynchronously updating Boolean networks and exhibits good security characteristics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ON THE DERIVATION OF A “CHAOTIC” ENCRYPTION ALGORITHM
Matthews, R. (1989) · Cryptologia · doi:10.1080/0161-118991863745 · Cited by 1,044
A chaos-based symmetric image encryption scheme using a bit-level permutation
Zhu, Z.-L., Zhang, W., Wong, K.-W., & Yu, H. (2011) · Information Sciences · doi:10.1016/j.ins.2010.11.009 · Cited by 662 · cited 1×
“According to the smallest unit of arrangement, image encryption algorithms are divided into three types, pixel-level arrangement [27], [28], bit-level arrangement [29], [30], and DNA-level arrangement [31], [32].”
BackgroundSecure Surveillance Framework for IoT Systems Using Probabilistic Image Encryption
Muhammad, K., Hamza, R., Ahmad, J., Lloret, J., Wang, H., & Baik, S. W. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2791944 · Cited by 299 · cited 2×
“The encryption time of MHA [52] and WSL [37] is 0.6708s and 19.14s on color images.”
Double image encryption algorithm based on neural network and chaos
Man, Z., Li, J., Di, X., Sheng, Y., & Liu, Z. (2021) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2021.111318 · Cited by 241
Chai, X., Fu, X., Gan, Z., Zhang, Y., Lu, Y., & Chen, Y. (2020) · Neural Computing and Applications · doi:10.1007/s00521-018-3913-3 · Cited by 127
Ali, T. S., & Ali, R. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-08850-5 · Cited by 115 · cited 2×
“[ 45], [46], [47], [48], [49], [50], and [51] are shown in Table XII.”
Cited by
A novel chaos-based permutation for image encryption
Alawida, M. (2023) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2023.101595 · Cited by 115
SRA: A sine-based reconstruction approach to improve 2D chaotic map performance
Ding, S., Wang, X., Zhu, P., Erkan, U., Toktas, A., Li, Q., Mou, J., & Gao, S. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-026-07421-1 · Cited by 40
“…security and resistance to interference [13–15]; in control engineering, chaotic control methods can effectively manage the stability of complex nonlinear systems; and in the biomedical field, chaotic models help simulate and analyze the dynamic behavior of complex biological systems [16–18].”
Self-citationEfficient and secure image encryption algorithm using 2D LIM map and Latin square matrix
Huang, X., Tang, J., & Zhang, Z. (2024) · Nonlinear Dynamics · doi:10.1007/s11071-024-10191-z · Cited by 35
Survey on medical image encryption: From classical to deep learning-based approaches
Prasad, S., & Singh, A. K. (2025) · Computers and Electrical Engineering · doi:10.1016/j.compeleceng.2024.110011 · Cited by 21
Wan, H., Zhou, L., Chen, H., Pang, D., You, Z., Wang, C., Wang, Y., & Huang, G. (2025) · Physica Scripta · doi:10.1088/1402-4896/add5a4 · Cited by 3
Self-citation
Metadata
- Authors
- Gao, S., Wu, R., Wang, X., Liu, J., Li, Q., Wang, C., & Tang, X.
- Venue
- IEEE Transactions on Circuits and Systems for Video Technology
- Published
- 2023-08
- Volume
- 33
- Issue
- 8
- Pages
- 4388-4400
- ISSN
- 1051-8215 (ISSN-L)
- 1558-2205
- OpenAlex
- W4316660727
- Cited by
- 110
- References
- 6
- FWCI
- 10.00
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.