scholarly journals RK algorithm: stochastic parallel methodology for symmetric key cryptography

2020 ◽  
Vol 2 (3) ◽  
pp. 137-144
Author(s):  
Yegireddi Ramesh ◽  
Kiran Kumar Reddi
Keyword(s):  
Information Age ◽  
Block Size ◽  
Large Data ◽  
Digital Information ◽  
Text Data ◽  
Plain Text ◽  
Cipher Text ◽  
Wide Range ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

With the enormous growth in the Internet and network, data security has become an inevitable concern forany organization. From antecedent security has attracted considerable attention from network researchers. In thisperspective 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 highlystandard algorithms which compute faster when data size is of wide range or scope. On survey, numerous sequentialapproaches carried out by symmetric key algorithms on 128 bits as block size are ascertained to be highly insecurable and resulting at a low speed. As in the course the commodities are immensely parallelized on multi coreprocessors to solve computational problems, in accordance with, propound parallel symmetric key based algorithmsto 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 verycomplex, on which improves efficacy.

scholarly journals RK Algorithm: Stochastic Parallel Methodology for Symmetric Key Cryptography

2017 ◽  
Vol 2 (3) ◽  
pp. 137-144
Author(s):  
Yegireddi Ramesh ◽  
Kiran Kumar Reddi
Keyword(s):  
Information Age ◽  
Block Size ◽  
Large Data ◽  
Digital Information ◽  
Text Data ◽  
Plain Text ◽  
Cipher Text ◽  
Wide Range ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

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.

The distinguishing attack on ARX-based lightweight block ciphers

2019 ◽  
Author(s):  
А.С. Сосков ◽  
Б.Я. Рябко
Keyword(s):  
Block Size ◽  
Block Ciphers ◽  
Statistical Test ◽  
Encrypted Data ◽  
Plain Text ◽  
Distinguishing Attack ◽  
Cipher Text ◽  
Round Function ◽  
Low Degree ◽  
Symmetric Key

Рассмотрено применение атаки различения на ряд легковесных блочных шифров, основанных на ARX-операциях (сложение по модулю, циклический сдвиг и исключающее ИЛИ). Представлены экспериментальные результаты и теоретические оценки устойчивости легковесных шифров Speck, Simon, Simeck, HIGHT, LEA к атаке различения. Вывод, что семейство шифров Simeck не выдерживает эту атаку, сделан на основе прогнозов, полученных путем экстраполяции экспериментальных данных. The distinguishing attack on modern lightweight ARX-based block ciphers was applied. Distinguishing attack is any form of cryptanalysis on data encrypted by a cipher that allows an attacker distinguishing the encrypted data from random data. Purpose. Modern symmetric-key ciphers must be designed to be immune to such an attack. The purpose of the work was to estimate the resistance of lightweight ciphers Speck, Simon, Simeck, HIGHT, and LEA to a distinguishing attack. Methodology. We note that these ciphers are iterated block ciphers. It is means that they transform blocks of plain text into blocks of cipher text by using the cyclically repeated invertible function known as the round function where each iteration is to be referred as a round. We have experimentally found a maximum number of rounds where encrypted data looked like random bit-sequence by using statistical test “Book Stack”. Then we extrapolated the theoretical length required for a successful distinguishing attack on cipher with full-number rounds by a polynomial of a low degree. Note that cryptography attack is considered as successful if the length of the encrypted sequence is less than the length 2K (K — key size). Originality/value. Our experiments and estimations show, that Simeck with 48bit block size and 96-bit key size is not immune to distinguishing attack. We recommended increasing the number of rounds by 15–20% in order to improve the reliability of the Simeck 48/96.

scholarly journals An Implementation of Picpass Algorithm for the Solution of Key Exchange Problem

2021 ◽  
pp. 76-79
Author(s):  
Er. Krishan Kumar ◽  
Nidhi Singla
Keyword(s):  
Public Key Cryptography ◽  
Key Exchange ◽  
Secret Key ◽  
Dictionary Attack ◽  
Plain Text ◽  
Cipher Text ◽  
Compact Size ◽  
Private And Public ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

In this dissertation a PicPass algorithm is proposed for the solution of Key Exchange problem using Symmetric and Asymmetric key cryptography. Diffie and Hellman proposed an algorithm for key exchange. But this algorithm suffers from Man-in middle attack. So to overcome this problem Seo proposed another algorithm that uses text password for the agreement between two parties. But again the password suffers from offline dictionary attack. In this, a PicPass Protocol i.e. picture is used as a password to make an agreement between two parties. The protocol contains two function i.e. picture function as well as distortion function is used to make picture in a compact size and then it is sent to receiver. Firstly the sender encrypts the Plain Text using Secret Picture and creates the Cipher Text using Symmetric key cryptography. Then the Secret Picture will be encrypted by covered picture resulting into Encrypted Picture. Now the Cipher Text and Encrypted Picture will be placed into digital envelope and then the envelope will be send to the receiver. The receiver will receive the digital envelope, open it and then decrypt the Encrypted Picture using his Key Picture. This will result the receiver to get the Secret Picture. Now the receiver will open the Cipher Text using the Secret Picture and get the Plain Text. In between if any person wants to predict the Encrypted Picture then he cannot guess as the picture will only be decrypted using the Secret Key which will be only with the receiver. So in this dissertation, a picture is used as a password to authenticate key exchange is that gives practical solution against offline dictionary attacks only by using both private and public key cryptography.

scholarly journals Enhanced Content Based Double Encryption Algorithm Using Symmetric Key Cryptography

2017 ◽  
Vol 10 (2) ◽  
pp. 345-351
Author(s):  
Junestarfield Kynshi ◽  
Deepa Jose
Keyword(s):  
Encryption Algorithm ◽  
Secret Key ◽  
Cipher Text ◽  
Xor Operation ◽  
Symmetric Key ◽  
Binary Addition ◽  
Secure Network ◽  
Symmetric Key Cryptography

This paper aims to solve the problems of the existing technique of the content based double encryption algorithm using symmetric key cryptography. Simple binary addition, folding method and logical XOR operation are used to encrypt the content of a plaintext as well as the secret key.This algorithm helps to achieve the secure transfer of data throught the network. It solved the problems of the existing algorithm and provides a better solution. The plaintext are encrypted using the above methods and produce a cipher text. The secret key is encrypted and shared through secure network and without knowing the secret key it is difficult to decipher the text. As per expected, enhanced encryption algorithm gives better result than the existing encryption algorithm.

scholarly journals Picpass Algorithm for Solution of Key Exchange Problem in Symmetric and Asymmetric Key Cryptography

2021 ◽  
pp. 305-308
Author(s):  
Anchal Goyal ◽  
Deepinder Kaur
Keyword(s):  
Public Key Cryptography ◽  
Key Exchange ◽  
Secret Key ◽  
Dictionary Attack ◽  
Plain Text ◽  
Cipher Text ◽  
Compact Size ◽  
Private And Public ◽  
Symmetric Key ◽  
Dictionary Attacks

In this dissertation a PicPass algorithm is proposed for the solution of Key Exchange problem using Symmetric and Asymmetric key cryptography. Diffie and Hellman proposed an algorithm for key exchange. But this algorithm suffers from Man-in middle attack. So to overcome this problem Seo proposed another algorithm that uses text password for the agreement between two parties. But again the password suffers from offline dictionary attack. In this, a PicPass Protocol i.e. picture is used as a password to make an agreement between two parties. The protocol contains two function i.e. picture function as well as distortion function is used to make picture in a compact size and then it is sent to receiver. Firstly the sender encrypts the Plain Text using Secret Picture and creates the Cipher Text using Symmetric key cryptography.Then the Secret Picture will be encrypted by covered picture resulting into Encrypted Picture.Now the Cipher Text and Encrypted Picture will be placed into digital envolpe and then the envelope will be send to the receiver. The receiver will receive the digital envelope, open it and then decrypt the Encrypted Picture using his Key Picture. This will result the receiver to get the Secret Picture. Now the receiver will open the Cipher Text using the Secret Picture and get the Plain Text. In between if any person wants to predict the Encrypted Picture then he cannot guess as the picture will only be decrypted using the Secret Key which will be only with the receiver. So in this dissertation, a picture is used as a password to authenticate key exchange is that gives practical solution against offline dictionary attacks only by using both private and public key cryptography.

scholarly journals High Speed Area Efficient FPGA Implementation of AES Algorithm

2018 ◽  
Vol 7 (3) ◽  
pp. 151
Author(s):  
P. B. Mane ◽  
A. O. Mulani
Keyword(s):  
Power Consumption ◽  
High Throughput ◽  
High Speed ◽  
Advanced Encryption Standard ◽  
Digital Information ◽  
Unauthorized Access ◽  
Aes Algorithm ◽  
Symmetric Key ◽  
Reconfigurable Platform ◽  
Symmetric Key Cryptography

Now a day digital information is very easy to process, but it allows unauthorized users to access this information. To protect this information from unauthorized access, Advanced Encryption Standard (AES) is one of the most frequently used symmetric key cryptography algorithm. Main objective of this paper is to implement fast and secure AES algorithm on reconfigurable platform. In this paper, AES algorithm is designed with the aim to achieve less power consumption and high throughput. Keys are generated using MATLAB and remaining algorithm is designed using Xilinx SysGen, implemented on Nexys4 and simulated using Simulink. Synthesis result shows that it consumes 121 slice registers and its operating frequency is 1102.536 MHz. Throughput of the overall system is 14.1125 Gbps.

scholarly journals Methods and Technologies of Search, Explication and Analysis of Contextual Knowledge for Scientific Heritage Studies: A Case Study of Georgy F. Gause

2021 ◽  
Author(s):  
Dmitry Evgenievich Prokudin ◽  
Olga Vitalievna Kononova ◽  
Georgy Semeonovich Levit
Keyword(s):  
Information And Communication Technologies ◽  
Text Processing ◽  
Scientific Research ◽  
Russian Language ◽  
Digital Information ◽  
Contextual Knowledge ◽  
Scientific Publications ◽  
Text Data ◽  
Scientific Heritage ◽  
Wide Range

The objective of this research is to study methods of search, explication and analysis of text data of scientific publications with information and communication technologies for use in scientific research. The research is based on Russian-language scientific publications reflecting the scientific heritage of G. F. Gause. The proposed study is based on the results of case studies conducted to assess the possibilities of using digital information resources in scientific research, extracting metadata from digital electronic resources using methods of their subsequent quantitative processing. The study examined the methods of explication and analysis of text data extracted from digital scientific resources (for example, Elibrary). For the analysis, the information system Sketch Engine was used, which provides natural language text processing (NLP) tools. Based on the analysis of the obtained results, conclusions are drawn about the possibility of using the studied methods not only in scientific research, but also in a wide range of scientific research on various topics.

scholarly journals High Speed Area Efficient FPGA Implementation of AES Algorithm

2018 ◽  
Vol 7 (3) ◽  
pp. 157
Author(s):  
P. B. Mane ◽  
A. O. Mulani
Keyword(s):  
Power Consumption ◽  
High Throughput ◽  
High Speed ◽  
Advanced Encryption Standard ◽  
Digital Information ◽  
Unauthorized Access ◽  
Aes Algorithm ◽  
Symmetric Key ◽  
Reconfigurable Platform ◽  
Symmetric Key Cryptography

Now a day digital information is very easy to process, but it allows unauthorized users to access this information. To protect this information from unauthorized access, Advanced Encryption Standard (AES) is one of the most frequently used symmetric key cryptography algorithm. Main objective of this paper is to implement fast and secure AES algorithm on reconfigurable platform. In this paper, AES algorithm is designed with the aim to achieve less power consumption and high throughput. Keys are generated using MATLAB and remaining algorithm is designed using Xilinx SysGen, implemented on Nexys4 and simulated using Simulink. Synthesis result shows that it consumes 121 slice registers and its operating frequency is 1102.536 MHz. Throughput of the overall system is 14.1125 Gbps.

scholarly journals A Survey of Oblivious Transfer Protocol

2022 ◽  
Author(s):  
Vijay Kumar Yadav ◽  
Nitish Andola ◽  
Shekhar Verma ◽  
S Venkatesan
Keyword(s):  
Private Information ◽  
Oblivious Transfer ◽  
Location Based Services ◽  
Malicious Adversary ◽  
Set Intersection ◽  
Wide Range ◽  
Symmetric Key ◽  
Contract Signing ◽  
Security Guarantees ◽  
Symmetric Key Cryptography

Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide range of applications like secure multi-party computation, private information retrieval, private set intersection, contract signing, and privacy-preserving location-based services. The OT protocol has different variants such as one-out-of-2, one-out-of- n , k -out-of- n , and OT extension. In the OT (one-out-of-2, one-out-of- n , and OT extension) protocol, the sender has a set of messages, whereas the receiver has a key. The receiver sends that key to the sender in a secure way; the sender cannot get any information about the received key. The sender encrypts every message by operating on every message using the received key and sends all the encrypted messages to the receiver. The receiver is able to extract only the required message using his key. However, in the k -out-of- n OT protocol, the receiver sends a set of k keys to the sender, and in replay, the sender sends all the encrypted messages. The receiver uses his keys and extracts the required messages, but it cannot gain any information about the messages that it has not requested. Generally, the OT protocol requires high communication and computation cost if we transfer millions of oblivious messages. The OT extension protocol provides a solution for this, where the receiver transfers a set of keys to the sender by executing a few numbers of OT protocols. Then, the sender encrypts all the messages using cheap symmetric key cryptography with the help of a received set of keys and transfer millions of oblivious messages to the receiver. In this work, we present different variants of OT protocols such as one-out-of-2, one-out-of- n , k -out-of- n , and OT extension. Furthermore, we cover various aspects of theoretical security guarantees such as semi-honest and malicious adversaries, universally composable, used techniques, computation, and communication efficiency aspects. From the analysis, we found that the semi-honest adversary-based OT protocols required low communication and computation costs as compared to malicious adversary-based OT protocols.

scholarly journals Based on the digital technology of smoked painting cultural creation product design

2021 ◽  
Vol 236 ◽  
pp. 05020
Author(s):  
Zhang Jing ◽  
Yin Jiayi
Keyword(s):  
Product Design ◽  
Digital Technology ◽  
Information Age ◽  
Psychological Needs ◽  
Digital Information ◽  
Color Analysis ◽  
Existing Problems ◽  
Wide Range ◽  
Problems And Solutions ◽  
Key Factor

Under the product design in the digital information age is no longer a common product design, digital technology has a wide range of areas, is composed of a variety of technology, by referencing the digital technology in the design of the product to solve the current existing problems and solutions. Through the understanding of the current situation, color analysis, image extraction of these three artistic processing design this design contains more designers to understand the deep step of our era, the design focuses on modern people psychological needs and the moral of the product. Gradually integrate product design art and digital technology into people's life, making it a key factor to promote the development of digital art technology.

Sign in / Sign up

Export Citation Format

Share Document