Data Encryption Using Hash Function for Generating Secret Keys (DEH)

2019 ◽  
Vol 264 (1) ◽  
pp. 215-221
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Liuguo Yin ◽  
Wentao Hao

Due to the broadcast and time-varying natures of wireless channels, traditional communication systems that provide data encryption at the application layer suffer many challenges such as error diffusion. In this paper, we propose a code-hopping based secrecy transmission scheme that uses dynamic nonsystematic low-density parity-check (LDPC) codes and automatic repeat-request (ARQ) mechanism to jointly encode and encrypt source messages at the physical layer. In this scheme, secret keys at the transmitter and the legitimate receiver are generated dynamically upon the source messages that have been transmitted successfully. During the transmission, each source message is jointly encoded and encrypted by a parity-check matrix, which is dynamically selected from a set of LDPC matrices based on the shared dynamic secret key. As for the eavesdropper (Eve), the uncorrectable decoding errors prevent her from generating the same secret key as the legitimate parties. Thus she cannot select the correct LDPC matrix to recover the source message. We demonstrate that our scheme can be compatible with traditional cryptosystems and enhance the security without sacrificing the error-correction performance. Numerical results show that the bit error rate (BER) of Eve approaches 0.5 as the number of transmitted source messages increases and the security gap of the system is small.


Author(s):  
MING-SHENG LIU ◽  
HUI LIU ◽  
JIAN-WU ZHENG

The smart card is being used all over the world, because of its power to store data securely and execute calculations confidentially. This paper proposes an easy way to implement the strategy which can guarantee data integrity and privacy in the transmission path between the terminal application of the smart card and the smart card. This strategy consists of cryptographic functions of message and methods for transmitting APDU and managing secret keys. Some cryptographic functions of message are defined and developed for transmitting APDU confidentially. These cryptographic functions can keep the byte length of input and output messages identical. This strategy for transmitting APDU points out how to call cryptographic functions to encode or decode the data body of APDU, and how to construct a modified APDU message structure according to the original APDU message structure, which will be sent to its intended recipient instead of the original APDU message structure. With the proper secret keys, the authorized party can recover this modified APDU to its corresponding original APDU properly, without any information leakage. The transfer of secret keys to other parties is the most difficult aspect of secure APDU transmission, whereas data encryption/decryption is relatively straightforward. Two distinct strategies for managing secret keys, namely the static and the dynamic are introduced and compared. The dynamic strategy is preferred for a terminal application and smart card which do not need to authenticate each other. The implementation of this dynamic strategy has been detailed.


2020 ◽  
Vol 3 (2) ◽  
pp. 182-186
Author(s):  
Lisnayani Silalahi ◽  
Anita Sindar

Data security and confidentiality is currently a very important issue and continues to grow. Several cases concerning data security are now a job that requires handling and security costs that are so large. To maintain the security and confidentiality of messages, data, or information so that no one can read or understand it, except for the rightful recipients, a data security system application with an encryption method using an algorithm is designed. The SHA-1 cryptographic hash function that takes input and produces a 160-bit hash value which is known as the message iteration is usually rendered as a 40-digit long hexadecimal number.


2015 ◽  
Vol 52 (2) ◽  
pp. 221-232
Author(s):  
Pál Dömösi ◽  
Géza Horváth

In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.


2012 ◽  
Vol 35 (9) ◽  
pp. 1868 ◽  
Author(s):  
Wei YU ◽  
Kun-Peng WANG ◽  
Bao LI ◽  
Song TIAN
Keyword(s):  

2013 ◽  
Vol 33 (5) ◽  
pp. 1350-1352
Author(s):  
Peng LIU ◽  
Changhong ZHANG ◽  
Qingyu OU

Sign in / Sign up

Export Citation Format

Share Document