2018 International Conference on Information Networking (ICOIN) 2018
DOI: 10.1109/icoin.2018.8343155
|View full text |Cite
|
Sign up to set email alerts
|

Cryptanalysis of a chaotic chebyshev polynomials based remote user authentication scheme

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…Hence, this proposed solution uses a scheme that allows early detection of any attack, which aims to verify the legitimacy communication between of the proposed network devices. In this regard, the proposed solution also presents a verification and authorization phase using a signature scheme based on Chebyshev polynomials [29][30][31]. The first verification is between Medical Sensors and Aggregator, and for this, a signature is created by the Medical Sensor.…”
Section: Encryption and Signingmentioning
confidence: 99%
“…Hence, this proposed solution uses a scheme that allows early detection of any attack, which aims to verify the legitimacy communication between of the proposed network devices. In this regard, the proposed solution also presents a verification and authorization phase using a signature scheme based on Chebyshev polynomials [29][30][31]. The first verification is between Medical Sensors and Aggregator, and for this, a signature is created by the Medical Sensor.…”
Section: Encryption and Signingmentioning
confidence: 99%
“…In the Algorithm 2, we describe the algorithm executed by the Medical Sensor for encryption and Signing the collected data. In this regard, and as an effective solution to the above mentioned issue, we propose an Verification and Authorization phase, and for that we are using a signature scheme based on Chebyshev polynomials [24][25][26]. The first verification is between Medical Sensors and the Aggregator.…”
Section: Setup and Key Generation Phasementioning
confidence: 99%
“…(x)= cos (n * arccos(x)) … (3) where n is integer number, x∈ [1,−1] Def.2 Semi-group features for Chebyshev can achieved as: Trs(x)=Tr(Ts(x)) = Ts(Tr(x)) … (4) Def.3 The Chebyshev polynomial in n degree, present :(x,Tx(x))Figure (3) shows the statistical correlation curves for Chebyshev map[10].Figure (3): The Statistical Correlation Curves for Chebyshev Map[10].…”
mentioning
confidence: 99%