2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS) 2019
DOI: 10.1109/ccoms.2019.8821685
|View full text |Cite
|
Sign up to set email alerts
|

ERC5a – An Enhanced RC5 Algorithm on Bit Propagation in the Encryption Function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…Secondly, in order to guarantee the data (eg, the network conditions sent from devices to controllers and the forwarding rules sent from controllers to devices) security between controllers and forwarding nodes, a secure channel is established. Since the channel security is not the main focus of this work, we simply use the RC5 38 data encryption algorithm to implement the functionality of this secure channel. Lastly, we can calculate a secure service path by taking the authentication results and the global network topology as the input of the secure routing algorithm which is explained in the following in detail.…”
Section: System Frameworkmentioning
confidence: 99%
“…Secondly, in order to guarantee the data (eg, the network conditions sent from devices to controllers and the forwarding rules sent from controllers to devices) security between controllers and forwarding nodes, a secure channel is established. Since the channel security is not the main focus of this work, we simply use the RC5 38 data encryption algorithm to implement the functionality of this secure channel. Lastly, we can calculate a secure service path by taking the authentication results and the global network topology as the input of the secure routing algorithm which is explained in the following in detail.…”
Section: System Frameworkmentioning
confidence: 99%
“…Passing such a test shows on how much a slight change in the original block or in the key will affect the resulted encrypted block: higher is the change in the resulted block, better is the sensitivity of the encryption algorithm. To measure the "avalanche effect in a block", the arithmetic average of Hamming distances has been used [20], and the following method has been applied. Two different original messages M 1 and M 2 which have only one bit of difference (namely, their Least Significant Bit LSB) are encrypted under RC5-CBC using the key K, to produce respectively two encrypted messages C 1 and C 2 .…”
Section: B Sensitivity Testsmentioning
confidence: 99%
“…The extensive variety of CA rules works with numerous ways of producing successions; additionally, cell automata are sorted out by just simple and basic rationale calculations with complex and pseudorandom ways of behaving. Creating great quality Random Number Arrangement (RNS) is certainly not a simple capability, Pseudo Random Number Generator (PRNGs) based CA draws in numerous specialists since they are not difficult to execute in both equipment and programming [3]. Cell robotization resembles a machine, and that implies that the information is set; the CA will utilize it to create a result.…”
Section: Introductionmentioning
confidence: 99%