2019 International Conference on Information and Communications Technology (ICOIACT) 2019
DOI: 10.1109/icoiact46704.2019.8938456
|View full text |Cite
|
Sign up to set email alerts
|

A Modified Tiny Encryption Algorithm Using Key Rotation to Enhance Data Security for Internet of Things

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…In 2019, the authors in [21] proposed another modified version of TEA to enhance data security for IoT. The proposed modification includes the introduction of key rotation, which changes the encryption key at regular intervals to prevent attacks that may exploit weaknesses in a static key.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…In 2019, the authors in [21] proposed another modified version of TEA to enhance data security for IoT. The proposed modification includes the introduction of key rotation, which changes the encryption key at regular intervals to prevent attacks that may exploit weaknesses in a static key.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In general, achieving cryptographically secure keys are challenging task in lightweight cryptography due to the limitations of conducted devices [14,15]. Consequently, several modifications to TEA have been proposed to overcome this issue [16][17][18].…”
Section: Introductionmentioning
confidence: 99%
“…As a result, a Modified TEA Algorithm (MTEA) is presented, which employs a Linear Feedback Shift Register (LFSR) to mitigate the TEA algorithm's weaknesses against assaults. The MTEA method is implemented in this paper, along with a comparison of the regular TEA algorithm in terms of area and energy usage [9]. To achieve security, plain text is encrypted and decrypted in TEA using orthogonal algebraic group operations with lots of rounds.…”
Section: Related Workmentioning
confidence: 99%
“…In 2019, a new modification to TEA was proposed by De Leon et al in [17]. They improved the security of TEA using new key scheduling to rotate subkeys every round function.…”
Section: Related Workmentioning
confidence: 99%
“…Due to TEA's simple key scheduling, equivalent key attacks are possible. Numerous TEA modifications have been suggested over the last few years to solve the issue [14], [15], [16], [17].…”
Section: Introductionmentioning
confidence: 99%