Pith. sign in

REVIEW 4 major objections 3 minor 164 references

Singularity Cipher: A Topology-Driven Cryptographic Scheme Based on Visual Paradox and Klein Bottle Illusions

T0 review · 4 major / 3 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper proposes the Singularity Cipher, which scrambles plaintext with two key-dependent Klein-bottle-style permutations and then hides the encrypted bits inside geometric optical illusions such as the missing-square puzzle.

desk verdict A topology-flavored substitution cipher whose central diffusion claim is false on its own definition; the paper's own citations undercut it. read the letter →

arxiv 2507.21097 v1 pith:T6NNURZ5 submitted 2025-07-02 cs.CR

Abraham Itzhak Weinberg This is my paper · ORCID
classification cs.CR
keywords topologicalcryptographyvisualsteganographyKleinbottleciphermissingsquareillusionconfusionanddiffusionpermutation-onlyplausibledeniability
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper sets out to establish a dual-layer encryption scheme called the Singularity Cipher, in which the plaintext is first scrambled by two key-dependent Möbius-style permutations over a finite alphabet, and the resulting ciphertext bits are then rendered as geometric figures that look like ordinary diagrams. The intended payoff is a cryptosystem that combines the confusion and diffusion expected of a block cipher with steganographic concealment: an observer would not even know a hidden message exists, which gives the sender plausible deniability. A sympathetic reader would care because the design attacks a problem most ciphers ignore—detection of encrypted traffic—and it claims to do so without sacrificing a large key space or reversibility. The paper also positions the scheme as an augmentation layer that can be wrapped around established post-quantum algorithms.

What carries the argument

The load-bearing object is the composition $T_2\circ T_1$ of two key-dependent cyclic permutations—the "Möbius-style twist functions"—which the paper uses to model non-orientable Klein-bottle traversal so that symbol paths cross and invert. The second mechanism is the paradox encoding layer, which maps each bit to a visually plausible figure: a normal triangle for 0 and a missing-square illusion for 1. All claimed security follows from these two components: the permutations supply key space and scrambling, and the illusions supply concealment and plausible deniability.

What would settle it

Encrypt two plaintexts of the same length that differ in exactly one symbol under the same key, convert both outputs to binary, and compare positions: if the differences occur only within the bits encoding the changed symbol, the claimed avalanche effect is absent and the diffusion argument collapses.

Watch

Extended reading notes

Core claim

The central claim is that composing two key-dependent cyclic permutations, $E(c)=T_2(T_1(m))$ with $D(c)=T_1^{-1}(T_2^{-1}(c))$, simulates a traversal over a Klein bottle and thereby produces the confusion and diffusion normally associated with block ciphers. Each symbol of the plaintext is twisted twice, the result is converted to binary, and each bit is encoded as either a standard triangle (bit 0) or a missing-square illusion (bit 1). The paper argues that this gives a key space of $(n!)^2$ for an alphabet of size $n$, makes the ciphertext resistant to statistical steganalysis and visual inspection, and supports human-verifiable decryption by anyone who knows the encoding rules.

Load-bearing premise

The design assumes that scrambling each message symbol twice with secret rearrangement rules makes a change in any one symbol alter many other symbols, even though each symbol is rearranged independently of the others.

Editorial extensions

If this is right

  • If the security analysis is correct, a message can be transmitted inside a puzzle or diagram with no visible ciphertext, giving the sender plausible deniability.
  • The claimed key space $(n!)^2$ would make exhaustive search impractical for an alphabet of size 256 even before the visual layer is considered.
  • Because decryption only requires inverse permutations and visual symbol recognition, the scheme can in principle be decoded by a trained human without any computing device.
  • The scheme can be wrapped around an existing post-quantum cipher, adding a stealth layer while leaving the underlying algorithm unchanged.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Left implicit in the paper, the topological vocabulary is decorative: the actual mechanism is two alphabet permutations plus a steganographic mapping, so the scheme should be evaluated against other permutation-based and visual-steganography systems rather than against topological algebra.
  • A testable extension would be to define the twists as position-dependent or block-wise transformations rather than symbol-wise permutations; only such a change could plausibly deliver the claimed avalanche effect, since a symbol-wise permutation changes each symbol independently.
  • The missing-square bit encoding could be generalized to other locally consistent but globally inconsistent figures, but that extension would require a study of how printing, compression, and automated image preprocessing distort the paradox before the steganographic layer can be considered robust.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 3 minor

Summary. The paper proposes a two-layer cryptographic-steganographic scheme: a "topological" layer that applies two key-dependent symbol permutations T1 and T2 over a finite alphabet, and a "paradox encoding" layer that renders each ciphertext bit as either a normal triangle or a visual illusion. Sections 4 and 5 define the architecture and give encryption/decryption algorithms; Section 6 claims confusion, diffusion, a key space of (n!)^2, resistance to brute-force and known-plaintext attacks, and steganographic robustness; Section 7 compares the scheme with classical, post-quantum, and steganographic methods; Section 8 discusses applications.

Significance. If the claims were valid, a hybrid topological/visual cipher with plausible deniability and resistance to steganalysis would be an interesting contribution to the security literature, and the paper deserves credit for specifying concrete algorithms, including a limitations subsection (Section 6.5), and for honestly labeling its quantum resistance as "Unproven" in Table 1. However, as specified, the construction is a permutation-only substitution cipher: the central diffusion/avalanche claim in Section 6.1 is false for symbol-wise permutations, the known-plaintext resistance claim in Section 6.3 is contradicted by the paper's own citation [82], and the key-space calculation in Section 6.2 does not match the algorithm. No formal security model, theorem, or proof is provided, and the steganographic robustness claims in Section 6.4 are asserted without analysis or experiments. The result is that the paper's core security contribution is unsupported, and the errors are load-bearing rather than local.

major comments (4)
  1. [6.1] The claimed diffusion and avalanche effect do not hold for the specified construction. In Algorithm 1, T1 and T2 are applied symbol-wise (c1 <- T1(m,k1); c2 <- T2(c1,k2)), and Eq. (1) defines E(c) = T2(T1(c)) for each symbol c in A. Consequently, two plaintexts differing only at position i produce ciphertexts differing only at position i; the number of changed output bits is at most O(log |A|) and is independent of message length. This is the opposite of diffusion. Calling the permutations "nonlinear" (Section 4.2) does not repair the issue, since bijective cyclic permutations applied per symbol do not mix information across positions. If T1 and T2 were instead intended as position permutations of the whole message, that is not what Algorithm 1 specifies, and a pure position permutation would preserve symbol frequencies and still fail to provide value-level diffusion. This claim is load-bearing because Sections 6.3, 7, and 9 all rely on the confusion/diffusion properties stated here.
  2. [6.3] The asserted resistance to known-plaintext attacks is not supported and is contradicted by the construction and by the manuscript's own reference [82]. Since the only encryption operation is the symbol permutation P = T2 o T1, a known plaintext-ciphertext pair reveals P on those symbols; with enough pairs the permutation is fully determined. The statement that the transformation is "reversible only with both k1 and k2" is not a security argument, because decryption requires only the composed permutation P, not the individual factors. Reference [82] explicitly shows that permutation-only multimedia ciphers are vulnerable to known/chosen-plaintext attacks, and Section 6.3 does not address or distinguish itself from that result. The visual encoding layer does not change this, since the underlying symbol permutation is still recoverable from plaintext/ciphertext pairs before encoding.
  3. [6.2] The key-space calculation is inconsistent with the algorithm as specified. Section 6.2 states that for an alphabet of size n the key space is (n!)^2, treating T1 and T2 as arbitrary permutations. However, Section 5 and Algorithm 1 describe T1 and T2 as "key-dependent cyclic mappings" over the alphabet; for two cyclic shifts the key space is n^2, not (n!)^2. If arbitrary permutations are intended, the paper must specify how k1 and k2 select and represent them, and must analyze the resulting key space and computational cost. As written, the brute-force resistance claim in Section 6.2 is not established.
  4. [6.4] The steganographic robustness claims are asserted without a threat model or evaluation. Section 6.4 claims resistance to statistical steganalysis and visual inspection, but the encoding in Section 4.3 is a fixed mapping from bits to two visually distinguishable classes (normal triangle vs. paradoxical illusion). Under Kerckhoffs's assumption, an adversary who knows the scheme can test an image for the presence of these two classes, and the paper gives no argument or experiment showing that natural images or innocent diagrams would not be separated from encoded images. Section 6.5 lists rendering and distortion limitations but does not quantify detection resistance. Given that the steganographic layer is one of the two advertised contributions, the absence of any concrete analysis or experiment makes the Section 6.4 claims unsupported.
minor comments (3)
  1. [1.1 / 4.2] Eq. (1) is written inconsistently: Section 1.1 uses c as the input symbol in E(c)=T2(T1(c)), while Section 4.2 writes E(c)=T2(T1(m)) with m as the input and c as the ciphertext. Please harmonize the notation to avoid ambiguity.
  2. [6.1] The phrase "nonlinear nature of the permutations" is undefined. Cyclic shifts over a finite alphabet are linear over Z_n; if a different notion of nonlinearity is intended, it should be defined and used in the analysis.
  3. [7.3] Table 1 appropriately labels the scheme's quantum resistance as "Unproven," but the subsequent sentence in Section 7.3 that the "topological foundation suggests potential robustness against both classical and quantum attacks" goes beyond any evidence presented in the paper; either remove this suggestion or support it with a concrete argument.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Singularity Cipher is defined constructively, and its security claims are asserted rather than derived from their own definitions or from load-bearing self-citations.

full rationale

The paper is a constructive proposal: it defines a two-layer scheme (Section 1.1, Equations 1) and then describes algorithms and illustrative security arguments. There are no fitted parameters, no empirical predictions, and no quantity is estimated from data and then renamed as a prediction. The key-space claim (n!)^2 in Section 6.2 is a direct combinatorial count following from the definition K=(k1,k2), so it is not circular. The central security assertions in Section 6.1 (confusion and diffusion via T2(T1(m))) are not proven and conflict with the specified symbol-wise permutation construction, but an unsupported or even false claim is a correctness problem, not a circular reduction: the paper does not show that any equation equals another by construction. The only self-citations, DaChE [7] and QUASAR [16], appear as background motivation in the introduction and are not load-bearing premises of the scheme; no inference in the construction depends on their correctness. Section 6.5 honestly lists limitations (key secrecy, rendering fidelity, decoding assumptions), and Section 7.3 states that quantum resistance is unproven; these admissions are not circular steps. Accordingly, no step reduces to its own input, and the circularity score is 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper introduces no measurable quantities or new postulates beyond the metaphors. Its security rests on four unproven assumptions: key space size alone provides security, two permutations give confusion and diffusion, the visual encoding is decodable and robust, and the topological framing contributes security. The first is standard math but insufficient; the others are domain assumptions or ad hoc narrative elements with no supporting evidence.

assumptions (4)
  • standard math The key space (n!)^2 is large enough to resist brute force for n=256.
    Counting argument in Section 6.2. Correct in itself but not sufficient for security against known-plaintext or chosen-plaintext attacks, which the paper does not address.
  • domain assumption Two key-dependent permutations over the alphabet provide confusion and diffusion.
    Stated in Sections 4.2 and 6.1 without proof. For symbol-wise permutations, changing one plaintext symbol changes only the corresponding ciphertext symbol, so the claimed avalanche effect does not follow. The paper cites reference [82] on cryptanalysis of permutation-only ciphers, which directly undermines this assumption.
  • domain assumption The visual paradox encoding can be reliably decoded by a receiver and resists statistical steganalysis.
    Assumed in Sections 4.3 and 6.4. No implementation, no robustness experiments, and the paper itself lists optical distortions, compression artifacts, and filtering as limitations in Section 6.5. The reliability of distinguishing a normal triangle from a 'missing square' illusion under realistic conditions is untested.
  • ad hoc to paper The Klein bottle and Möbius strip metaphors map to meaningful cryptographic properties.
    The construction is a pair of permutations with no formal connection to non-orientable surfaces. The topological language is used for narrative framing; no property of the Klein bottle is proven to affect the cipher's security or performance.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Singularity Cipher: A Topology-Driven Cryptographic Scheme Based on Visual Paradox and Klein Bottle Illusions." pith.science (2026). https://pith.science/paper/T6NNURZ5

@misc{pith2026250721097,
  author       = {Pith},
  title        = {Pith review of: Singularity Cipher: A Topology-Driven Cryptographic Scheme Based on Visual Paradox and Klein Bottle Illusions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/T6NNURZ5}},
  note         = {Machine review of arXiv:2507.21097}
}
read the original abstract

This paper presents the Singularity Cipher, a novel cryptographic-steganographic framework that integrates topological transformations and visual paradoxes to achieve multidimensional security. Inspired by the non-orientable properties of the Klein bottle -- constructed from two Mobius strips -- the cipher applies symbolic twist functions to simulate topological traversal, producing high confusion and diffusion in the ciphertext. The resulting binary data is then encoded using perceptual illusions, such as the missing square paradox, to visually obscure the presence of encrypted content. Unlike conventional ciphers that rely solely on algebraic complexity, the Singularity Cipher introduces a dual-layer approach: symbolic encryption rooted in topology and visual steganography designed for human cognitive ambiguity. This combination enhances both cryptographic strength and detection resistance, making it well-suited for secure communication, watermarking, and plausible deniability in adversarial environments. The paper formalizes the architecture, provides encryption and decryption algorithms, evaluates security properties, and compares the method against classical, post-quantum, and steganographic approaches. Potential applications and future research directions are also discussed.

Figures

Figures reproduced from arXiv: 2507.21097 by the authors.

Figure 1
Figure 1. Structure of the Singularity Cipher: a two-layer hybrid encryption [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

164 extracted references · 80 canonical work pages

  1. [82]

    Designing and evaluating layered security,

    S. Lord and R. Nunes-Vaz, “Designing and evaluating layered security,” International Journal of Risk Assessment and Management , vol. 17, no. 1, pp. 19–45, 2013

    2013

  2. [1]

    A survey report on various cryptanalysis techniques,

    A. K. Kendhe and H. Agrawal, “A survey report on various cryptanalysis techniques,” International Journal of Soft Computing and Engineering (IJSCE), vol. 3, no. 2, pp. 287–293, 2013

    2013

  3. [2]

    Advanced encryption standard (aes),

    M. J. Dworkin, E. Barker, J. R. Nechvatal, J. Foti, L. E. Bassham, E. Roback, J. F. Dray Jr et al. , “Advanced encryption standard (aes),” 2001

    2001

  4. [3]

    Systematic and critical review of rsa based public key cryptographic schemes: Past and present status,

    R. Imam, Q. M. Areeb, A. Alturki, and F. Anwer, “Systematic and critical review of rsa based public key cryptographic schemes: Past and present status,” IEEE access, vol. 9, pp. 155 949–155 976, 2021

    2021

  5. [4]

    Post-quantum anonymity of kyber,

    V. Maram and K. Xagawa, “Post-quantum anonymity of kyber,” in IACR International Conference on Public-Key Cryptography . Springer, 2023, pp. 3–35

    2023

  6. [5]

    Digital image steganography: A literature survey,

    P. C. Mandal, I. Mukherjee, G. Paul, and B. Chatterji, “Digital image steganography: A literature survey,” Information sciences , vol. 609, pp. 1451–1488, 2022

    2022

  7. [6]

    Chaos-based image encryption: Review, applica- tion, and challenges,

    B. Zhang and L. Liu, “Chaos-based image encryption: Review, applica- tion, and challenges,” Mathematics, vol. 11, no. 11, p. 2585, 2023

    2023

  8. [7]

    Dynamic Data Defense: Unveiling the Database in motion Chaos Encryption (DaChE) Algorithm -- A Breakthrough in Chaos Theory for Enhanced Database Security

    A. I. Weinberg, “Dynamic data defense: Unveiling the database in motion chaos encryption (dache) algorithm–a breakthrough in chaos theory for enhanced database security,” arXiv preprint arXiv:2501.03296 , 2025

    work page Pith review arXiv 2025

Show all 164 references
  1. [8]

    A study of bitcoin de-anonymization: Graph and multidimensional data analysis,

    X. Lv, Y. Zhong, and Q. Tan, “A study of bitcoin de-anonymization: Graph and multidimensional data analysis,” in 2020 IEEE Fifth Interna- tional Conference on Data Science in Cyberspace (DSC) . IEEE, 2020, pp. 339–345

    2020

  2. [9]

    Topological symmetry transition between toroidal and klein bottle graphenic systems,

    M. V. Putz and O. Ori, “Topological symmetry transition between toroidal and klein bottle graphenic systems,” Symmetry, vol. 12, no. 8, p. 1233, 2020

    2020

  3. [10]

    Geometrical illusions are not always where you think they are: a review of some classical and less classical illusions, and ways to describe them,

    J. Ninio, “Geometrical illusions are not always where you think they are: a review of some classical and less classical illusions, and ways to describe them,” Frontiers in human neuroscience, vol. 8, p. 856, 2014

    2014

  4. [11]

    What are cognitive illusions?

    R. F. Pohl, “What are cognitive illusions?” in Cognitive Illusions. Rout- ledge, 2022, pp. 3–23

    2022

  5. [12]

    On the limits of steganography,

    R. J. Anderson and F. A. Petitcolas, “On the limits of steganography,” IEEE Journal on selected areas in communications , vol. 16, no. 4, pp. 474–481, 1998. 16

    1998

  6. [13]

    Short topological decompo- sitions of non-orientable surfaces,

    N. Fuladi, A. Hubard, and A. de Mesmay, “Short topological decompo- sitions of non-orientable surfaces,” Discrete & Computational Geometry , vol. 72, no. 2, pp. 783–830, 2024

    2024

  7. [14]

    Image steganography with visual illusion,

    S. Jiao and J. Feng, “Image steganography with visual illusion,” Optics Express, vol. 29, no. 10, pp. 14 282–14 292, 2021

    2021

  8. [15]

    Transi- tioning organizations to post-quantum cryptography,

    D. Joseph, R. Misoczki, M. Manzano, J. Tricot, F. D. Pinuaga, O. La- combe, S. Leichenauer, J. Hidary, P. Venables, and R. Hansen, “Transi- tioning organizations to post-quantum cryptography,” Nature, vol. 605, no. 7909, pp. 237–243, 2022

    2022

  9. [16]

    Preparing for the post quantum era: Quantum ready architecture for security and risk management (quasar)–a strategic frame- work for cybersecurity,

    A. I. Weinberg, “Preparing for the post quantum era: Quantum ready architecture for security and risk management (quasar)–a strategic frame- work for cybersecurity,” arXiv preprint arXiv:2505.17034 , 2025

    2025 arXiv

  10. [17]

    Visual cryptanalysis,

    A. Shamir, “Visual cryptanalysis,” in Advances in Cryptol- ogy—EUROCRYPT’98: International Conference on the Theory and Application of Cryptographic Techniques Espoo, Finland, May 31–June 4, 1998 Proceedings 17 . Springer, 1998, pp. 201–210

    1998

  11. [18]

    Distributed ledger privacy: Ring sig- natures, m \

    C. D. Clack and N. T. Courtois, “Distributed ledger privacy: Ring sig- natures, m \” obius and cryptonote,” arXiv preprint arXiv:1902.02609 , 2019

    1902 arXiv

  12. [19]

    Encoding geometric and non-geometric information: a study with evolved agents,

    M. Ponticorvo and O. Miglino, “Encoding geometric and non-geometric information: a study with evolved agents,” Animal Cognition, vol. 13, pp. 157–174, 2010

    2010

  13. [20]

    Topological graphic passwords and their matchings towards cryptography,

    B. Yao, H. Sun, X. Zhang, Y. Mu, Y. Sun, H. Wang, J. Su, M. Zhang, S. Yang, and C. Yang, “Topological graphic passwords and their matchings towards cryptography,” arXiv preprint arXiv:1808.03324 , 2018

    2018 arXiv

  14. [21]

    Perceptual indistinguishability-net (pi-net): Facial image obfuscation with manipula- ble semantics,

    J.-W. Chen, L.-J. Chen, C.-M. Yu, and C.-S. Lu, “Perceptual indistinguishability-net (pi-net): Facial image obfuscation with manipula- ble semantics,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2021, pp. 6478–6487

    2021

  15. [22]

    Design a new visual cryp- tography for human-verifiable authentication in accessing a database,

    C.-N. Yang, L.-Z. Sun, X. Yan, and C. Kim, “Design a new visual cryp- tography for human-verifiable authentication in accessing a database,” Journal of Real-Time Image Processing , vol. 12, pp. 483–494, 2016

    2016

  16. [23]

    A review of quantum and hy- brid quantum/classical blockchain protocols,

    M. Edwards, A. Mashatan, and S. Ghose, “A review of quantum and hy- brid quantum/classical blockchain protocols,” Quantum Information Pro- cessing, vol. 19, pp. 1–22, 2020

    2020

  17. [24]

    Core–periphery organiza- tion of the cryptocurrency market inferred by the modularity operator,

    K. Polovnikov, V. Kazakov, and S. Syntulsky, “Core–periphery organiza- tion of the cryptocurrency market inferred by the modularity operator,” Physica A: Statistical Mechanics and its Applications , vol. 540, p. 123075, 2020. 17

    2020

  18. [25]

    A comprehensive survey of covert communication techniques, limitations and future challenges,

    I. Makhdoom, M. Abolhasan, and J. Lipman, “A comprehensive survey of covert communication techniques, limitations and future challenges,” Computers & Security , vol. 120, p. 102784, 2022

    2022

  19. [26]

    Post- quantum crystography: a combination of post-quantum cryptography and steganography,

    A. J. Gabriel, B. K. Alese, A. O. Adetunmbi, and O. S. Adewale, “Post- quantum crystography: a combination of post-quantum cryptography and steganography,” in 8th International Conference for Internet Technology and Secured Transactions (ICITST-2013). IEEE, 2013, pp. 449–452

    2013

  20. [27]

    Topfusion: Using topological fea- ture space for fusion and imputation in multi-modal data,

    A. Myers, H. Kvinge, and T. Emerson, “Topfusion: Using topological fea- ture space for fusion and imputation in multi-modal data,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recogni- tion, 2023, pp. 600–609

    2023

  21. [28]

    A survey on conventional encryption algorithms of cryptography,

    R. Yegireddi and R. K. Kumar, “A survey on conventional encryption algorithms of cryptography,” in 2016 International Conference on ICT in Business Industry & Government (ICTBIG) . IEEE, 2016, pp. 1–4

    2016

  22. [29]

    The perception of de- ceptive information can be enhanced by training that removes superficial visual information,

    D. Ryu, B. Abernethy, S. H. Park, and D. L. Mann, “The perception of de- ceptive information can be enhanced by training that removes superficial visual information,” Frontiers in psychology, vol. 9, p. 1132, 2018

    2018

  23. [30]

    Post-quantum cryptography: An in- troductory overview and implementation challenges of quantum-resistant algorithms,

    S. A. K¨ appler and B. Schneider, “Post-quantum cryptography: An in- troductory overview and implementation challenges of quantum-resistant algorithms,” Proceedings of the Society, vol. 84, pp. 61–71, 2022

    2022

  24. [31]

    Hiding images in plain sight: Deep steganography,

    S. Baluja, “Hiding images in plain sight: Deep steganography,” Advances in neural information processing systems , vol. 30, 2017

    2017

  25. [32]

    Combination of steganography and cryptography: A short survey,

    M. S. Taha, M. S. Mohd Rahim, S. A. Lafta, M. M. Hashim, and H. M. Alzuabidi, “Combination of steganography and cryptography: A short survey,” in IOP conference series: materials science and engineering , vol. 518, no. 5. IOP Publishing, 2019, p. 052003

    2019

  26. [33]

    Cryptanalysis of substitution-permutation net- work based image encryption schemes: a systematic review,

    S. Dhall and K. Yadav, “Cryptanalysis of substitution-permutation net- work based image encryption schemes: a systematic review,” Nonlinear Dynamics, vol. 112, no. 17, pp. 14 719–14 744, 2024

    2024

  27. [34]

    Chaos-based confusion and diffusion of image pixels using dynamic substitution,

    A. Qayyum, J. Ahmad, W. Boulila, S. Rubaiee, F. Masood, F. Khan, W. J. Buchanan et al. , “Chaos-based confusion and diffusion of image pixels using dynamic substitution,” IEEE Access , vol. 8, pp. 140 876– 140 895, 2020

    2020

  28. [35]

    Code-based cryptography,

    R. Overbeck and N. Sendrier, “Code-based cryptography,” in Post- quantum cryptography. Springer, 2009, pp. 95–145

    2009

  29. [36]

    Progress in multivariate cryptography: Systematic review, challenges, and research directions,

    J. Dey and R. Dutta, “Progress in multivariate cryptography: Systematic review, challenges, and research directions,” ACM Computing Surveys , vol. 55, no. 12, pp. 1–34, 2023. 18

    2023

  30. [37]

    An overview of quan- tum cryptography and shor’s algorithm,

    C. Ugwuishiwu, U. Orji, C. Ugwu, and C. Asogwa, “An overview of quan- tum cryptography and shor’s algorithm,” Int. J. Adv. Trends Comput. Sci. Eng , vol. 9, no. 5, 2020

    2020

  31. [38]

    Applying grover’s algorithm to aes: quantum resource estimates,

    M. Grassl, B. Langenberg, M. Roetteler, and R. Steinwandt, “Applying grover’s algorithm to aes: quantum resource estimates,” in International Workshop on Post-Quantum Cryptography . Springer, 2016, pp. 29–43

    2016

  32. [39]

    Horv´ ath and L

    M. Horv´ ath and L. Butty´ an, Cryptographic Obfuscation: A Survey . Springer, 2020

    2020

  33. [40]

    A system- atic literature review on chaotic maps-based image security techniques,

    D. Singh, S. Kaur, M. Kaur, S. Singh, M. Kaur, and H.-N. Lee, “A system- atic literature review on chaotic maps-based image security techniques,” Computer Science Review , vol. 54, p. 100659, 2024

    2024

  34. [41]

    Cryptanalysis of a new method of cryptography using laplace transform hyperbolic functions,

    M. T. Gen¸ co˘ glu, “Cryptanalysis of a new method of cryptography using laplace transform hyperbolic functions,” Communications in Mathematics and applications, vol. 8, no. 2, p. 183, 2017

    2017

  35. [42]

    Steganography security: Principle and practice,

    Y. Ke, J. Liu, M.-Q. Zhang, T.-T. Su, and X.-Y. Yang, “Steganography security: Principle and practice,” Ieee Access, vol. 6, pp. 73 009–73 022, 2018

    2018

  36. [43]

    A survey on steganography using least significant bit (lsb) embedding approach,

    K. Bansal, A. Agrawal, and N. Bansal, “A survey on steganography using least significant bit (lsb) embedding approach,” in 2020 4th International Conference on Trends in Electronics and Informatics (ICOEI)(48184) . IEEE, 2020, pp. 64–69

    2020

  37. [44]

    Implementation and analy- sis of image steganography using least significant bit and discrete wavelet transform techniques,

    S. S. Yadahalli, S. Rege, and R. Sonkusare, “Implementation and analy- sis of image steganography using least significant bit and discrete wavelet transform techniques,” in 2020 5th international conference on communi- cation and electronics systems (ICCES) . IEEE, 2020, pp. 1325–1330

    2020

  38. [45]

    Image steganography combination of spatial and frequency domain,

    S. V. Joshi, A. A. Bokil, N. A. Jain, and D. Koshti, “Image steganography combination of spatial and frequency domain,” International Journal of Computer Applications, vol. 53, no. 5, pp. 25–29, 2012

    2012

  39. [46]

    Comprehensive survey on image steganalysis using deep learning,

    N. J. De La Croix, T. Ahmad, and F. Han, “Comprehensive survey on image steganalysis using deep learning,” Array, p. 100353, 2024

    2024

  40. [47]

    Practical steganalysis of digital images: state of the art,

    J. Fridrich and M. Goljan, “Practical steganalysis of digital images: state of the art,” security and Watermarking of Multimedia Contents IV , vol. 4675, pp. 1–13, 2002

    2002

  41. [48]

    The pitfalls of visual representations: A review and classification of common errors made while designing and in- terpreting visualizations,

    S. Bresciani and M. J. Eppler, “The pitfalls of visual representations: A review and classification of common errors made while designing and in- terpreting visualizations,” Sage Open, vol. 5, no. 4, p. 2158244015611451, 2015. 19

    2015

  42. [49]

    Topological quantum computation—from basic concepts to first experiments,

    A. Stern and N. H. Lindner, “Topological quantum computation—from basic concepts to first experiments,” Science, vol. 339, no. 6124, pp. 1179– 1184, 2013

    2013

  43. [50]

    C. D. de Albuquerque, E. B. da Silva, and W. S. Soares, Quantum Codes for Topological Quantum Computation. Springer, 2022

    2022

  44. [51]

    Ex- perimental demonstration of topological error correction,

    X.-C. Yao, T.-X. Wang, H.-Z. Chen, W.-B. Gao, A. G. Fowler, R. Raussendorf, Z.-B. Chen, N.-L. Liu, C.-Y. Lu, Y.-J. Deng et al. , “Ex- perimental demonstration of topological error correction,” Nature, vol. 482, no. 7386, pp. 489–494, 2012

    2012

  45. [52]

    Can topological transitions in cryptocurrency systems serve as early warning signals for extreme fluctuations in traditional mar- kets?

    S. Song and H. Li, “Can topological transitions in cryptocurrency systems serve as early warning signals for extreme fluctuations in traditional mar- kets?” Physica A: Statistical Mechanics and its Applications , vol. 657, p. 130194, 2025

    2025

  46. [53]

    Imaging maths-inside the klein bottle,

    K. Polthier, “Imaging maths-inside the klein bottle,” online], URL: http://plus. maths. org/content/imaging-maths-inside-klein-bottle [cited 17 Jun. 2011] , 2003

    2011

  47. [54]

    Adaptive security of symbolic encryp- tion,

    D. Micciancio and S. Panjwani, “Adaptive security of symbolic encryp- tion,” in Theory of Cryptography Conference . Springer, 2005, pp. 169– 187

    2005

  48. [55]

    Braid-based cryptography,

    P. Dehornoy, “Braid-based cryptography,”Contemp. Math, vol. 360, no. 5, p. 33, 2004

    2004

  49. [56]

    Knot-based key exchange protocol,

    S. Sconza and A. Wildi, “Knot-based key exchange protocol,” Cryptology ePrint Archive, 2024

    2024

  50. [57]

    New public-key cryptosystem using braid groups,

    K. H. Ko, S. J. Lee, J. H. Cheon, J. W. Han, J.-s. Kang, and C. Park, “New public-key cryptosystem using braid groups,” in Advances in Cryp- tology—CRYPTO 2000: 20th Annual International Cryptology Confer- ence Santa Barbara, California, USA, August 20–24, 2000 Proceedings

    2000

  51. [58]

    Springer, 2000, pp. 166–183

    2000

  52. [59]

    Sym- bolic methods in computational cryptography proofs,

    G. Barthe, B. Gr´ egoire, C. Jacomme, S. Kremer, and P.-Y. Strub, “Sym- bolic methods in computational cryptography proofs,” in 2019 IEEE 32nd Computer Security Foundations Symposium (CSF). IEEE, 2019, pp. 136– 13 615

    2019

  53. [60]

    The penrose triangle and a family of related figures,

    S. W. Draper, “The penrose triangle and a family of related figures,” Perception, vol. 7, no. 3, pp. 283–296, 1978

    1978

  54. [61]

    Marr, Vision: A computational investigation into the human represen- tation and processing of visual information

    D. Marr, Vision: A computational investigation into the human represen- tation and processing of visual information . MIT press, 2010

    2010

  55. [62]

    Deceptive geometries: Spatial analysis and design through the study of visual illusions,

    D. Jonsson, “Deceptive geometries: Spatial analysis and design through the study of visual illusions,” 2022. 20

    2022

  56. [63]

    Coren and J

    S. Coren and J. Girgus, Seeing is deceiving: The psychology of visual illusions. Routledge, 2020

    2020

  57. [64]

    Use your illusion: secure authentication usable anywhere,

    E. Hayashi, R. Dhamija, N. Christin, and A. Perrig, “Use your illusion: secure authentication usable anywhere,” in Proceedings of the 4th Sympo- sium on Usable Privacy and Security , 2008, pp. 35–45

    2008

  58. [65]

    A” paradoxical

    S. Goldwasser, S. Micali, and R. L. Rivest, “A” paradoxical” solution to the signature problem,” in Providing Sound Foundations for Cryptog- raphy: On the Work of Shafi Goldwasser and Silvio Micali , 2019, pp. 265–284

    2019

  59. [66]

    Local to global geometric methods in information theory,

    E. A. Abbe, “Local to global geometric methods in information theory,” Ph.D. dissertation, Massachusetts Institute of Technology, 2008

    2008

  60. [67]

    Cognitive models in training health professionals to protect patients’ confidential information,

    V. L. Patel, J. F. Arocha, and E. H. Shortliffe, “Cognitive models in training health professionals to protect patients’ confidential information,” International journal of medical informatics , vol. 60, no. 2, pp. 143–150, 2000

    2000

  61. [68]

    Digital communication and hybrid threats,

    R. Arcos, H. Smith et al. , “Digital communication and hybrid threats,” Revista ICONO 14. Revista cient ´ ıfica de Comunicaci´ on y Tecnolog ´ ıas emergentes, vol. 19, no. 1, pp. 1–14, 2021

    2021

  62. [69]

    Limitations of quantum & the versatility of classical cryptography: a comparative study,

    R. S. Vignesh, S. Sudharssun, and K. J. Kumar, “Limitations of quantum & the versatility of classical cryptography: a comparative study,” in 2009 Second international conference on environmental and computer science . IEEE, 2009, pp. 333–337

    2009

  63. [70]

    Traffic analysis attacks on tor: A survey,

    L. Basyoni, N. Fetais, A. Erbad, A. Mohamed, and M. Guizani, “Traffic analysis attacks on tor: A survey,” in2020 IEEE International Conference on Informatics, IoT, and Enabling Technologies (ICIoT) . IEEE, 2020, pp. 183–188

    2020

  64. [71]

    A re- view of quantum cybersecurity: threats, risks and opportunities,

    M. J. H. Faruk, S. Tahora, M. Tasnim, H. Shahriar, and N. Sakib, “A re- view of quantum cybersecurity: threats, risks and opportunities,” in 2022 1st International Conference on AI in Cybersecurity (ICAIC) . IEEE, 2022, pp. 1–8

    2022

  65. [72]

    Post-quantum cryptography,

    D. J. Bernstein and T. Lange, “Post-quantum cryptography,” Nature, vol. 549, no. 7671, pp. 188–194, 2017

    2017

  66. [73]

    An overview of visual cryp- tography techniques,

    D. R. Ibrahim, J. S. Teh, and R. Abdullah, “An overview of visual cryp- tography techniques,” Multimedia Tools and Applications , vol. 80, pp. 31 927–31 952, 2021

    2021

  67. [74]

    Cognitive security: A comprehensive study of cognitive science in cybersecurity,

    R. O. Andrade and S. G. Yoo, “Cognitive security: A comprehensive study of cognitive science in cybersecurity,” Journal of Information Security and Applications, vol. 48, p. 102352, 2019. 21

    2019

  68. [75]

    Multidisciplinary in cryptology,

    S. B. S. Al Maliky and N. A. Abbas, “Multidisciplinary in cryptology,” in Multidisciplinary Perspectives in Cryptology and Information Security . IGI Global, 2014, pp. 1–28

    2014

  69. [76]

    A channel resolvability perspective on stealth communica- tions,

    M. Bloch, “A channel resolvability perspective on stealth communica- tions,” in 2015 IEEE international symposium on information theory (ISIT). IEEE, 2015, pp. 2535–2539

    2015

  70. [77]

    Hybrid cryptogra- phy and steganography method to embed encrypted text message within image,

    K. N. Jassim, A. K. Nsaif, A. K. Nseaf, A. H. Hazidar, B. Priambodo, E. Naf’an, M. Masril, I. Handriani, and Z. P. Putra, “Hybrid cryptogra- phy and steganography method to embed encrypted text message within image,” in Journal of Physics: Conference Series , vol. 1339, no. 1....

    2019

  71. [78]

    M¨ obius transformations revealed,

    D. N. Arnold and J. P. Rogness, “M¨ obius transformations revealed,” No- tices of the American Mathematical Society, vol. 55, no. 10, pp. 1226–1231, 2008

    2008

  72. [79]

    Perceptual encoding efficiency in visual search

    R. Rauschenberger and S. Yantis, “Perceptual encoding efficiency in visual search.” Journal of Experimental Psychology: General , vol. 135, no. 1, p. 116, 2006

    2006

  73. [80]

    Visual security evaluation of perceptually encrypted images based on image importance,

    T. Xiang, Y. Yang, H. Liu, and S. Guo, “Visual security evaluation of perceptually encrypted images based on image importance,” IEEE Trans- actions on Circuits and Systems for Video Technology , vol. 30, no. 11, pp. 4129–4142, 2019

    2019

  74. [81]

    Crypto-ambiguity,

    D. A. Cruse, “Crypto-ambiguity,” Recherches anglaises et nord- am´ ericaines, vol. 34, no. 1, pp. 5–18, 2001

    2001

  75. [83]

    A general quantita- tive cryptanalysis of permutation-only multimedia ciphers against plain- text attacks,

    S. Li, C. Li, G. Chen, N. G. Bourbakis, and K.-T. Lo, “A general quantita- tive cryptanalysis of permutation-only multimedia ciphers against plain- text attacks,” Signal Processing: Image Communication , vol. 23, no. 3, pp. 212–223, 2008

    2008

  76. [84]

    Matchings in graphs on non-orientable surfaces,

    G. Tesler, “Matchings in graphs on non-orientable surfaces,” Journal of Combinatorial Theory, Series B , vol. 78, no. 2, pp. 198–231, 2000

    2000

  77. [85]

    Permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes,

    T. Hehn, O. Milenkovic, S. Laendner, and J. B. Huber, “Permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes,” IEEE Transactions on Information Theory , vol. 54, no. 12, pp. 5308–5331, 2008

    2008

  78. [86]

    Image scrambling encryption algorithm of pixel bit based on chaos map,

    G. Ye, “Image scrambling encryption algorithm of pixel bit based on chaos map,” Pattern Recognition Letters, vol. 31, no. 5, pp. 347–354, 2010. 22

    2010

  79. [87]

    Self-intersections in combinatorial topology: statistical structure,

    M. Chas and S. P. Lalley, “Self-intersections in combinatorial topology: statistical structure,” Inventiones mathematicae, vol. 188, no. 2, pp. 429– 463, 2012

    2012

  80. [88]

    Based on binary encoding methods and visual cryptography schemes to hide data,

    K. T. Lin, “Based on binary encoding methods and visual cryptography schemes to hide data,” in 2012 Eighth International Conference on In- telligent Information Hiding and Multimedia Signal Processing . IEEE, 2012, pp. 59–62

    2012

  81. [89]

    Framework based on pri- vacy policy hiding for preventing unauthorized face image processing,

    A. Dabrowski, E. R. Weippl, and I. Echizen, “Framework based on pri- vacy policy hiding for preventing unauthorized face image processing,” in 2013 IEEE International Conference on Systems, Man, and Cybernetics . IEEE, 2013, pp. 455–461

    2013

  82. [90]

    A plausible approach to computer-aided cryptographic proofs,

    S. Halevi, “A plausible approach to computer-aided cryptographic proofs,” Cryptology ePrint Archive, 2005

    2005

  83. [91]

    Plausible deniability using automated linguistic stegonagraphy,

    M. Chapman and G. Davida2, “Plausible deniability using automated linguistic stegonagraphy,” in International Conference on Infrastructure Security. Springer, 2002, pp. 276–287

    2002

  84. [92]

    Automated assembling of images: Image montage preparation,

    P. Dani and S. Chaudhuri, “Automated assembling of images: Image montage preparation,” Pattern Recognition, vol. 28, no. 3, pp. 431–445, 1995

    1995

  85. [93]

    Comprehensive survey of multime- dia steganalysis: Techniques, evaluations, and trends in future research,

    D. A. Shehab and M. J. Alhaddad, “Comprehensive survey of multime- dia steganalysis: Techniques, evaluations, and trends in future research,” Symmetry, vol. 14, no. 1, p. 117, 2022

    2022

  86. [94]

    Human-readable proof of the related-key security of aes-128,

    K. Khoo, E. Lee, T. Peyrin, and S. M. Sim, “Human-readable proof of the related-key security of aes-128,” IACR Transactions on Symmetric Cryptology, pp. 59–83, 2017

    2017

  87. [95]

    A survey on visual cryptography using image encryption and decryption,

    P. C. Jena and N. K. Das, “A survey on visual cryptography using image encryption and decryption,” Int. J. Emerg. Technol. Adv. Eng , 2008

    2008

  88. [96]

    Dual-domain image encryption in unsecure medium—a secure commu- nication perspective,

    H. Mahalingam, T. Veeramalai, A. R. Menon, S. S, and R. Amirtharajan, “Dual-domain image encryption in unsecure medium—a secure commu- nication perspective,” Mathematics, vol. 11, no. 2, p. 457, 2023

    2023

  89. [97]

    New encryption techniques from lattice thought in topological cryptography,

    B. Yao, X. Wang, F. Ma, and H. Wang, “New encryption techniques from lattice thought in topological cryptography,” in 2021 IEEE 5th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), vol. 5. IEEE, 2021, pp. 467–473

    2021

  90. [98]

    Perceptual security of encrypted im- ages based on wavelet scaling analysis,

    C. Vargas-Olmos, J. Murguia, M. T. Ram ´ ırez-Torres, M. M. Carlos, H. Rosu, and H. Gonzalez-Aguilar, “Perceptual security of encrypted im- ages based on wavelet scaling analysis,” Physica A: Statistical Mechanics and its Applications , vol. 456, pp. 22–30, 2016. 23

    2016

  91. [99]

    Cryptography based on chaotic random maps with position dependent weighting probabilities,

    S. Behnia, A. Akhshani, S. Ahadpour, A. Akhavan, and H. Mahmodi, “Cryptography based on chaotic random maps with position dependent weighting probabilities,” Chaos, Solitons & Fractals , vol. 40, no. 1, pp. 362–369, 2009

    2009

  92. [100]

    Metaphors for abstract concepts: Visual art and quantum me- chanics,

    L. Stone, “Metaphors for abstract concepts: Visual art and quantum me- chanics,” Studio Research, vol. 2, pp. 14–29, 2014

    2014

  93. [101]

    Image compression and en- cryption algorithm based on compressive sensing and nonlinear diffusion,

    J. Liu, M. Zhang, X. Tong, and Z. Wang, “Image compression and en- cryption algorithm based on compressive sensing and nonlinear diffusion,” Multimedia Tools and Applications, vol. 80, pp. 25 433–25 452, 2021

    2021

  94. [102]

    Cryptanalysis and enhancements of image encryption based on three-dimensional bit matrix permutation,

    J. Wu, X. Liao, and B. Yang, “Cryptanalysis and enhancements of image encryption based on three-dimensional bit matrix permutation,” Signal Processing, vol. 142, pp. 292–300, 2018

    2018

  95. [103]

    Designing an algorithm with high avalanche effect,

    S. Ramanujam and M. Karuppiah, “Designing an algorithm with high avalanche effect,” IJCSNS International Journal of Computer Science and Network Security, vol. 11, no. 1, pp. 106–111, 2011

    2011

  96. [104]

    Bogdanov, Analysis and design of block cipher constructions

    A. Bogdanov, Analysis and design of block cipher constructions. Citeseer, 2010

    2010

  97. [105]

    Key-alternating ciphers in a provable setting: en- cryption using a small number of public permutations,

    A. Bogdanov, L. R. Knudsen, G. Leander, F.-X. Standaert, J. Steinberger, and E. Tischhauser, “Key-alternating ciphers in a provable setting: en- cryption using a small number of public permutations,” in Advances in Cryptology–EUROCRYPT 2012: 31st Annual International Conferenc...

    2012

  98. [106]

    Lightweight cipher resistivity against brute- force attack: Analysis of present,

    J. Posp ´ ıˇ sil and M. Novotn` y, “Lightweight cipher resistivity against brute- force attack: Analysis of present,” in 2012 IEEE 15th International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS). IEEE, 2012, pp. 197–198

    2012

  99. [107]

    Cryptanalysis of a chaos-based stream cipher,

    B. Zhang and C. Jin, “Cryptanalysis of a chaos-based stream cipher,” in 2008 The 9th International Conference for Young Computer Scientists . IEEE, 2008, pp. 2782–2785

    2008

  100. [108]

    Known-plaintext attack and ciphertext-only attack for encrypted single-pixel imaging,

    S. Jiao, T. Lei, Y. Gao, Z. Xie, and X. Yuan, “Known-plaintext attack and ciphertext-only attack for encrypted single-pixel imaging,” IEEE Access, vol. 7, pp. 119 557–119 565, 2019

    2019

  101. [109]

    Methods of differential fault attack on lblock with analysis of probability,

    Y. Gao, Y. Wang, Q. Yuan, T. Wang, X. Wang, and L. Guo, “Methods of differential fault attack on lblock with analysis of probability,” in 2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC). IEEE, 2018, pp. 474–479. 24

    2018

  102. [110]

    Towards a fully homomorphic symmetric cipher scheme resistant to plain-text/cipher-text attacks,

    K. Hariss and H. Noura, “Towards a fully homomorphic symmetric cipher scheme resistant to plain-text/cipher-text attacks,” Multimedia Tools and Applications, vol. 81, no. 10, pp. 14 403–14 449, 2022

    2022

  103. [111]

    Literature survey on nonlinear components and chaotic nonlinear components of block ciphers,

    I. Hussain and T. Shah, “Literature survey on nonlinear components and chaotic nonlinear components of block ciphers,” Nonlinear Dynamics, vol. 74, pp. 869–904, 2013

    2013

  104. [112]

    Binary obfuscation using signals

    I. V. Popov, S. K. Debray, and G. R. Andrews, “Binary obfuscation using signals.” in USENIX Security Symposium , 2007, pp. 275–290

    2007

  105. [113]

    Adversarial illu- sions in {Multi-Modal} embeddings,

    E. Bagdasaryan, R. Jha, V. Shmatikov, and T. Zhang, “Adversarial illu- sions in {Multi-Modal} embeddings,” in 33rd USENIX Security Sympo- sium (USENIX Security 24) , 2024, pp. 3009–3025

    2024

  106. [114]

    Image semantic steganography: A way to hide information in semantic communication,

    Y. Huo, S. Xiang, X. Luo, and X. Zhang, “Image semantic steganography: A way to hide information in semantic communication,” IEEE Transac- tions on Circuits and Systems for Video Technology , 2024

    2024

  107. [115]

    Image transformation- based defense against adversarial perturbation on deep learning models,

    A. Agarwal, R. Singh, M. Vatsa, and N. Ratha, “Image transformation- based defense against adversarial perturbation on deep learning models,” IEEE Transactions on Dependable and Secure Computing , vol. 18, no. 5, pp. 2106–2121, 2020

    2020

  108. [116]

    Camouflage and visual perception,

    T. Troscianko, C. P. Benton, P. G. Lovell, D. J. Tolhurst, and Z. Pizlo, “Camouflage and visual perception,” Philosophical Transactions of the Royal Society B: Biological Sciences, vol. 364, no. 1516, pp. 449–461, 2009

    2009

  109. [117]

    A cryptographic analysis of opacity,

    ¨O. Dagdelen, M. Fischlin, T. Gagliardoni, G. A. Marson, A. Mittel- bach, and C. Onete, “A cryptographic analysis of opacity,” in Com- puter Security–ESORICS 2013: 18th European Symposium on Research in Computer Security, Egham, UK, September 9-13, 2013. Proceedings 18. Spring...

    2013

  110. [118]

    Unicode steganographic exploits: maintaining enterprise border security,

    F. J. Mabry, J. R. James, and A. J. Ferguson, “Unicode steganographic exploits: maintaining enterprise border security,” IEEE Security & Pri- vacy, vol. 5, no. 5, pp. 32–39, 2007

    2007

  111. [119]

    Light lies: Optical adversarial attack,

    K. Kim, J. Kim, S. Song, J.-H. Choi, C. Joo, and J.-S. Lee, “Light lies: Optical adversarial attack,” arXiv preprint arXiv:2106.09908 , 2021

    2021 arXiv

  112. [120]

    Transmission error and compres- sion robustness of 2d chaotic map image encryption schemes,

    M. Gschwandtner, A. Uhl, and P. Wild, “Transmission error and compres- sion robustness of 2d chaotic map image encryption schemes,” EURASIP Journal on Information Security , vol. 2007, pp. 1–16, 2007

    2007

  113. [121]

    Shield: Vulnerability-driven network filters for preventing known vulnerability ex- ploits,

    H. J. Wang, C. Guo, D. R. Simon, and A. Zugenmaier, “Shield: Vulnerability-driven network filters for preventing known vulnerability ex- ploits,” in Proceedings of the 2004 conference on Applications, technolo- gies, architectures, and protocols for computer communications, 20...

    2004

  114. [122]

    Illusions in the spatial sense of the eye: Geometrical– optical illusions and the neural representation of space,

    G. Westheimer, “Illusions in the spatial sense of the eye: Geometrical– optical illusions and the neural representation of space,” Vision research, vol. 48, no. 20, pp. 2128–2142, 2008

    2008

  115. [123]

    Towards coding for human and machine vision: A scalable image coding approach,

    Y. Hu, S. Yang, W. Yang, L.-Y. Duan, and J. Liu, “Towards coding for human and machine vision: A scalable image coding approach,” in 2020 IEEE International Conference on Multimedia and Expo (ICME) . IEEE, 2020, pp. 1–6

    2020

  116. [124]

    Cryptography techniques and internet of things applications–a modern survey,

    S. Sarveswaran, G. Shangkavi, N. Gowthaman, and S. Vasanthaseelan, “Cryptography techniques and internet of things applications–a modern survey,” Int. J. of Aquatic Science , vol. 12, no. 2, pp. 2338–2371, 2021

    2021

  117. [125]

    A comprehensive analysis of crypto- graphic algorithms: Evaluating security, efficiency, and future challenges,

    D. Ramakrishna and M. A. Shaik, “A comprehensive analysis of crypto- graphic algorithms: Evaluating security, efficiency, and future challenges,” IEEE Access, 2024

    2024

  118. [126]

    Lindell, Tutorials on the Foundations of Cryptography

    Y. Lindell, Tutorials on the Foundations of Cryptography. Springer, 2017

    2017

  119. [127]

    The illusion of visual security: Reconstructing perceptually encrypted images,

    Y. Yang, T. Xiang, X. Lv, S. Guo, and T. Zeng, “The illusion of visual security: Reconstructing perceptually encrypted images,” IEEE Transac- tions on Circuits and Systems for Video Technology , vol. 34, no. 5, pp. 3998–4010, 2023

    2023

  120. [128]

    Quantum cryp- tography: Overview, security issues and future challenges,

    S. Mitra, B. Jana, S. Bhattacharya, P. Pal, and J. Poray, “Quantum cryp- tography: Overview, security issues and future challenges,” in 2017 4th international conference on opto-electronics and applied optics (optronix). IEEE, 2017, pp. 1–7

    2017

  121. [129]

    Classification and identification of classical cipher type using artificial neural networks,

    A. J. Abd and S. Al-Janabi, “Classification and identification of classical cipher type using artificial neural networks,” Journal of Engineering and Applied Sciences, vol. 14, no. 11, pp. 3549–3556, 2019

    2019

  122. [130]

    A key-recovery timing attack on post-quantum primitives using the fujisaki-okamoto transformation and its application on frodokem,

    Q. Guo, T. Johansson, and A. Nilsson, “A key-recovery timing attack on post-quantum primitives using the fujisaki-okamoto transformation and its application on frodokem,” in Annual International Cryptology Confer- ence. Springer, 2020, pp. 359–386

    2020

  123. [131]

    Post-quantum lattice-based cryptography implementations: A survey,

    H. Nejatollahi, N. Dutt, S. Ray, F. Regazzoni, I. Banerjee, and R. Cam- marota, “Post-quantum lattice-based cryptography implementations: A survey,” ACM Computing Surveys (CSUR) , vol. 51, no. 6, pp. 1–41, 2019

    2019

  124. [132]

    A comprehensive review of post-quantum cryptography: Challenges and advances,

    S. M. Hosseini and H. Pilaram, “A comprehensive review of post-quantum cryptography: Challenges and advances,” Cryptology ePrint Archive , 2024

    2024

  125. [133]

    Analysis of various data security techniques of steganography: A survey,

    S. Dhawan and R. Gupta, “Analysis of various data security techniques of steganography: A survey,” Information Security Journal: A Global Perspective, vol. 30, no. 2, pp. 63–87, 2021. 26

    2021

  126. [134]

    A review on methods for image authenti- cation and visual cryptography in digital image watermarking,

    C. Vyas and M. Lunagaria, “A review on methods for image authenti- cation and visual cryptography in digital image watermarking,” in 2014 IEEE International Conference on Computational Intelligence and Com- puting Research. IEEE, 2014, pp. 1–6

    2014

  127. [135]

    Vulnerability detection and improvements of an image cryptosystem for real-time visual protection,

    M. Z. Talhaoui, Z. Wang, M. A. Midoun, A. Smaili, D. E. Mekkaoui, M. Lablack, and K. Zhang, “Vulnerability detection and improvements of an image cryptosystem for real-time visual protection,” ACM Trans- actions on Multimedia Computing, Communications and Applications , vol. 2...

    2025

  128. [136]

    Second topological conjugate transformation in symbolic dynamics,

    S.-L. Peng and X.-S. Zhang, “Second topological conjugate transformation in symbolic dynamics,” Physical Review E , vol. 57, no. 5, p. 5311, 1998

    1998

  129. [137]

    Linguistic gen- erative steganography with enhanced cognitive-imperceptibility,

    Z. Yang, L. Xiang, S. Zhang, X. Sun, and Y. Huang, “Linguistic gen- erative steganography with enhanced cognitive-imperceptibility,” IEEE Signal Processing Letters, vol. 28, pp. 409–413, 2021

    2021

  130. [138]

    To- wards a quantum resistance standard based on epitaxial graphene,

    A. Tzalenchuk, S. Lara-Avila, A. Kalaboukhov, S. Paolillo, M. Syv¨ aj¨ arvi, R. Yakimova, O. Kazakova, T. Janssen, V. Fal’Ko, and S. Kubatkin, “To- wards a quantum resistance standard based on epitaxial graphene,” Na- ture nanotechnology, vol. 5, no. 3, pp. 186–189, 2010

    2010

  131. [139]

    Deploying hybrid quantum-secured infrastructure for ap- plications: When quantum and post-quantum can work together,

    A. K. Fedorov, “Deploying hybrid quantum-secured infrastructure for ap- plications: When quantum and post-quantum can work together,” Fron- tiers in Quantum Science and Technology , vol. 2, p. 1164428, 2023

    2023

  132. [140]

    A multilayered security scheme for data encryption and decryption for stronger security towards post-quantum cryptography in cloud computing,

    L. L. Scientific, “A multilayered security scheme for data encryption and decryption for stronger security towards post-quantum cryptography in cloud computing,” Journal of Theoretical and Applied Information Tech- nology, vol. 103, no. 11, 2025

    2025

  133. [141]

    Post-quantum stealth address protocols,

    M. Mikic, M. Srbakoski, and S. Praska, “Post-quantum stealth address protocols,” arXiv preprint arXiv:2501.13733 , 2025

    2025 arXiv

  134. [142]

    Psychological defenses in cyberspace: Un- veiling the significance of cognitive shields in cybersecurity,

    B. Singh and S. S. Cheema, “Psychological defenses in cyberspace: Un- veiling the significance of cognitive shields in cybersecurity,”International Journal of Advanced Networking and Applications, vol. 16, no. 1, pp. 6291– 6295, 2024

    2024

  135. [143]

    Secure communication under channel uncertainty and adversarial attacks,

    R. F. Schaefer, H. Boche, and H. V. Poor, “Secure communication under channel uncertainty and adversarial attacks,” Proceedings of the IEEE , vol. 103, no. 10, pp. 1796–1813, 2015

    2015

  136. [144]

    Visually meaningful cipher data concealment,

    Z. Shamsi, L. Waikhom, A. K. Saha, R. Patgiri, M. F. Singha, and D. S. Laiphrakpam, “Visually meaningful cipher data concealment,” Digital Signal Processing, vol. 155, p. 104717, 2024. 27

    2024

  137. [145]

    Walking through firewalls: Circumventing cen- sorship of social media and online content in a networked authoritarian context,

    A. Dal and E. C. Nisbet, “Walking through firewalls: Circumventing cen- sorship of social media and online content in a networked authoritarian context,” Social Media+ Society , vol. 8, no. 4, p. 20563051221137738, 2022

    2022

  138. [146]

    Securing crisis maps in conflict zones,

    G. Chamales and R. Baker, “Securing crisis maps in conflict zones,” in 2011 IEEE Global Humanitarian Technology Conference . IEEE, 2011, pp. 426–430

    2011

  139. [147]

    Message concealment techniques using image based steganography,

    F. Khan and A. Gutub, “Message concealment techniques using image based steganography,” 2007

    2007

  140. [148]

    Exploring steganography: Seeing the un- seen,

    N. F. Johnson and S. Jajodia, “Exploring steganography: Seeing the un- seen,” Computer, vol. 31, no. 2, pp. 26–34, 1998

    1998

  141. [149]

    Digital steganography and watermarking for digital images: A review of current research direc- tions,

    O. Evsutin, A. Melman, and R. Meshcheryakov, “Digital steganography and watermarking for digital images: A review of current research direc- tions,” IEEE Access, vol. 8, pp. 166 589–166 611, 2020

    2020

  142. [150]

    Ip core steganography for protecting dsp kernels used in ce systems,

    A. Sengupta and M. Rathor, “Ip core steganography for protecting dsp kernels used in ce systems,” IEEE Transactions on Consumer Electronics, vol. 65, no. 4, pp. 506–515, 2019

    2019

  143. [151]

    Robust digital watermarking techniques for copyright protection of digital data: A survey,

    P. Kadian, S. M. Arora, and N. Arora, “Robust digital watermarking techniques for copyright protection of digital data: A survey,” Wireless Personal Communications, vol. 118, pp. 3225–3249, 2021

    2021

  144. [152]

    Image steganography for authenticity of visual contents in social networks,

    K. Muhammad, J. Ahmad, S. Rho, and S. W. Baik, “Image steganography for authenticity of visual contents in social networks,” Multimedia Tools and Applications, vol. 76, pp. 18 985–19 004, 2017

    2017

  145. [153]

    Image steganography based on swarm intelligence algorithms: A survey,

    D. A. Zebari, D. Q. Zeebaree, J. N. Saeed, N. A. Zebari, and A. Adel, “Image steganography based on swarm intelligence algorithms: A survey,” people, vol. 7, no. 8, p. 9, 2020

    2020

  146. [154]

    Encoding and decoding the message,

    S. Hall, “Encoding and decoding the message,” The discourse studies reader: Main currents in theory and analysis , pp. 111–121, 2014

    2014

  147. [155]

    Decoding the visual and subjective contents of the human brain,

    Y. Kamitani and F. Tong, “Decoding the visual and subjective contents of the human brain,” Nature neuroscience, vol. 8, no. 5, pp. 679–685, 2005

    2005

  148. [156]

    Integrating fault detection and classification in microgrids using supervised machine learning consid- ering fault resistance uncertainty,

    M. Barkhi, J. Pourhossein, and S. A. Hosseini, “Integrating fault detection and classification in microgrids using supervised machine learning consid- ering fault resistance uncertainty,” Scientific Reports , vol. 14, no. 1, p. 28466, 2024

    2024

  149. [157]

    A touch-based multimodal and cryptographic bio-human–machine interface,

    S. Lin, J. Zhu, W. Yu, B. Wang, K. A. Sabet, Y. Zhao, X. Cheng, H. Ho- jaiji, H. Lin, J. Tan et al., “A touch-based multimodal and cryptographic bio-human–machine interface,” Proceedings of the National Academy of Sciences, vol. 119, no. 15, p. e2201937119, 2022. 28

    2022

  150. [158]

    In-depth review of aug- mented reality: Tracking technologies, development tools, ar displays, col- laborative ar, and security concerns,

    T. A. Syed, M. S. Siddiqui, H. B. Abdullah, S. Jan, A. Namoun, A. Alzahrani, A. Nadeem, and A. B. Alkhodre, “In-depth review of aug- mented reality: Tracking technologies, development tools, ar displays, col- laborative ar, and security concerns,” Sensors, vol. 23, no. 1, p. 146, 2022

    2022

  151. [159]

    Founding cryptography on tamper-proof hardware tokens,

    V. Goyal, Y. Ishai, A. Sahai, R. Venkatesan, and A. Wadia, “Founding cryptography on tamper-proof hardware tokens,” in Theory of Cryptogra- phy: 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzer- land, February 9-11, 2010. Proceedings 7 . Springer, 2010, pp. 308–326

    2010

  152. [160]

    Storing authenticity at the surface and into the depths: Securing paper with human-and machine-readable devices 1,

    A. Kaminska, “Storing authenticity at the surface and into the depths: Securing paper with human-and machine-readable devices 1,” In- term´ edialit´ es, no. 32, 2018

    2018

  153. [161]

    Hnn-qc n: Hybrid neural network with multiple backbones and quantum transformation as data augmentation technique,

    Y. Gordienko, Y. Trochun, V. Taran, A. Khmelnytskyi, and S. Stirenko, “Hnn-qc n: Hybrid neural network with multiple backbones and quantum transformation as data augmentation technique,” AI, vol. 6, no. 2, p. 36, 2025

    2025

  154. [162]

    Structural obfuscation and crypto- steganography-based secured jpeg compression hardware for medical imaging systems,

    A. Sengupta and M. Rathor, “Structural obfuscation and crypto- steganography-based secured jpeg compression hardware for medical imaging systems,” IEEE Access, vol. 8, pp. 6543–6565, 2020

    2020

  155. [163]

    Defense in depth approach on aes cryptographic decryption core to enhance reliability,

    G. Yendamury and N. Mohankumar, “Defense in depth approach on aes cryptographic decryption core to enhance reliability,” in2021 IEEE Inter- national IOT, Electronics and Mechatronics Conference (IEMTRONICS). IEEE, 2021, pp. 1–7

    2021

  156. [164]

    Flatness versus depth: A study of algorithmically generated camouflage,

    S. Mollicchi, “Flatness versus depth: A study of algorithmically generated camouflage,” Security Dialogue, vol. 48, no. 1, pp. 78–94, 2017. 29

    2017

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.