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
Research works printed but not linked: 9
- B. Schneier, The Twofish Encryption Algorithm: A 128-Bit Block Cipher, John Wiley and Sons Inc, New York, NY, USA, 1999, ISBN: 0471353817.
- 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.
- 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.
- 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.
- N. Koblitz, A Course in Number Theory and Cryptography, Springer, New York, NY, USA, 1994.
- 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.
- 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
- 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.
- 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
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 113
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].”
BackgroundA Novel Construction of Dynamic S-Box With High Nonlinearity Using Heuristic Evolution
Zahid, A. H., Iliyasu, A. M., Ahmad, M., Shaban, M. M. U., Arshad, M. J., Alhadawi, H. S., & El‐Latif, A. A. A. (2021) · IEEE Access · doi:10.1109/access.2021.3077194 · Cited by 72
“Many researchers have employed other knowledge zones to construct S-boxes like cellular automata [37], graph theory [38], [39], elliptic curve [40], [41], optimization techniques [32], [42]–[45], etc. Advanced Encryption Standard (AES) is one of the eminent symmetric block ciphers that utilize…”
BackgroundEvolving Dynamic S-Boxes Using Fractional-Order Hopfield Neural Network Based Scheme
Ahmad, M., & Alsolami, E. (2020) · Entropy · doi:10.3390/e22070717 · Cited by 51
“S-boxes mainly against these security properties [37–41].”
BackgroundInfluentialA Novel Scheme of Substitution-Box Design Based on Modified Pascal’s Triangle and Elliptic Curve
Siddiqui, N., Naseer, A., & Ehatisham-ul-Haq, M. (2020) · Wireless Personal Communications · doi:10.1007/s11277-020-07832-y · Cited by 51
Dynamic S-Box Design Using a Novel Square Polynomial Transformation and Permutation
Zahid, A. H., Rashid, H., Shaban, M. M. U., Ahmad, S., Ahmed, E., Amjad, M. T., Baig, M. A. T., Arshad, M. J., Tariq, M. N., Tariq, M. W., et al. (2021) · IEEE Access · doi:10.1109/access.2021.3086717 · Cited by 51
“Several investigators have exploited other knowledge domains to produce substitution boxes like elliptic curve [28], [29], graph theory [30], [31], cellular automata [32], wavelet domain [33], optimization techniques [17], [34]–[36], Hilbert curve [37], backtracking [38], feedback systems [39],…”
BackgroundBlock cipher’s nonlinear component design by elliptic curves: an image encryption application
Haider, M. I., Ali, A., Shah, D., & Shah, T. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09892-5 · Cited by 45
“To consider the characteristic of the digital image, various image encryption schemes have been designed on the basis of different mathematical structures, including SCAN-CA [11], circular random grids [12], Ordered elliptic curve [5], (n, k, p)-Gray code for image [55], Self-adaptive wave transmission [31], vector qu…”
BackgroundMethodA New Dynamic Substitution Box for Data Security Using an Innovative Chaotic Map
Manzoor, A., Zahid, A. H., & Hassan, M. T. (2022) · IEEE Access · doi:10.1109/access.2022.3184012 · Cited by 47
A fast and secure public-key image encryption scheme based on Mordell elliptic curves
Azam, N. A., Ullah, I., & Hayat, U. (2020) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2020.106371 · Cited by 46
Self-citationHayat, U., Azam, N. A., Gallegos-Ruiz, H. R., Naz, S., & Batool, L. (2021) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-021-05666-9 · Cited by 45
“An S-box generator is suitable for cryptographic purposes if it can efficiently generate highly dynamic S-boxes with good cryptographic properties such as nonlinearity, linear approximation probability, algebraic complexity, differential approximation probability, strict avalanche criterion and bit independence criter…”
BackgroundSelf-citationA Novel Image Encryption Scheme Based on Elliptic Curves over Finite Rings
Hayat, U., Ullah, I., Azam, N. A., & Azhar, S. (2022) · Entropy · doi:10.3390/e24050571 · Cited by 43
“C N1 = [461, 885, 399, 435, 323, 867, 519, 1087, 354, 508, 312, 594, 683, 1156, 352, 1268] N2 = [424, 36, 544, 568, 154, 282, 473, 916, 851, 45, 1014, 814, 312, 708, 503, 835]”
Self-citationA novel deterministic substitution box generator over elliptic curves for real-time applications
Khan, M. A. M., Azam, N. A., Hayat, U., & Kamarulhaili, H. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.11.012 · Cited by 42
“…Gautam et al., 2015; Farah et al., 2020; Farah et al., 2017; El-Latif et al., 2020; Hayat et al., 2018; Hayat and Azam, 2019; Azam et al., 2019; Azam et al., 2018; Ullah et al., 2020; Hayat et al., 2021; Azam et al., 2021a; Chen, 2008; Bhattacharya et al., 2007; Abd EL-Latif et al., 2019;…”
InfluentialSelf-citationEfficient and secure substitution box and random number generators over Mordell elliptic curves
Ullah, I., Azam, N. A., & Hayat, U. (2020) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2020.102619 · Cited by 46
Self-citationMurtaza, G., Azam, N. A., & Hayat, U. (2021) · Security and Communication Networks · doi:10.1155/2021/3367521 · Cited by 41
“ese results are shown in Figure 4(b) from which it is clear that the proposed generator has a smaller number of fixed points than the generators in [47, 48, 51, 53] and is comparable with the generator in [11, 27, 28]; for convenience, we denote the total number of fixed points by # fixed points.”
BackgroundMethodResultSelf-citationEvolving Nonlinear S-Boxes With Improved Theoretical Resilience to Power Attacks
Freyre-Echevarría, A., Martínez-Díaz, I., Legón-Pérez, C. M., Sosa-Gómez, G., & Rojas, O. (2020) · IEEE Access · doi:10.1109/access.2020.3035163 · Cited by 36
“Besides the aforementioned, there are some recently published papers that combine chaotic number generators, elliptic curves, quantum computing, and heuristic methods in the design of dynamic and key-dependent S-boxes with good cryptographic properties [22]–[27], [50]–[55].”
BackgroundSubstitution box generator with enhanced cryptographic properties and minimal computation time
Haider, T., Azam, N. A., & Hayat, U. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122779 · Cited by 38
Self-citationImage Encryption Using Elliptic Curves and Rossby/Drift Wave Triads
Ullah, I., Hayat, U., & Bustamante, M. D. (2020) · Entropy · doi:10.3390/e22040454 · Cited by 28
“In the present scheme, MECs are used opposite to [31], in the sense that now, for each input image, the generation of a dynamic S-box is guaranteed [34].”
MethodSelf-citationConstruction of Optimized Dynamic S-Boxes Based on a Cubic Modular Transform and the Sine Function
Zahid, A. H., Ahmad, M., Alkhayyat, A. H., Arshad, M. J., Shaban, M. M. U., Soliman, N. F., & Algarni, A. D. (2021) · IEEE Access · doi:10.1109/access.2021.3113338 · Cited by 27
“Many researchers have investigated other domains of knowledge for the generation of S-boxes like optimization techniques [42]–[45], elliptic curve [46], [47], cellular automata [48], graph theory [49], [50], backtracking [51], etc.”
BackgroundDynamic S-Box Generation Using Novel Chaotic Map with Nonlinearity Tweaking
Zahid, A. H., Arshad, M. J., Ahmad, M., Soliman, N. F., & El‐Shafai, W. (2023) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2023.037516 · Cited by 31
Efficient image encryption algorithm based on ECC and dynamic S-box
Murtaza, G., & Hayat, U. (2025) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2025.104004 · Cited by 36
Self-citationA novel s-box generation method based on metastable inducing over FPGA for block ciphers
Garıpcan, A. M., Aydın, Y., & Özkaynak, F. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.112968 · Cited by 28
Ali, A., Khan, M. A., Ayyasamy, R. K., & Wasif, M. (2022) · PeerJ Computer Science · doi:10.7717/peerj-cs.940 · Cited by 27
An efficient image encryption scheme using Fresnelet transform and elliptic curve based scrambling
Farwa, S., Bibi, N., & Muhammad, N. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09324-4 · Cited by 21
“The elliptic curve implemented in O ( 2 N . log N + log p ) , where p ≡ 2 ( mod 3 ) [7].”
BackgroundAydın, Y., Garıpcan, A. M., & Özkaynak, F. (2024) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-024-09251-8 · Cited by 29
Aziz, H., Gilani, S. M. M., Hussain, I., & Abbas, M. A. (2020) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-020-00917-4 · Cited by 19
Tegue, G. A. G., Nkapkop, J. D. D., Abdel, M. A., Tsafack, N., Musheer, A., Signing, V. R. F., Effa, J. Y., & Tamba, J. G. (2023) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-023-07715-x · Cited by 22
Designing Pair of Nonlinear Components of a Block Cipher over Gaussian Integers
Sajjad, M., Shah, T., & Serna, R.-J. (2023) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2023.035347 · Cited by 19
Bilal, M., Murtaza, G., Demır, B., Bustamante, M. D., & Hayat, U. (2024) · Alexandria Engineering Journal · doi:10.1016/j.aej.2024.11.014 · Cited by 19
Self-citationAhmad, M., & Alsolami, E. (2020) · Complexity · doi:10.1155/2020/8868884 · Cited by 19
“Substitution-boxes are decisive components of symmetric-key algorithms as they are the only nonlinear transformation that transforms inputs to outputs in some nonlinear fashion [7].”
BackgroundBinary Galois field extensions dependent multimedia data security scheme
Shah, D., & Shah, T. (2020) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2020.103181 · Cited by 14
Construction of nonlinear component of block cipher using coset graph
Waheed, A., Subhan, F., Su’ud, M. M., Malik, M. Y. H., Mirza, A., & Afzal, F. (2023) · AIMS Mathematics · doi:10.3934/math.20231104 · Cited by 13
Design of Nonlinear Components Over a Mordell Elliptic Curve on Galois Fields
Hilal, A. M., Al‐Wesabi, F. N., Alamgeer, M., Hamza, M. A., Mahzari, M. A., & Almekhlafi, M. A. A. (2021) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2022.022224 · Cited by 16
Text Encryption Using Pell Sequence and Elliptic Curves with Provable Security
Azhar, S., Azam, N. A., & Hayat, U. (2022) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2022.023685 · Cited by 14
Self-citationConstruction of 4 × 4 Substitution Box Using Elliptic Curves and Algebraic Group Structures
Arshad, S. (2023) · Wireless Personal Communications · doi:10.1007/s11277-023-10526-w · Cited by 12
“…of the confusion component propagates new queries about the construction methodologies such as Boolean functions-based [17, 18], Chaos-based [7, 8, 20, 21, 25, 26, 34], algebraic group structure-based [1, 2, 10, 11, 13, 14, 22, 29], Heuristic and optimization techniques [9, 16, 32, 33, 35].”
BackgroundMethodSecure Key-Based Substitution-Boxes Design Using Systematic Search for High Nonlinearity
Zahid, A. H., Elahi, H. A. M., Ahmad, M., Maghrabi, L. A., & Agieb, R. S. (2023) · IEEE Access · doi:10.1109/access.2023.3339389 · Cited by 11
“As a result, many cryptographers have proposed diverse techniques for S-box design over time including the use of elliptic curves [9], [10], [11], [12], DNA computing [13], [14], optimization techniques [15], [16], [17], [18], cellular automata [19], linear fractional transformation [20], [21],…”
BackgroundAn Efficient S‐Box Generation With Mutation Optimization for Secure Image Encryption
Ejaz, A., Murtaza, G., Haider, T., Azam, N. A., & Hayat, U. (2025) · Security and Privacy · doi:10.1002/spy2.70068 · Cited by 10
“Azam et al. [17] proposed an innovative approach for generating S-boxes with MECs, ensuring that each valid input results in a corresponding S-box.”
InfluentialSelf-citationNetwork Security by Merging two Robust Tools from the Mathematical Firmament
Andreou, A., Mavromoustakis, C. X., Mastorakis, G. N., & Batalla, J. M. (2021) · International Conference on Mobility, Sensing and Networking (MSN) · doi:10.1109/msn53354.2021.00094 · Cited by 8
A dynamic S-box algorithm based on special supersingular elliptic curve
Hussain, M. H., Bashir, Z., & Malik, M. G. A. (2025) · Integration · doi:10.1016/j.vlsi.2024.102340 · Cited by 8
An LA-group based design of the non-linear component of block cipher
Mumtaz, S., Sanam, N., & Haq, T. U. (2023) · Integration · doi:10.1016/j.vlsi.2023.06.004 · Cited by 7
Design of Nonlinear Component of Block Cipher Using Gravesian Octonion Integers
Irfan, M., Shah, T., Siddiqui, G. F., Rehman, A. U., Saba, T., & Bahaj, S. A. (2022) · IEEE Access · doi:10.1109/access.2022.3217211 · Cited by 6
“Like, in [24] and [27], there is no guarantee of establishing S-boxes on both coordinates x and y .”
BackgroundMethodInfluentialMordell Elliptic Curve Based Design of Nonlinear Component of Block Cipher
Rehman, H. U., Shah, T., Hazzazi, M. M., Alshehri, A., & Bassfar, Z. (2022) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2022.028765 · Cited by 9
Construction of S-boxes from cyclic group of residue class of noncommutative quaternion integers
Aveem, M., & Shah, T. (2024) · Multimedia Tools and Applications · doi:10.1007/s11042-023-17906-1 · Cited by 6
“If an S-box generation technique can efficiently construct a multitude of mutually uncorrelated and secure S-boxes, it is said to be good for encryption of data [22].”
Enumerating Discrete Resonant Rossby/Drift Wave Triads and Their Application in Information Security
Hayat, U., Ullah, I., Murtaza, G., Azam, N. A., & Bustamante, M. D. (2022) · Mathematics · doi:10.3390/math10234395 · Cited by 5
Self-citationDynamic fractional chaotic biometric isomorphic elliptic curve for partial image encryption
Kamal, A., Hagras, E. A. A., & El-Kamchochi, H. A. (2021) · Computer Science and Information Systems · doi:10.2298/csis200502018k · Cited by 4
“In[16] present based on an ordered isomorphic EC for generating a large number of distinct, mutually uncorrelated, and cryptographically injective S-boxes.”
BackgroundEfficient and Secure Montgomery Curve Based Substitution Box Generator With Optimal Nonlinearity
Ullah, I., Arif, S., Abbas, F., & Hayat, U. (2025) · Security and Privacy · doi:10.1002/spy2.70168 · Cited by 4
Self-citationEfficient lattice-based Mordell elliptic curve S-box for secure lightweight cryptography
Malik, M. G. A., Hussain, M. H., & Bashir, Z. (2025) · Integration · doi:10.1016/j.vlsi.2025.102505 · Cited by 2
Elliptic-Möbius S-boxes: A hybrid algebraic construction for cryptographic applications
Ehsan, M. A., Haider, T., & Ishaq, M. (2026) · Alexandria Engineering Journal · doi:10.1016/j.aej.2026.02.028 · Cited by 2
Lightweight Substitution Box Using Elliptic Curve Cryptography for Image Encryption Applications
Khan, N. A., & Awang, A. (2023) · Globecom · doi:10.1109/globecom54140.2023.10437591 · Cited by 1
“Some of them are as follows: Authors of [14] proposed an S-box based on an ordered isomorphic Elliptic Curve.”
BackgroundDynamic Chaotic Biometric Identity Isomorphic Elliptic Curve (DCBI-IEC) for Crypto Images
Ibrahim, A. K., Hagras, E. A. A., Alfhar, A., & El-Kamchochi, H. A. (2020) · International Conference on Computer Communication and the Internet (ICCCI) · doi:10.1109/iccci49374.2020.9145981 · Cited by 1
“( 𝑝𝑝 − 1)/2 The number of elements 𝐹𝐹𝑝𝑝 in IEC is equal to the number of points lying on IEC over .”
Ullah, I., Hayat, U., & Bustamante, M. D. (2020) · arXiv (Cornell University)
Self-citationA Novel S-Box Generation Method Based on Metastable Inducing Over Fpga for BlockPreprint
Garıpcan, A. M., Aydın, Y., & Özkaynak, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4758295
Arshad, R., Jalil, M., Iqbal, W., & Chaudhry, U. H. (2024) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-024-09099-y · Cited by 1
Jassim, S. A., Zwiad, A. H., & Al-Beder, Z. M. S. (2026) · Cybernetics and Information Technologies · doi:10.2478/cait-2026-0018
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
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.

