NDLI: PinTar: A New Keyed Hash Function based on Pseudorandom 2n-to-n bit Compression Function

Please wait, while we are loading the content...

Binary Protection using Dynamic Fine-grained Code Hiding and Obfuscation

Performance Comparison between Broadcast Authentication Methods for Vehicular Networks

Analyzing efficiency of Pseudo-Random Number Generators using Machine Learning

Penetration Testing on Virtual Environments

Enhancing Network Security in PPPoE protocol during the logical Local Loop Unbundling

Study of Car Dash Cam Security Vulnerabilities

SymFinder: Privacy Leakage Detection using Symbolic Execution on Android Devices

IoT Architecture Enabling Dynamic Security Policies

A Review on A High Performance Computing-based Interval Fuzzy Type-2 Model for Web Services' QoS Evaluation

Fast off-site backup and recovery system for HDFS

Causes and Prevention of SQL Injection Attacks in Web Applications

Noisy Speech Recognition using Wavelets and FCM

Repeated Differential Properties of PRESENT Key Schedules

Intelligent Intrusion Detection System Using a Committee of Experts

A Method of Workfolw Services Fault Recovery Based on Micro Reboot

Challenges in Quantum Key Distribution: A Review

e-Government and Security Evaluation Tools Comparison for Indonesian e-Government System

PinTar: A New Keyed Hash Function based on Pseudorandom 2n-to-n bit Compression Function

PinTar: A New Keyed Hash Function based on Pseudorandom 2n-to-n bit Compression Function

Content Provider	ACM Digital Library
Author	Deris, Mustafa Mat Jamel, Sapiee Haji Aamir, Muhammad Pindar, Zahraddeen Abubakar
Abstract	Cryptographic hash functions are used to protect the integrity of information. Hash functions are designed by using existing block ciphers as compression functions. This is due to challenges and difficulties that are encountered in constructing new hash functions from the scratch. However, the key generations for encryption process result to huge computational cost which affects the efficiency of the hash function. This paper proposes a new, secure and efficient compression function based on a pseudorandom function, that takes in two 2n-bits inputs and produce one n-bit output (2n-to-n bit). In addition, a new keyed hash function with three variants is proposed (PinTar 128 bits, 256 bits and 512 bits) which uses the proposed compression as its underlying building block. Statistical analysis shows that the compression function is an efficient one way random function. Similarly, statistical analysis of the keyed hash function shows that the proposed keyed function has strong avalanche property and is resistant to key exhaustive search attack. The proposed key hash function can be used as candidate for developing security systems.
Starting Page	34
Ending Page	38
Page Count	5
File Format	PDF
ISBN	9781450347969
DOI	10.1145/3026724.3026729
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-12-28
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	2n-to-n bit pseudorandom compression function Compression function Keyed hash function
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in