ABSTRACT

Securing patent data is crucial to protect intellectual property rights,

maintain competitive advantages, adhere to legal and contractual obligations,
and foster innovation. Proper security measures help ensure that inventors,
businesses, and researchers can fully benefit from their patented technologies
while minimizing the risks associated with unauthorized access or use. The hash
function is a key component of a wide range of cryptographic protocols and
security applications, where it is primarily used to protect patent data integrity.
Data verification, access control, authentication, and secure communication are
all facilitated by it, as well as efficient management of patent databases. In order
to determine which hashing algorithm will provide the best integrity for patent
data, this study compares SHA-256, SHA-512, KECCAK, and BLAKE2b.
Based on the time taken for hashing values, SHA-256 emerges as the superior
algorithm, offering efficient and secure transformation of patent data while
maintaining optimal computational performance.
 TABLE OF CONTENTS

Chapter No. Topic Page

No.

ABSTRACT

LIST OF TABLES

LIST OF FIGURES

1 INTRODUCTION 1

2 LITERATURE REVIEW 4

3 METHODOLOGY
3.1 DATASET DESCRIPTION 9
3.2 HASHING 9
3.3 HASHING TECHNIQUES FOR DATA INTEGRITY 10
3.3.1 SHA -256 10
3.3.2 SHA -512 10
3.3.3 KECCAK 11
3.3.4 BLAKE2b 12
3.4 PROCEDURE OF HASHING DATA 13

4 EXPERIMENTAL RESULTS & DISCUSSION

4.1 PATENT DATA DESCRIPTION 15
4.2 PERFORMANCE METRICS 15
4.3 GROUND TRUTH & PREDICTED OUTPUT USING STATE 16
OF ART HASHING ALGORITHM
4.4 EXPERIMENT 1 :COMPARISON OF THE 18
PERFORMANCE OF THE VARIOUS HASHING
ALGORITHMS.
4.5 EXPERIMENT 2: RESISTANCE TO ONLINE CRACKING 19

21
5 CONCLUSION

22
REFERENCES
 TABLE OF FIGURES

FIGURE NO TITLE PAGE

NO

1 OUTLINE OF THE WORK 3

2 BASIC STRUCTURE OF HASHING FUNCTION 9