Abstract
In this chapter we describe, very briefly, some classical concepts and cryptographic primitives that were the inspiration behind new, “non-commutative”, primitives discussed in our Chapter 4. It is not our goal here to give a comprehensive survey of all or even of the most popular public key cryptographic primitives in use today, but just of those relevant to the main theme of our book, which is using non-commutative groups in cryptography. In particular, we leave out RSA, the most common public key cryptosystem in use today, because its mechanism is based on Euler’s generalization of Fermat’s little theorem, an elementary fact from number theory that does not yet seem to have any analogs in non-commutative group theory.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Birkhäuser Verlag
About this chapter
Cite this chapter
(2008). Background on Public Key Cryptography. In: Group-based Cryptography. Advanced Courses in Mathematics - CRM Barcelona. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-8827-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-7643-8827-0_1
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-8826-3
Online ISBN: 978-3-7643-8827-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)