Abstract
Since ancient times, cryptography has been closely associated with providing confidentiality and so it is often implicitly or explicitly identified with the use of encryption and decryption. But, important as confidentiality is, modern cryptography goes far beyond this objective and message authentication and message integrity are perhaps even more important goals. In this chapter we will look at techniques that provide message integrity in the private-key setting, in which the honest parties share some secret key. These techniques will try to guarantee that any modification of the message will be detected by the honest parties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Since \(\{0,1\}^*\) is an infinite set, there is an infinite number of messages which are mapped to the same hash value and, even if in practice we restrict the domain of the function to some \(\{0,1\}^m\) with \(m > n\), the function cannot be injective by the pigeonhole principle.
- 2.
This option lets Maple record in a table the result of each iteration of the procedure, so that it can be retrieved for successive iterations without having to be recomputed; see Maple’s help for details.
- 3.
Note that, strictly speaking, a set cannot have repeated elements and we are really dealing here with multisets, which are similar to sets except for the fact that they can contain multiple instances of each member. But we shall commit abuse of language and speak of sets anyway.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gómez Pardo, J.L. (2013). Message Authentication. In: Introduction to Cryptography with Maple. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32166-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-32166-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32165-8
Online ISBN: 978-3-642-32166-5
eBook Packages: Computer ScienceComputer Science (R0)