scholarly journals Symmetric Key based Encryption and Decryption using Lissajous Curve Equations

2017 ◽  
Vol 7 (1) ◽  
pp. 285
Author(s):  
Santhosh Kumar B.J. ◽  
Kruthika Vijay
Keyword(s):  
Prime Numbers ◽  
Brute Force ◽  
Secret Key ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
The Common ◽  
Brute Force Attack ◽  
Substitution Cipher

Sender and receiver both uses two large similar prime numbers and uses parametric equations for swapping values of kx and by product of kx and ky is the common secret key. Generated secret key is used for encryption and decryption using ASCII key matrix of order 16X16. Applying playfair rules for encryption and decryption. Playfair is a digraph substitution cipher. Playfair makes use of pairs of letters for encryption and decryption. This application makes use of all ASCII characters which makes brute force attack impossible.

scholarly journals A New Symmetric Key Cryptographic Algorithm using Paley Graphs and ASCII Values

2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim
Keyword(s):  
Brute Force ◽  
Strong Regularity ◽  
Quadratic Residues ◽  
Cryptographic Algorithm ◽  
Paley Graph ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
Brute Force Attack ◽  
The Moment ◽  
Paley Graphs

The main objective of the study conducted in this article is to introduce a new algorithm of encryption and decryption of a sensitive message after transforming it into a binary message. Our proposed encryption algorithm is based on the study of a particular graph constructed algebraically from the quadratic residues. We have exploited the Paley graph to introduce an abstract way of encryption of such message bit according to the other message bits by the intermidiate study of the neighborhood of a graph vertex. The strong regularity of the Paley graphs and the unknown behavior of the quadratic residues will play a very important role in the cryptanalysis part which allows to say that the brute force attack remains for the moment the only way to obtain the set of possible messages.

scholarly journals Encryption and Decryption Algorithms in Symmetric Key Cryptography Using Graph Theory

2021 ◽  
Vol 58 (1) ◽  
pp. 3420-3427
Author(s):  
P. A. S. D. Perera, G. S . Wijesiri
Keyword(s):  
Graph Theory ◽  
Digital Technology ◽  
Secret Key ◽  
Symmetric Cryptography ◽  
Asymmetric Cryptography ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
Original Message ◽  
Symmetric Key Cryptography ◽  
Form Graph

The present-day society depends heavily on digital technology where it is used in many applications such as banking and e-commerce transactions, computer passwords, etc. Therefore, it is important to protect information when storing and sharing them. Cryptography is the study of secret writing which applies complex math rules to convert the original message into an incomprehensible form.  Graph theory is applied in the field of cryptography as graphs can be simply converted into matrices There are two approaches of cryptography; symmetric cryptography and asymmetric cryptography. This paper proposes a new connection between graph theory and symmetric cryptography to protect the information from the unauthorized parties. This proposed methodology uses a matrix as the secret key which adds more security to the cryptosystem. It converts the plaintext into several graphs and represents these graphs in their matrix form. Also, this generates several ciphertexts. The size of the resulting ciphertexts are larger than the plaintext size.

scholarly journals A New Hybrid Cryptography Technique in Wireless Sensor Network

2019 ◽  
Vol 8 (10) ◽  
pp. 121-131
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Traditional Approach ◽  
Computation Time ◽  
Data Encryption ◽  
Wireless Sensor ◽  
Secret Key ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Symmetric Key

The wireless sensor network is a large number of tiny nodes installed in insecure environment for monitoring, gathering and transferring data and are prone to security threats for its limited resources. In order to transmit the data and to protect from different attacks in the network, security is maintained. To achieve confidentiality, authenticity and authorization of data which secure the data from different attacks cryptographic algorithm were used. The number of keys used in the cryptographic algorithm determines the security of the data. Cryptographic algorithms are broadly classified into two types symmetric cryptography and asymmetric cryptography. In the symmetric key cryptographic algorithm, a secret key is shared in the network and in asymmetric key cryptographic algorithm two keys are used for data security. In wireless sensor network, symmetric key cryptography required more storage to store the key among all the nodes of the network and in asymmetric key cryptography more computation time is require for the data encryption and decryption. To avoid memory and computation overhead we proposed a hybrid cryptosystem to handle the security in the wireless sensor network. Initially shared key is exchanged among nodes using ECC which is a public key algorithm. Data is encrypted and decrypted using RC4 symmetric key algorithm. Various performance measures such as time taken for encryption and decryption process and memory needed for storing cipher text data. The proposed model shows faster encryption of data and takes less memory for key storage as compared to the traditional approach.

scholarly journals Ciphering and Deciphering Messages by Graph Labeling Techniques Through Multilevel Cryptosystem

2020 ◽  
Vol 8 (4S5) ◽  
pp. 33-39
Keyword(s):  
Research Work ◽  
Graph Labeling ◽  
Third Party ◽  
Secret Key ◽  
Cipher Text ◽  
Graph Pattern ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
Four Square ◽  
Secure Transmission

In this paper we present an upgraded technique of coding a message using Multilevel Cryptosystem based on Four square Cipher, Mono alphabetic Substitution Cipher and Columnar Transposition cipher subjected to Graph labeling. We send our Cipher text in the form of graph pattern which admits Root cube mean labeling. Further by using the secret key the receiver decrypts the edge labels which is shared by the sender. Here we employ Symmetric key cryptosystem for both encryption and decryption of messages as both the sender as well as thereceiver shares the same key for encryption and decryption of messages. In this research work we performed Multilevel Cryptographic technique together with Graph Labeling concept to save the messages from third party or Hackers ensuring secure transmission of messages

scholarly journals A Fast Enhanced Secure Image Chaotic Cryptosystem Based on Hybrid Chaotic Magic Transform

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Srinivas Koppu ◽  
V. Madhu Viswanatham
Keyword(s):  
Brute Force ◽  
Lanczos Algorithm ◽  
Root Characteristics ◽  
Pseudorandom Generator ◽  
Key Space ◽  
Encryption And Decryption ◽  
Key Sensitivity ◽  
Image Pixels ◽  
Brute Force Attack ◽  
Differential Attacks

An enhanced secure image chaotic cryptosystem has been proposed based on hybrid CMT-Lanczos algorithm. We have achieved fast encryption and decryption along with privacy of images. The pseudorandom generator has been used along with Lanczos algorithm to generate root characteristics and eigenvectors. Using hybrid CMT image, pixels are shuffled to accomplish excellent randomness. Compared with existing methods, the proposed method had more robustness to various attacks: brute-force attack, known cipher plaintext, chosen-plaintext, security key space, key sensitivity, correlation analysis and information entropy, and differential attacks. Simulation results show that the proposed methods give better result in protecting images with low-time complexity.

scholarly journals Enhanced Data Security using Integrated Secret Key with Panagram Series

2019 ◽  
Vol 8 (6S3) ◽  
pp. 1259-1262
Keyword(s):  
Data Security ◽  
Stream Cipher ◽  
Vital Role ◽  
Brute Force ◽  
Secret Key ◽  
Text Format ◽  
Common Value ◽  
Cipher Text ◽  
Single Character ◽  
Brute Force Attack

In this fast moving world, communication among several systems via networks plays a vital role. It is significant to secure Data for a classified transmission. It becomes indispensable to protect information from unconstitutional users. The Existing system uses a common value shared between sender and the receiver. Parent string is arranged in ASCII order, therefore same cipher value is generated for a single character at every instance making brute force attack possible. The proposed system aims at the secured transmission of data in text format between the sender and the receiver. The system uses synchronous stream cipher for the secured transmission of data. The system uses algorithm that is integrated with a series of keys adding to which the message can be encrypted and by using this algorithm the cipher text is decrypted on the receiver end. A pangram is chosen as parent string, so that random cipher values are generated at every instance thereby making brute force attack impossible. The key value is generated by Tribonacci multiplication which uses a prime factor impossible for the hacker to trace the key using traffic analysis. The system remains secured as the secret key of the existing system is replaced with a series of hash value that are self generated by the built-in module in the sender and receiver.

scholarly journals A Bigdata Process for Practical Privacy-Preserving Utilizing k-Means Clustering

2019 ◽  
Vol 9 (2) ◽  
pp. 4822-4824
Keyword(s):  
Big Data ◽  
Privacy Preservation ◽  
Security Analysis ◽  
Medical Engineering ◽  
Brute Force ◽  
Sql Injection ◽  
Security Issues ◽  
Encryption And Decryption ◽  
Brute Force Attack ◽  
Growing Network

Now a day’s privacy preservation is the big issue on growing big data in various field such as medical, engineering and physical with the fast growing network. One of the most important challenges in handling big data is security issues. To overcome such security issues cryptographic concepts have been used in this paper to provide high security of big data’s with the low consumption of time for both encryption and decryption process. In this paper the proposed method is Indexed RSA (IRSA) which is developed with modified scheme. We offered a method to index the keyword before encrypting the file and based on the indexed keyword the search has been done. Finally the security analysis was carried out and the analysis showed that our modified scheme can meet the security requirement against brute force attack and SQL injection attack.

scholarly journals Dekripsi Algoritma Rivest-Shamir-Adleman Dengan Komputasi Paralel Menggunakan Message Parsing Interface

2017 ◽  
Vol 8 (1) ◽  
Author(s):  
Evangs Mailoa
Keyword(s):  
Parallel Computing ◽  
Parallel Computation ◽  
Message Passing ◽  
Message Passing Interface ◽  
Prime Numbers ◽  
Brute Force ◽  
Cryptographic Algorithm ◽  
Large Numbers ◽  
Long Time ◽  
Brute Force Attack

Abstract. Rivest-Shamir-Adleman algorithm is a cryptographic algorithm that is difficult to be dismantled. This is due to the difficulty of factoring large numbers modulus n into prime factors (p and q). The process of modulus factoring requires a very long time if solved by serial computation. Brute Force Attack method is used to find large prime numbers p and q with parallel computation. Applications for the factorization of prime numbers p and q are developed using Visual C ++ and Message Passing Interface, while the decryption process developed with Java. The results show a parallel computing process faster than a serial for factoring very large numbers n, and very slow if the n is too small.Keywords: Rivest-Shamir-Adleman Algorithm, Brute Force Attack, Message Passing Interface. Abstrak. Algoritma Rivest-Shamir-Adleman merupakan salah satu algoritma kriptografi yang sukar untuk dibongkar. Hal ini dikarenakan sulitnya memfaktorkan bilangan modulus n yang besar menjadi faktor-faktor prima (nilai p dan q). Proses untuk faktorisasi modulus n membutuhkan waktu yang sangat lama apabila diselesaikan dengan komputasi serial. Penelitian ini menggunakan metode Brute Force Attack untuk menemukan bilangan prima p dan q yang sangat besar yang dikerjakan secara paralel. Aplikasi untuk faktorisasi bilangan prima p dan q dikembangkan menggunakan Visual C++ memanfaatkan Message Passing Interface, sedangkan aplikasi proses dekripsi dengan Java. Hasil ujicoba menunjukkan proses komputasi paralel lebih cepat dibandingkan secara serial untuk memfaktorkan bilangan n yang sangat besar, dan menjadi sangat lambat apabila bilangan n terlalu kecil. Kata kunci: Algoritma Rivest-Shamir-Adleman, Brute Force Attack, Message Passing Interface.

scholarly journals TEDL: A Text Encryption Method Based on Deep Learning

2021 ◽  
Vol 11 (4) ◽  
pp. 1781
Author(s):  
Peng Wang ◽  
Xiang Li
Keyword(s):  
Deep Learning ◽  
Learning Model ◽  
Brute Force ◽  
Symmetric Encryption ◽  
Secret Key ◽  
Key Space ◽  
Encryption And Decryption ◽  
Inverted Indexing ◽  
Encryption Method ◽  
Deep Learning Model

Recent years have seen an increasing emphasis on information security, and various encryption methods have been proposed. However, for symmetric encryption methods, the well-known encryption techniques still rely on the key space to guarantee security and suffer from frequent key updating. Aiming to solve those problems, this paper proposes a novel symmetry-key method for text encryption based on deep learning called TEDL, where the secret key includes hyperparameters in the deep learning model and the core step of encryption is transforming input data into weights trained under hyperparameters. Firstly, both communication parties establish a word vector table by training a deep learning model according to specified hyperparameters. Then, a self-update codebook is constructed on the word vector table with the SHA-256 function and other tricks. When communication starts, encryption and decryption are equivalent to indexing and inverted indexing on the codebook, respectively, thus achieving the transformation between plaintext and ciphertext. Results of experiments and relevant analyses show that TEDL performs well for security, efficiency, generality, and has a lower demand for the frequency of key redistribution. Especially, as a supplement to current encryption methods, the time-consuming process of constructing a codebook increases the difficulty of brute-force attacks, meanwhile, it does not degrade the efficiency of communications.

Security Based Processed Video Distribution on Multi-Core System

2014 ◽  
Vol 984-985 ◽  
pp. 1357-1363
Author(s):  
M. Vinothini ◽  
M. Manikandan
Keyword(s):  
Computation Time ◽  
Communication Process ◽  
Secret Key ◽  
Core System ◽  
Ip Address ◽  
Video Distribution ◽  
Encryption And Decryption ◽  
Security Guarantees ◽  
Secured Communication ◽  
Parallel Fashion

During real time there are problems in transmitting video directly to the client. One of the main problems is, intermediate intelligent proxy can easily hack the data as the transmitter fails to address authentication, and fails to provide security guarantees. Hence we provide steganography and cryptography mechanisms like secure-code, IP address and checksum for authentication and AES algorithm with secret key for security. Although the hacker hacks the video during transmission, he cannot view the information. Based on IP address and secure-code, the authenticated user only can get connected to the transmitter and view the information. For further improvement in security, the video is converted into frames and these frames are split into groups and separate shared key is applied to each group of frames for encryption and decryption. This secured communication process is applied in image processing modules like face detection, edge detection and color object detection. To reduce the computation time multi-core CPU processing is utilized. Using multi-core, the tasks are processed in parallel fashion.

Sign in / Sign up

Export Citation Format

Share Document