scholarly journals NARSKCA: Novel and robust symmetric key cryptography algorithm

2015 ◽  
Vol 3 (2) ◽  
pp. 244
Author(s):  
Balajee Maram ◽  
Y Ramesh Kumar ◽  
K Lakshmana Rao

<p>In this research paper, a novel and strong symmetric key cryptography algorithm is proposed. NARSKCA is based on several symmetric cryptographic algorithms. NARSKCA is very simple that uses character converting algorithm, Fibonacci Number Series, Lucas Number series and bitwise XOR. In NARSKCA, 32 files are shared-secret files plays a vital role in this Proposed Algorithm. The Sub-keys are generated from those 32 shared-secret files which are useful in different rounds of Encryption and Decryption Process. The most important feature is the calculation of the final key from the Sub-Keys for each Text-Block. Key Generation, encryption/decryption schemes of NARSKCA are fast and difficult to predict by Cryptanalysts.</p>

Author(s):  
Kinjal Raut

Abstract: The internet has revolutionized advancements, it’s conveniences and uses come at the price of new perils. To be safe from being the victim of fraud, theft and other damage security and vigilance is critical. Cryptography plays an important role in securing information and communications using a set of rules, it ensures the integrity of our data. It maintains confidentiality by protecting the privacy of personal information stored in enterprise systems. Hence Encryption is the only way to ensure that your information remains secure while it is stored and being transmitted. Cryptographic Algorithms mathematically maintain the integrity, confidentiality and authenticity of sensitive information by preventing data disclosure, data tampering and repudiation. The three main types of cryptography are Symmetric Key Cryptography, Asymmetric Key Cryptography and Hash Functions. In this Paper, several important algorithms used for encryption and decryption are defined and analysed, the algorithms are DES, AES, ECC, RSA, MD5 Keywords: Cryptography, Encryption, Decryption, AES, DES, ECC, RSA, Blowfish, MD5


Author(s):  
Sabitha S ◽  
Binitha V Nair

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.


Cryptography ◽  
2018 ◽  
Vol 2 (3) ◽  
pp. 22 ◽  
Author(s):  
Yunxi Guo ◽  
Timothy Dee ◽  
Akhilesh Tyagi

Physical Unclonable Functions (PUFs) are designed to extract physical randomness from the underlying silicon. This randomness depends on the manufacturing process. It differs for each device. This enables chip-level authentication and key generation applications. We present an encryption protocol using PUFs as primary encryption/decryption functions. Each party has a PUF used for encryption and decryption. This PUF is constrained to be invertible and commutative. The focus of the paper is an evaluation of an invertible and commutative PUF based on a primitive shifting permutation network—a barrel shifter. Barrel shifter (BS) PUF captures the delay of different shift paths. This delay is entangled with message bits before they are sent across an insecure channel. BS-PUF is implemented using transmission gates for physical commutativity. Post-layout simulations of a common centroid layout 8-level barrel shifter in 0.13 μ m technology assess uniqueness, stability, randomness and commutativity properties. BS-PUFs pass all selected NIST statistical randomness tests. Stability similar to Ring Oscillator (RO) PUFs under environmental variation is shown. Logistic regression of 100,000 plaintext–ciphertext pairs (PCPs) fails to successfully model BS-PUF behavior.


2021 ◽  
Vol 58 (1) ◽  
pp. 3420-3427
Author(s):  
P. A. S. D. Perera, G. S . Wijesiri

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.


2017 ◽  
Author(s):  
Andysah Putera Utama Siahaan

This study combines classic and modern cryptographic algorithms so that the data security of information more awake authenticity. Caesar cipher is the oldest classical cryptography which uses a symmetric key method is the key used for encryption is the same as the key used for the decryption process. Three-Pass Protocol is one of the modern cryptography where the process of sending a message does not need to distribute the key so that each party both the recipient and sender of the message does not need to know each lock. In this combination of receiving and sending messages using the Caesar Cipher algorithm for encryption and decryption, while for its delivery process using algorithms Three Pass protocol. The results from the combination of the two algorithms are to help the information sent is secure.


A novel cryptographic algorithm, namely Significant Secure Biometric Key (SSBK) algorithm is proposed.The novel algorithm is compared with the existing cryptographic algorithms like Advanced Encryption Standard (AES), key exchange algorithm like Diffie-Helman and also with Symmetric Random Biometric Key (SRBK) algorithm, and finally we prove the proposed algorithm is superior than existing algorithm based on few parameters. A sample plain text is taken and converted to cipher text and the key from the biometric feature is used for encryption and decryption. In the key generation process, the bi-modal biometrics, namely Ear and Lip features are taken. The concatenated key values obtained from ear and lip can be of minimum 8 bits to the maximum of 1024 bits based on the type of algorithm used.


Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 73 ◽  
Author(s):  
Borislav Stoyanov ◽  
Gyurhan Nedzhibov

In this paper, an improved encryption algorithm based on numerical methods and rotation–translation equation is proposed. We develop the new encryption-decryption algorithm by using the concept of symmetric key instead of public key. Symmetric key algorithms use the same key for both encryption and decryption. Most symmetric key encryption algorithms use either block ciphers or stream ciphers. Our goal in this work is to improve an existing encryption algorithm by using a faster convergent iterative method, providing secure convergence of the corresponding numerical scheme, and improved security by a using rotation–translation formula.


Author(s):  
Trisna Setiawaty ◽  
Olven Manahan

Ksecurity wheel is one of the essential needs of the data, or information. With this regard the importance of the information or data by the party or person of interest. This research aims to design and build a system for data security deed of sale that can help the Notary / PPAT. The system was built using the RC4 (Rivest Code 4) which is a symmetric key cryptographic algorithms and is stream cipher, there is a process of encryption and decryption. The encryption is the process of encoding the original message or plaintext into ciphertext encrypted text. While decryption is the process of encoding back to cipherteksmenjadiplainteks (original data). This research resulted in a system that is able to change the data that can be read into the data that is not easily understood.


2019 ◽  
Vol 8 (2) ◽  
pp. 1458-1461 ◽  

Current essential factor in this world to send a sensitive information over the unsecured network like the internet is security. Protection of sensitive data is becoming a major raising problem due to rising technologies. A recent attack on Electronic Mail of CBI shows that attacker’s efficiency rate. Standard cryptographic algorithms can be exploited by the attackers frequently and unable to apply for standard devices because of their energy consumption due to high computation with slow processing. Lightweight cryptography based algorithms can reduce these problems. This paper deals with symmetric key cryptography technique to encrypt the data where the sender and receiver share a common key which can also be called a secret key cryptography. To encrypt and decrypt the data, randomly generated Pentatope Number has used as a key. Next level of security will be provided using EHA (Ethernet Hardware Address or MAC Address) which is globally unique, to provide secure data transmission. The increasing of attacks on related key attacks motivates this. In particular, we investigate the efficiency impact comparatively other standard algorithms and observed that applications do not always use cryptographic algorithms without their intended use.


Author(s):  
Megha D. Randeri ◽  
Dr. Sheshang D. Degadwala ◽  
Mrs. Arpana Mahajan

In recent Era, Security has been most important issue to be considered with different forward looking and preventing measures. Several cryptographic algorithms are developed for encryption and decryption using a secret key. The issue with this strategy is that user ought to recall the key or store the key in a database, which make the framework under danger. Once the put away key is bargained, at that point an attacker can get to the private information effectively. To maintain uniqueness of key, a biometric feature such as fingerprint can be used, whereas randomness can be induced using different combinations of fingerprints. In this paper, we propose a technique to generate the key matrix by extracting minutiae points from the combined minutiae template of fingerprints of the sender and receiver. This system contains four phases. One is Enrolment Phase, second is Authentication Phase, third is Key Generation phase and last is Cryptographic phase. For encryption of the original image using generated key matrix, we use Hill cipher.


Sign in / Sign up

Export Citation Format

Share Document