2022
DOI: 10.11591/ijece.v12i2.pp2139-2146
|View full text |Cite
|
Sign up to set email alerts
|

A dynamic data encryption method based on addressing the data importance on the internet of things

Abstract: The rapid growth of internet of things (IoT) in multiple areas brings research challenges closely linked to the nature of IoT technology. Therefore, there has been a need to secure the collected data from IoT sensors in an efficient and dynamic way taking into consideration the nature of collected data due to its importance. So, in this paper, a dynamic algorithm has been developed to distinguish the importance of data collected and apply the suitable security approach for each type of data collected. This was… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 23 publications
0
4
0
Order By: Relevance
“…2n/wn, where n must be a minimum of (16, 24, 32, 48, 64) bits in length, and the key must be a minimum of m bits in length. m must be in the range (2,3,4) and is version dependent [12], [20]. In the case of Speck 64/128, for instance, 64 block size divide two-part (32-bit) words representing in (x, y) are encrypted using a key 128 divide four-part (32-bit) word representing in k=(l [2], l [1], l[0], k[0]) Beaulieu et al [12] as illustrated in Table 1 [20].…”
Section: Speck Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…2n/wn, where n must be a minimum of (16, 24, 32, 48, 64) bits in length, and the key must be a minimum of m bits in length. m must be in the range (2,3,4) and is version dependent [12], [20]. In the case of Speck 64/128, for instance, 64 block size divide two-part (32-bit) words representing in (x, y) are encrypted using a key 128 divide four-part (32-bit) word representing in k=(l [2], l [1], l[0], k[0]) Beaulieu et al [12] as illustrated in Table 1 [20].…”
Section: Speck Algorithmmentioning
confidence: 99%
“…m must be in the range (2,3,4) and is version dependent [12], [20]. In the case of Speck 64/128, for instance, 64 block size divide two-part (32-bit) words representing in (x, y) are encrypted using a key 128 divide four-part (32-bit) word representing in k=(l [2], l [1], l[0], k[0]) Beaulieu et al [12] as illustrated in Table 1 [20]. As illustrated in Algorithm 2 pseudocode and Figure 2 of Speck algorithm consists of two iterative components: Figure 2(a) a key schedule and Figure 2(b) a round function denoted by R, both of which require a round count (T) [12], [20].…”
Section: Speck Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…A higher level of security was achieved by combining AES and base64. In Reference 90, a dynamic algorithm was introduced using a hybrid system that integrates stream cipher and block cipher. The Rivest cipher 4 (RC4) algorithm encrypts less significant data, and the most significant data was encrypted using AES.…”
Section: Hybrid Cryptosystemmentioning
confidence: 99%