Abstract
This step explains one of the most important base technologies of the blockchain: hash values. It discusses important properties of cryptographic hash functions and introduces patterns of applying hash functions to data.
This is a preview of subscription content, log in via an institution to check access.
Notes
- 1.
Weisstein, Eric W. Hash function. From MathWorld: http://mathworld.wolfram.com/HashFunction.html.
- 2.
Rogaway, Phillip, and Thomas Shrimpton. Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In B. Roy and W. Meier (eds.), Fast software encryption. FSE 2004. Lecture Notes in Computer Science, vol. 3017. International Workshop on Fast Software Encryption. Berlin Heidelberg: Springer, 2004.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Daniel Drescher
About this chapter
Cite this chapter
Drescher, D. (2017). Hashing Data. In: Blockchain Basics. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-2604-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4842-2604-9_10
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-2603-2
Online ISBN: 978-1-4842-2604-9
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)