scholarly journals Hash function requirements for Schnorr signatures

2009 ◽  
Vol 3 (1) ◽  
Author(s):  
Gregory Neven ◽  
Nigel P. Smart ◽  
Bogdan Warinschi
Keyword(s):  
Hash Function ◽  
Schnorr Signatures

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

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.

Construct Hash Function from Plaintext to C34Curves

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

Authentication protocol of mobile RFID based on Hash function

2013 ◽  
Vol 33 (5) ◽  
pp. 1350-1352
Author(s):  
Peng LIU ◽  
Changhong ZHANG ◽  
Qingyu OU
Keyword(s):  
Hash Function ◽  
Authentication Protocol ◽  
Mobile Rfid

Data Integrity

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.

Micro - GAGE: A Low-power Compact GAGE Hash Function Processor for IoT Applications

2020 ◽  
Author(s):  
Mohamed El-Hadedy ◽  
Martin Margala ◽  
Sergiu Mosanu ◽  
Danilo Gligoroski ◽  
Jinjun Xiong ◽  
...  
Keyword(s):  
Low Power ◽  
Hash Function ◽  
Iot Applications

Constructing chaos-based hash function via parallel impulse perturbation

2021 ◽  
Author(s):  
Hongjun Liu ◽  
Xingyuan Wang ◽  
Abdurahman Kadir
Keyword(s):  
Hash Function

scholarly journals A Pairing-Free Identity-Based Identification Scheme with Tight Security Using Modified-Schnorr Signatures

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1330
Author(s):  
Jason Chia ◽  
Ji-Jian Chin ◽  
Sook-Chin Yip
Keyword(s):  
Key Management ◽  
Discrete Logarithm ◽  
Probability Bounds ◽  
Diffie Hellman ◽  
Identity Based ◽  
Symmetric Key ◽  
Security Guarantees ◽  
Lightweight Authentication ◽  
Tight Security ◽  
Schnorr Signatures

The security of cryptographic schemes is proven secure by reducing an attacker which breaks the scheme to an algorithm that could be used to solve the underlying hard assumption (e.g., Discrete Logarithm, Decisional Diffie–Hellman). The reduction is considered tight if it results in approximately similar probability bounds to that of solving the underlying hard assumption. Tight security is desirable as it improves security guarantees and allows the use of shorter parameters without the risk of compromising security. In this work, we propose an identity-based identification (IBI) scheme with tight security based on a variant of the Schnorr signature scheme known as TNC signatures. The proposed IBI scheme enjoys shorter parameters and key sizes as compared to existing IBI schemes without increasing the number of operations required for its identification protocol. Our scheme is suitable to be used for lightweight authentication in resource-constrained Wireless Sensor Networks (WSNs) as it utilizes the lowest amount of bandwidth when compared to other state-of-the-art symmetric key lightweight authentication schemes. Although it is costlier than its symmetric key counterparts in terms of operational costs due to its asymmetric key nature, it enjoys other benefits such as decentralized authentication and scalable key management. As a proof of concept to substantiate our claims, we perform an implementation of our scheme to demonstrate its speed and memory usage when it runs on both high and low-end devices.

Sign in / Sign up

Export Citation Format

Share Document