scholarly journals Improvement of nuclear facilities DNP3 protocol data transmission security using super encryption BRC4 in SCADA systems

2021 ◽  
Vol 7 ◽  
pp. e727
Author(s):  
Eko Hadiyono Riyadi ◽  
Agfianto Eko Putra ◽  
Tri Kuntoro Priyambodo
Keyword(s):  
Information Entropy ◽  
Data Transmission ◽  
Time Complexity ◽  
Visual Analysis ◽  
Complexity Analysis ◽  
Nuclear Facilities ◽  
Plain Text ◽  
Key Space ◽  
Scada Systems ◽  
Better Than

Background Data transmissions using the DNP3 protocol over the internet in SCADA systems are vulnerable to interruption, interception, fabrication, and modification through man-in-the-middle (MITM) attacks. This research aims to improve the security of DNP3 data transmissions and protect them from MITM attacks. Methods This research describes a proposed new method of improving DNP3 security by introducing BRC4 encryption. This combines Beaufort encryption, in which plain text is encrypted by applying a poly-alphabetic substitution code based on the Beaufort table by subtracting keys in plain text, and RC4 encryption, a stream cipher with a variable-length key algorithm. This research contributes to improving the security of data transmission and accelerating key generation. Results Tests are carried out by key space analysis, correlation coefficient analysis, information entropy analysis, visual analysis, and time complexity analysis.The results show that to secure encryption processes from brute force attacks, a key of at least 16 characters is necessary. IL data correlation values were IL1 = −0.010, IL2 = 0.006, and IL3 = 0.001, respectively, indicating that the proposed method (BRC4) is better than the Beaufort or RC4 methods in isolation. Meanwhile, the information entropy values from IL data are IL1 = 7.84, IL2 = 7.98, and IL3 = 7.99, respectively, likewise indicating that the proposed method is better than the Beaufort or RC4 methods in isolation. Both results also show that the proposed method is secure from MITM attacks. Visual analysis, using a histogram, shows that ciphertext is more significantly distributed than plaintext, and thus secure from MITM attacks. The time complexity analysis results show that the proposed method algorithm is categorized as linear complexity.

scholarly journals A Comparison of the DES and Dömösi Cryptosystems

Triangle ◽  
2018 ◽  
pp. 81
Author(s):  
Zoltan Pal Mecsei
Keyword(s):  
Time Complexity ◽  
Complexity Analysis ◽  
Better Than

In this paper we compare the well known DES cryptosystem with the recently introduced Dömösi system, which is based on nite automata. We do a time complexity analysis on both algrithms. We show that without making use of an auxiliary matrix the Dömösi cryptosystem is slower than DES. However, the use of auxiliary matrices makes the former perform better than its well known counterpart for some block lengths.

Security Mechanisms in Cloud Computing-Based Big Data

2021 ◽  
pp. 897-926
Author(s):  
Addepalli V. N. Krishna ◽  
Balamurugan M.
Keyword(s):  
Cloud Computing ◽  
Big Data ◽  
Data Transmission ◽  
Time Complexity ◽  
Time Stamp ◽  
Encrypted Data ◽  
Plain Text ◽  
System Data

In the existent system, data is encrypted and stored when passed to the cloud. During any operations on the data, it is decrypted and then the computation is done. This decrypted data is vulnerable and prone to be misused. After the computations are done, the data and the result are encrypted and stored back in the cloud. This creates an overhead to the system as well as increases time complexity. With this chapter, the authors aim to reduce the overhead of the systems to perform repeated encryptions and decryptions. This can be done by allowing the computations to happen directly on the encrypted text. The result obtained by performing computations on encrypted data will be the same as the ones done on the original plain text. This new security solution is fully fit for processing and retrieval of encrypted data, effectively leading to the broad applicable project, the security of data transmission, and the storage of data. The work is secured further with additional concepts like probabilistic and time stamp-based encryption processes.

Security Mechanisms in Cloud Computing-Based Big Data

2021 ◽  
pp. 694-724
Author(s):  
Addepalli V. N. Krishna ◽  
Balamurugan M.
Keyword(s):  
Cloud Computing ◽  
Big Data ◽  
Data Transmission ◽  
Time Complexity ◽  
Time Stamp ◽  
Encrypted Data ◽  
Plain Text ◽  
System Data

In the existent system, data is encrypted and stored when passed to the cloud. During any operations on the data, it is decrypted and then the computation is done. This decrypted data is vulnerable and prone to be misused. After the computations are done, the data and the result are encrypted and stored back in the cloud. This creates an overhead to the system as well as increases time complexity. With this chapter, the authors aim to reduce the overhead of the systems to perform repeated encryptions and decryptions. This can be done by allowing the computations to happen directly on the encrypted text. The result obtained by performing computations on encrypted data will be the same as the ones done on the original plain text. This new security solution is fully fit for processing and retrieval of encrypted data, effectively leading to the broad applicable project, the security of data transmission, and the storage of data. The work is secured further with additional concepts like probabilistic and time stamp-based encryption processes.

Security Mechanisms in Cloud Computing-Based Big Data

2019 ◽  
pp. 165-195
Author(s):  
Addepalli V. N. Krishna ◽  
Balamurugan M.
Keyword(s):  
Cloud Computing ◽  
Big Data ◽  
Data Transmission ◽  
Time Complexity ◽  
Time Stamp ◽  
Encrypted Data ◽  
Plain Text ◽  
System Data

In the existent system, data is encrypted and stored when passed to the cloud. During any operations on the data, it is decrypted and then the computation is done. This decrypted data is vulnerable and prone to be misused. After the computations are done, the data and the result are encrypted and stored back in the cloud. This creates an overhead to the system as well as increases time complexity. With this chapter, the authors aim to reduce the overhead of the systems to perform repeated encryptions and decryptions. This can be done by allowing the computations to happen directly on the encrypted text. The result obtained by performing computations on encrypted data will be the same as the ones done on the original plain text. This new security solution is fully fit for processing and retrieval of encrypted data, effectively leading to the broad applicable project, the security of data transmission, and the storage of data. The work is secured further with additional concepts like probabilistic and time stamp-based encryption processes.

scholarly journals Cryptanalysis of Loiss Stream Cipher-Revisited

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Lin Ding ◽  
Chenhui Jin ◽  
Jie Guan ◽  
Qiuyan Wang
Keyword(s):  
Time Complexity ◽  
Stream Cipher ◽  
Linear Equations ◽  
Data Complexity ◽  
Secret Key ◽  
Key Recovery ◽  
Systems Of Linear Equations ◽  
Key Recovery Attack ◽  
Better Than

Loiss is a novel byte-oriented stream cipher proposed in 2011. In this paper, based on solving systems of linear equations, we propose an improved Guess and Determine attack on Loiss with a time complexity of 2231and a data complexity of 268, which reduces the time complexity of the Guess and Determine attack proposed by the designers by a factor of 216. Furthermore, a related key chosenIVattack on a scaled-down version of Loiss is presented. The attack recovers the 128-bit secret key of the scaled-down Loiss with a time complexity of 280, requiring 264chosenIVs. The related key attack is minimal in the sense that it only requires one related key. The result shows that our key recovery attack on the scaled-down Loiss is much better than an exhaustive key search in the related key setting.

scholarly journals Analysis of the Perfect Table Fuzzy Rainbow Tradeoff

2014 ◽  
Vol 2014 ◽  
pp. 1-19 ◽  
Author(s):  
Byoung-Il Kim ◽  
Jin Hong
Keyword(s):  
Complexity Analysis ◽  
Digital Documents ◽  
Time Memory Tradeoff ◽  
Better Than ◽  
Do So

Cryptanalytic time memory tradeoff algorithms are tools for inverting one-way functions, and they are used in practice to recover passwords that restrict access to digital documents. This work provides an accurate complexity analysis of the perfect table fuzzy rainbow tradeoff algorithm. Based on the analysis results, we show that the lesser known fuzzy rainbow tradeoff performs better than the original rainbow tradeoff, which is widely believed to be the best tradeoff algorithm. The fuzzy rainbow tradeoff can attain higher online efficiency than the rainbow tradeoff and do so at a lower precomputation cost.

Real-time engine model development based on time complexity analysis

2021 ◽  
pp. 146808742110397
Author(s):  
Haotian Chen ◽  
Kun Zhang ◽  
Kangyao Deng ◽  
Yi Cui
Keyword(s):  
Real Time ◽  
Time Complexity ◽  
Complexity Analysis ◽  
High Accuracy ◽  
The Real ◽  
Cycle Simulation ◽  
Crank Angle ◽  
Time Requirements ◽  
Improved Model ◽  
Simulation Time

Real-time simulation models play an important role in the development of engine control systems. The mean value model (MVM) meets real-time requirements but has limited accuracy. By contrast, a crank-angle resolved model, such as the filling -and-empty model, can be used to simulate engine performance with high accuracy but cannot meet real-time requirements. Time complexity analysis is used to develop a real-time crank-angle resolved model with high accuracy in this study. A method used in computer science, program static analysis, is used to theoretically determine the computational time for a multicylinder engine filling-and-empty (crank-angle resolved) model. Then, a prediction formula for the engine cycle simulation time is obtained and verified by a program run test. The influence of the time step, program structure, algorithm and hardware on the cycle simulation time are analyzed systematically. The multicylinder phase shift method and a fast calculation method for the turbocharger characteristics are used to improve the crank-angle resolved filling-and-empty model to meet real-time requirements. The improved model meets the real-time requirement, and the real-time factor is improved by 3.04 times. A performance simulation for a high-power medium-speed diesel engine shows that the improved model has a max error of 5.76% and a real-time factor of 3.93, which meets the requirement for a hardware-in-the-loop (HIL) simulation during control system development.

Final Remarks for the Research With Advanced Machine Learning Methods in Colon Cancer Analysis

2021 ◽  
pp. 151-154
Keyword(s):  
Colon Cancer ◽  
Time Complexity ◽  
High Performance ◽  
Complexity Analysis ◽  
Search Algorithm ◽  
Cancer Treatments ◽  
Cancer Dataset ◽  
Performance Accuracy ◽  
Research Questions

Generally, classification accuracy is very important to gene processing and selection and cancer classification. It is needed to achieve better cancer treatments and improve medical drug assignments. However, the time complexity analysis will enhance the application's significance. To answer the research questions in Chapter 1, several case studies have been implemented (see Chapters 4 and 5), each was essential to sustain the methodologies discussed in Chapter 3. The study used a colon-cancer dataset comprising 2000 genes. The best search algorithm, GA, showed high performance with a good efficient time complexity. However, both DTs and SVMs showed the best classification contribution with reference to performance accuracy and time efficiency. However, it is difficult to apply a completely fair comparative study because existing algorithms and methods were tested by different authors to reflect the effectiveness and powerful of their own methods.

scholarly journals A Compression Algorithm for DNA Palindrome Compression Technique

2020 ◽  
Vol 32 ◽  
pp. 03006
Author(s):  
D. Suneetha ◽  
D. Rathna Kishore ◽  
P. Narendra Babu
Keyword(s):  
Compression Algorithm ◽  
Experimental Result ◽  
Compression Process ◽  
Compression Technique ◽  
Plain Text ◽  
Security Issues ◽  
Cipher Text ◽  
Different Types ◽  
Dna Palindrome ◽  
Better Than

Data Compression in Cryptography is one of the interesting research topic. The compression process reduces the amount of transferring data as well as storage space which in turn effects the usage of bandwidth. Further, when a plain text is converted to cipher text, the length of the cipher text becomes large. This adds up to tremendous information storing. It is extremely important to address the storage capacity issue along with the security issues of exponentially developing information. This problem can be resolved by compressing the ciphertext based on a some compression algorithm. In this proposed work used the compression technique called palindrome compression technique. The compression ratio of the proposed method is better than the standard method for both colored and gray scaled images. An experimental result for the proposed methods is better than existing methods for different types of image.

Sign in / Sign up

Export Citation Format

Share Document