2019
DOI: 10.1080/19361610.2019.1621513
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Identity-Based Cryptographic Model for Chebyhev Chaotic Map and Integer Factoring Based Cryptosystem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(13 citation statements)
references
References 19 publications
0
13
0
Order By: Relevance
“…Ying and Nayak's [4] and Ul Haq et al's [5] schemes take more computational cost than Yan et al's [30] and ours because Ying and Nayak's [4] and Ul Haq et al's [5] schemes perform more not only one-way hash function operations but elliptic curve point multiplications. The results have proven that performing an elliptic curve point multiplication takes more time than a Chebyshev chaotic maps operation, and, compared to RSA and ECC, Chebyshev polynomials can offer smaller key size and faster computation [42,43,[72][73][74]. However, Yan et al's scheme [30] performs only two elliptic curve point multiplications in total while our scheme performs six Chebyshev chaotic maps operations.…”
Section: Computational Complexity Comparisonmentioning
confidence: 95%
See 3 more Smart Citations
“…Ying and Nayak's [4] and Ul Haq et al's [5] schemes take more computational cost than Yan et al's [30] and ours because Ying and Nayak's [4] and Ul Haq et al's [5] schemes perform more not only one-way hash function operations but elliptic curve point multiplications. The results have proven that performing an elliptic curve point multiplication takes more time than a Chebyshev chaotic maps operation, and, compared to RSA and ECC, Chebyshev polynomials can offer smaller key size and faster computation [42,43,[72][73][74]. However, Yan et al's scheme [30] performs only two elliptic curve point multiplications in total while our scheme performs six Chebyshev chaotic maps operations.…”
Section: Computational Complexity Comparisonmentioning
confidence: 95%
“…Several signature schemes based on chaotic maps have been proposed recently. For example, Tahat and Hijazi [42] proposed an enhanced signature scheme to improve Chain and Kuo's [41]; Tahat et al proposed an ID-based cryptographic model for Chebyshev chaotic maps to demonstrate the transformation model of ID-based schemes [43]; Tahat et al proposed an ID-based blind signature based on chaotic maps [44]. Meshram et al focused on online/offline short signature schemes and proposed schemes using chaotic maps [45], such as ID-based short signature scheme and subtree-based short signature scheme for wireless sensor network [46].…”
Section: Chaotic Maps-based Signaturementioning
confidence: 99%
See 2 more Smart Citations
“…key generation stages. We examine the stages by comparing the computational expenses of our current IBE transformation model to the works of [62][63][64][65].…”
Section: Ccamentioning
confidence: 99%