CoChat

An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization

Open access
Azam, Naveed Ahmed, Hayat, Umar, Ullah, Ikram · 2018 · Security and Communication Networks

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1155/2018/3421725

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Correlation analysis.
Figure 1 Correlation analysis.CC-BY · From the PDF
Image 2
CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 9

  1. B. Schneier, The Twofish Encryption Algorithm: A 128-Bit Block Cipher, John Wiley and Sons Inc, New York, NY, USA, 1999, ISBN: 0471353817.
  2. S. El-Ramly, T. El-Garf, and A. Soliman, "Dynamic generation of s-boxes in block cipher systems, " in Proceedings of the Eighteenth National Radio Science Conference. NRSC'2001, pp. 389-397, Mansoura, Egypt.
  3. Y. Wu, J. P. Noonan, and S. Agaian, "Dynamic and implicit latin square doubly stochastic S-boxes with reversibility, " in Proceed- ings of the 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011, pp. 3358-3364, USA, October 2011.
  4. J. Peng, S. Jin, L. Lei, and X. Liao, "Construction and analysis of dynamic S-boxes based on spatiotemporal chaos, " in Pro- ceedings of the 11th IEEE International Conference on Cognitive Informatics and Cognitive Computing, ICCI*CC 2012, pp. 274- 278, Japan, August 2012.
  5. N. Koblitz, A Course in Number Theory and Cryptography, Springer, New York, NY, USA, 1994.
  6. X. Fang and Y. Wu, "Investigation into the elliptic curve cryptography, " in Proceedings of the 3rd International Conference on Information Management, ICIM 2017, pp. 412-415, China, April 2017.
  7. N. A. Azam, U. Hayat, and I. Ullah, Efficient Construction of S- boxes Based on a Mordell Elliptic Curve Over a Finite Field, 1809, https://arxiv.org/pdf/1809.11057.pdf. · arXiv
  8. L. C. Washington, Elliptic Curves Number Theory and Cryp- tography, Discrete Mathematics and its Applications, Discrete Mathematics and its Applications, Chapman & Hall/CRC, University of Maryland College Park, College Park, MD, USA, 2nd edition, 2008.
  9. Y. Wang, L. Yang, . Min Li, and S. Song, "A method for designing S-box based on chaotic neural network, " in Proceedings of the 2010 Sixth International Conference on Natural Computation (ICNC), pp. 1033-1037, Yantai, China, August 2010.

Cited by

See all 56

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
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

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.