scholarly journals Designing a secured audio based key generator for cryptographic symmetric key algorithms

2021 ◽  
Vol 2 (2) ◽  
pp. 87-94
Author(s):  
Avinash Krishnan Raghunath ◽  
Dimple Bharadwaj ◽  
M Prabhuram ◽  
Aju D

ryptography is a technique to secure data transmissions and ensure confiden-tiality, authenticity and integrity of data exchanged over the digital networks by utilizing mathematical algorithms to transform the plain text (original message) to cipher text (encrypted message) using a key or seed value. The general con-sensus regarding the use of non-deterministic true random numbers (TRN) which are generated from the physical environment such as entropy keys, at-mospheric noise, etc., as a public or private key has received limited encour-agement due to the demanding hardware requirements needed to extract the necessary data from the environment. Therefore, this research aims at design-ing and developing a lightweight program to generate a True Random Number (TRNG) key using live audio recordings which is further randomized using system date and time. These TRNs can be used to replace the deterministic pseudo random number cryptographic keys that are presently used by indus-tries for a symmetric key encryption algorithm which devolves the algorithm to being conditionally secured. Using the audio based TRNG key would render the same encryption algorithm as unconditionally secured.

2020 ◽  
Vol 8 (5) ◽  
pp. 2355-2359

Cryptography at its very core is nothing but math - pure, simple, undiluted math. Math created algorithms that are basics for various encryption algorithm. Encryption is a method in which user’s confidential data or private data is encoded to cipher text and this text can be read only if it is decrypted by authorized user using the right key. Cipher text can be decoded back to plain text, only by the authorized users using a right key. Various encryption algorithm are used to encrypt the plain text to cipher text and the cipher text is decrypted back to plain text by authorized user using right key. The symmetric key algorithm uses the same key to encrypt the plain text and decrypt the cipher text. In this paper we have proposed new symmetric algorithm using ASCII value. The plain text using key and ASCII values is converted to cipher text. Encryption algorithm sends cipher text and minimum value to the authorized receiver. Receiver decrypts the cipher text to plain text using same key and minimum value. In this algorithm sequence of five pseudo random number is generated and sum of this five pseudo random number is added to the obtained decimal value. Seed to generate common sequence of pseudo random number is kept secret between sender and receiver. Proposed algorithm support variable key length and plain text size. This algorithms performs faster when text is small message, but the execution time increases as the plain text size increases. This algorithm can be used to send small messages in a secured way. .


Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 8
Author(s):  
Bertrand Cambou ◽  
Donald Telesca ◽  
Sareh Assiri ◽  
Michael Garrett ◽  
Saloni Jain ◽  
...  

Schemes generating cryptographic keys from arrays of pre-formed Resistive Random Access (ReRAM) cells, called memristors, can also be used for the design of fast true random number generators (TRNG’s) of exceptional quality, while consuming low levels of electric power. Natural randomness is formed in the large stochastic cell-to-cell variations in resistance values at low injected currents in the pre-formed range. The proposed TRNG scheme can be designed with three interconnected blocks: (i) a pseudo-random number generator that acts as an extended output function to generate a stream of addresses pointing randomly at the array of ReRAM cells; (ii) a method to read the resistance values of these cells with a low injected current, and to convert the values into a stream of random bits; and, if needed, (iii) a method to further enhance the randomness of this stream such as mathematical, Boolean, and cryptographic algorithms. The natural stochastic properties of the ReRAM cells in the pre-forming range, at low currents, have been analyzed and demonstrated by measuring a statistically significant number of cells. Various implementations of the TRNGs with ReRAM arrays are presented in this paper.


Electronics ◽  
2021 ◽  
Vol 10 (13) ◽  
pp. 1517
Author(s):  
Xinsheng Wang ◽  
Xiyue Wang

True random number generators (TRNGs) have been a research hotspot due to secure encryption algorithm requirements. Therefore, such circuits are necessary building blocks in state-of-the-art security controllers. In this paper, a TRNG based on random telegraph noise (RTN) with a controllable rate is proposed. A novel method of noise array circuits is presented, which consists of digital decoder circuits and RTN noise circuits. The frequency of generating random numbers is controlled by the speed of selecting different gating signals. The results of simulation show that the array circuits consist of 64 noise source circuits that can generate random numbers by a frequency from 1 kHz to 16 kHz.


2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Octavio Flores Siordia ◽  
Juan Carlos Estrada Gutiérrez ◽  
Carlos Eduardo Padilla Leyferman ◽  
Jorge Aguilar Santiago ◽  
Maricela Jiménez Rodríguez

Safeguarding the identity of people in photographs or videos published through social networks or television is of great importance to those who do not wish to be recognized. In this paper, a face detecting and coding system is designed with the goal of solving this problem. Mathematical models to generate chaotic orbits are deployed. One of them applies the diffusion technique to scramble the pixels of each face while another implements the confusion technique to alter the relation between plain text and ciphered text. Afterward, another two orbits are utilized for the steganography technique to modify the least significant bit (LSB) to conceal data that would allow authorized users to decipher the faces. To verify the robustness of the proposed encryption algorithm, different tests are performed with the Lena standard image, such as correlation diagrams, histograms, and entropy. In addition, occlusion, noise, and plain image attacks are performed. The results are compared with those of other works, and the proposed system provided high sensitivity at secret key and a large space for the encryption keys, good speed for ciphering, disorder in the cryptogram, security, data integrity, and robustness against different attacks.


2020 ◽  
Vol 20 (1) ◽  
pp. 15
Author(s):  
Dwi Rahmasari Kinasih Gusti ◽  
Kiswara Agung Santoso ◽  
Ahmad Kamsyakawuni

Cryptography is knowledge of encoding messages by observe to security aspects. Cryptography uses two types of keys, namely symmetric keys and asymmetric keys. Vigenere cipher is a technique to encrypt messages by symmetric key. Vigenere cipher can be combined by several patterns and ASCII code. The pattern used can vary as long as the text can be returned to original message (can be decrypted). On this paper, we will modified plaintext before encrypt using vigenere cipher. The way to modified the plaintext are flip and shift rows of bit. The effect of the algorithm changes can be seen based on the renewal value obtained. If the correlation value gets smaller, it means the algorithm is better. The results of this study is the correlation value using vigenere cipher with modified plaintext is better compared to vigenere cipher with original plaintext. Keywords: ASCII, Patterned, Bits, Vigenere Cipher


Author(s):  
Ahmad Al-Jarrah ◽  
Amer Albsharat ◽  
Mohammad Al-Jarrah

<p>This paper proposes a new algorithm for text encryption utilizing English words as a unit of encoding. The algorithm vanishes any feature that could be used to reveal the encrypted text through adopting variable code lengths for the English words, utilizing a variable-length encryption key, applying two-dimensional binary shuffling techniques at the bit level, and utilizing four binary logical operations with randomized shuffling inputs. English words that alphabetically sorted are divided into four lookup tables where each word has assigned an index. The strength of the proposed algorithm concluded from having two major components. Firstly, each lookup table utilizes different index sizes, and all index sizes are not multiples of bytes. Secondly, the shuffling operations are conducted on a two-dimensional binary matrix with variable length. Lastly, the parameters of the shuffling operation are randomized based on a randomly selected encryption key with varying size. Thus, the shuffling operations move adjacent bits away in a randomized fashion. Definitively, the proposed algorithm vanishes any signature or any statistical features of the original message. Moreover, the proposed algorithm reduces the size of the encrypted message as an additive advantage which is achieved through utilizing the smallest possible index size for each lookup table.</p>


2012 ◽  
Vol 49 (5) ◽  
pp. 34-40 ◽  
Author(s):  
Satyaki Roy ◽  
Navajit Maitra ◽  
Shalabh Agarwal ◽  
Joyshree Nath ◽  
Asoke Nath

Author(s):  
Yegireddi Ramesh ◽  
Kiran Kumar Reddi

With the enormous growth in the Internet and network, data security has become an inevitable concern for any organization. From antecedent security has attracted considerable attention from network researchers. In this perspective many possible fields of endeavour come to mind with many cryptographic algorithms in a broader way, each is highly worthy and lengthy. As society is moving towards digital information age we necessitate highly standard algorithms which compute faster when data size is of wide range or scope. On survey, numerous sequential approaches carried out by symmetric key algorithms on 128 bits as block size are ascertained to be highly in securable and resulting at a low speed. As in the course the commodities are immensely parallelized on multi core processors to solve computational problems, in accordance with, propound parallel symmetric key based algorithms to encrypt/decrypt large data for secure conveyance. The algorithm is aimed to prevail by considering 64 character (512 bits) plain text data, processed 16 characters separately by applying parallelism and finally combine each 16 character cipher data to form 64 character cipher text. The round function employed in the algorithm is very complex, on which improves efficacy.


Sign in / Sign up

Export Citation Format

Share Document