A New Non-Merkle-Damgård Structural Hash Function with Provable Security

Two of the fastest types of cryptographic algorithms are the stream cipher and the almost-universal hash function. There are secure examples of each that process data in software using less than one CPU cycle per byte. Hashstream combines the two types of algorithms in a straightforward manner yielding a PRF that can both consume inputs of and produce pseudorandom outputs of any desired length. The result is an object useful in many contexts: authentication, encryption, authenticated encryption, random generation, mask generation, etc. The HS1-SIV authenticated-encryption algorithm—a CAESAR competition second round selection—was based on Hashstream and showed the promise of such an approach by having provable security and topping the speed charts in several test configurations.

Download Full-text

Research on a provable security RFID authentication protocol based on Hash function

The Journal of China Universities of Posts and Telecommunications ◽

10.1016/s1005-8885(16)60018-3 ◽

2016 ◽

Vol 23 (2) ◽

pp. 31-37 ◽

Cited By ~ 2

Author(s):

Yu Yinhui ◽

Zhang Lei

Keyword(s):

Hash Function ◽

Provable Security ◽

Authentication Protocol

Download Full-text

Penerapan Kriptografi Keamanan Data Administrasi Kependudukan Desa Pagar Jati Menggunakan SHA-1

Jurnal Nasional Komputasi dan Teknologi Informasi (JNKTI) ◽

10.32672/jnkti.v3i2.2413 ◽

2020 ◽

Vol 3 (2) ◽

pp. 182-186

Author(s):

Lisnayani Silalahi ◽

Anita Sindar

Keyword(s):

System Application ◽

Data Security ◽

Hash Function ◽

Security System ◽

Cryptographic Hash Function ◽

Security Costs ◽

Encryption Method

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.

Download Full-text

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

10.33329/jaus.19.264.30 ◽

2019 ◽

Vol 264 (1) ◽

pp. 215-221

Keyword(s):

Hash Function ◽

Data Encryption ◽

Secret Keys

Download Full-text

Construct Hash Function from Plaintext to C34Curves

Chinese Journal of Computers ◽

10.3724/sp.j.1016.2012.01868 ◽

2012 ◽

Vol 35 (9) ◽

pp. 1868 ◽

Cited By ~ 3

Author(s):

Wei YU ◽

Kun-Peng WANG ◽

Bao LI ◽

Song TIAN

Keyword(s):

Hash Function

Download Full-text

Authentication protocol of mobile RFID based on Hash function

Journal of Computer Applications ◽

10.3724/sp.j.1087.2013.01350 ◽

2013 ◽

Vol 33 (5) ◽

pp. 1350-1352

Author(s):

Peng LIU ◽

Changhong ZHANG ◽

Qingyu OU

Keyword(s):

Hash Function ◽

Authentication Protocol ◽

Mobile Rfid

Download Full-text

Provable Security of Communication for Protecting Information Flow in Distributed Systems

10.21236/ada620103 ◽

2015 ◽

Author(s):

Paul Cuff

Keyword(s):

Distributed Systems ◽

Information Flow ◽

Provable Security

Download Full-text

Data Integrity

10.1093/oso/9780198788003.003.0006 ◽

2017 ◽

Author(s):

Keith M. Martin

Keyword(s):

Hash Function ◽

Hash Functions ◽

Data Integrity ◽

Message Authentication ◽

Authenticated Encryption ◽

Authentication Codes ◽

Basic Model ◽

Function Design ◽

Security Properties ◽

Different Levels

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.

Download Full-text