An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization
Open accessThe DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
Elliptic curves (ECs) are considered as one of the highly secure structures against modern computational attacks. In this paper, we present an efficient method based on an ordered isomorphic EC for the generation of a large number of distinct, mutually uncorrelated, and cryptographically strong injective S-boxes. The proposed scheme is characterized in terms of time complexity and the number of the distinct S-boxes. Furthermore, rigorous analysis and comparison of the newly developed method with some of the existing methods are conducted. Experimental results reveal that the newly developed scheme can efficiently generate a large number of distinct, uncorrelated, and secure S-boxes when compared with some of the well-known existing schemes.
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
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Use of Elliptic Curves in Cryptography
Miller, V. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_31 · Cited by 3,946
Daemen, J., & Rijmen, V. (2002) · Information Security and Cryptography · doi:10.1007/978-3-662-04722-4 · Cited by 2,437
Introduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069
Factoring Integers with Elliptic Curves
Lenstra, H. W. (1987) · The Annals of Mathematics · doi:10.2307/1971363 · Cited by 974
Description of a new variable-length key, 64-bit block cipher (Blowfish)
Schneier, B. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58108-1_24 · Cited by 791
A Proposal for a New Block Encryption Standard
Lai, X., & Massey, J. L. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3_35 · Cited by 608
A novel method for designing S-boxes based on chaotic maps
Tang, G., Liao, X., & Chen, Y. (2005) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2004.04.023 · Cited by 248
A method for designing strong S-Boxes based on chaotic Lorenz system
Özkaynak, F., & Özer, A. B. (2010) · Physics Letters A · doi:10.1016/j.physleta.2010.07.019 · Cited by 235
An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps
Chen, G., Chen, Y., & Liao, X. (2007) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2005.10.022 · Cited by 209
Cited by
A Novel Modular Approach Based Substitution-Box Design for Image Encryption
Zahid, A. H., Alsolami, E., & Ahmad, M. (2020) · IEEE Access · doi:10.1109/access.2020.3016401 · Cited by 116
“…used the knowledge areas to design S-boxes like linear fractional transformation [30]–[32], DNA computing [5], [33], [34], elliptic curve [35], [36], graph theory [37], [38], optimization techniques [39]–[43], cellular automata [44], etc. Dynamic and key-dependent S-box construction techniques…”
BackgroundEfficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography
Ibrahim, S., & Alharbi, A. A. (2020) · IEEE Access · doi:10.1109/access.2020.3032403 · Cited by 112
Efficient key-dependent dynamic S-boxes based on permutated elliptic curves
Ibrahim, S., & Abbas, A. M. (2021) · Information Sciences · doi:10.1016/j.ins.2021.01.014 · Cited by 91
A substitution box generator, its analysis, and applications in image encryption
Azam, N. A., Hayat, U., & Ayub, M. (2021) · Signal Processing · doi:10.1016/j.sigpro.2021.108144 · Cited by 81
Self-citationAhmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A. (2020) · IEEE Access · doi:10.1109/access.2020.3001868 · Cited by 71
“Of late, the S-boxes have been smeared in various security application areas such as image encryption, watermarking, steganography, etc., [16]–[20].”
Background
Metadata
- Authors
- Azam, N. A., Hayat, U., & Ullah, I.
- Affiliations
- Kyoto University (JP)
- Quaid-i-Azam University (PK)
- Corresponding author
- Azam, Naveed Ahmed
- Venue
- Security and Communication Networks
- Publisher
- Wiley
- Published
- 2018-12-02
- Volume
- 2018
- Pages
- 1-9
- ISSN
- 1939-0114 (ISSN-L)
- 1939-0122
- OpenAlex
- W2902630202
- Cited by
- 56
- References
- 25
- Citations by year
- 2026: 2 · 2025: 6 · 2024: 5 · 2023: 9 · 2022: 8 · 2021: 10 · 2020: 16
- FWCI
- 3.64
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- Security and Communication Networks (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- Funders
- Japan Society for the Promotion of Science (18J23484)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- S-box design, elliptic curves, S-box generation, time complexity
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization. https://app.cochat.ai/papers/10.1155/2018/3421725
- The paper
- Azam, N. A., Hayat, U., & Ullah, I. (2018). An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization. Security and Communication Networks. https://doi.org/10.1155/2018/3421725
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.

