A novel secure and efficient hash function with extra padding against rainbow table attacks

2017 ◽  
Vol 21 (1) ◽  
pp. 1161-1173 ◽  
Author(s):  
Hyung-Jin Mun ◽  
Sunghyuck Hong ◽  
Jungpil Shin
Keyword(s):  
2017 ◽  
Vol 21 (1) ◽  
pp. 1187-1187
Author(s):  
Hyung-Jin Mun ◽  
Sunghyuck Hong ◽  
Jungpil Shin
Keyword(s):  

Author(s):  
Dr. D. Hema Latha ◽  
Azmath Mubeen ◽  
Dr. D. Rama Krishna Reddy

Secure secret password storage is an essential perspective in frameworks dependent on secret phrase Substantiation method, which is as yet the most broadly utilized Substantiation confirmation procedure, in spite of its some security imperfections. In this paper, a secret key Substantiation architecture structure is implemented that is intended for secure secret password storage and could be effectively incorporated into existing authentication frameworks. In this framework first the plain password which is received from the customer is given to cryptographic hash component for SHA-256 cryptographic process. After this, the hashed secret password is changed over into a negative secret password phrase. At last, the negative password is encoded/encrypted into an Encrypted Negative Password (ENP) utilizing a symmetric-key computation using for example, AES, and additionally to improve security, multi-repeated encryption could be utilized. The cryptographic hash function and symmetric encryption make it hard to break passwords from ENPs. Also, it provides lots of comparing ENPs for a given plain password, which makes pre-calculation intrusions (e.g., and rainbow table intrusion and query table attacks) infeasible. The complex calculations and comparisons of the algorithm provide good resistance towards intrusions and also provide stronger password protection. The proposed and implemented mechanism for Password Substantiation with Negative Password Encryption is a good secured password protection mechanism that merges cryptographic hash function, the negative password and the symmetric-key algorithm, without the requirement for extra data from the plain password.


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.


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

Author(s):  
Keith M. Martin

This chapter discusses cryptographic mechanisms for providing data integrity. We begin by identifying different levels of data integrity that can be provided. We then look in detail at hash functions, explaining the different security properties that they have, as well as presenting several different applications of a hash function. We then look at hash function design and illustrate this by discussing the hash function SHA-3. Next, we discuss message authentication codes (MACs), presenting a basic model and discussing basic properties. We compare two different MAC constructions, CBC-MAC and HMAC. Finally, we consider different ways of using MACs together with encryption. We focus on authenticated encryption modes, and illustrate these by describing Galois Counter mode.


Author(s):  
Mohamed El-Hadedy ◽  
Martin Margala ◽  
Sergiu Mosanu ◽  
Danilo Gligoroski ◽  
Jinjun Xiong ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document