Abstract
As we have seen, a cryptosystem is a system of the form
where \({\mathcal M}\) is the message space, \({\mathcal C}\) is the space of all possible cryptograms, e is the encryption transformation, d is the decryption transformation, \({\mathcal K}_e\) is the encryption keyspace, and \({\mathcal K}_d\) is the decryption keyspace.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
E.R. Canfield, P. Erdős, C. Pomerance, On a problem of Oppenheim concerning “factorisatio numerorum. J. Num. Theory 17(1), 1–28 (1983)
J. Hoffstein, J. Pipher, J.H. Silverman, An Introduction to Mathematical Cryptography. Undergraduate Texts in Mathematics Book Series (Springer, New York, 2008)
N. Koblitz, A Course in Number Theory and Cryptography. Graduate Text in Mathematics, vol. 114 (Springer, New York, 1987)
J.M. Pollard, Theorems on factorizations and primality testing. Proc. Cambridge. Phil. Soc. 76, 521–528 (1974)
J.M. Pollard, A Monte Carlo method for factorization. Nor. Tid. Inform 15, 331–334 (1975)
C. Pomerance, A tale of two sieves. Not. Am. Math. Soc. 43(12), 1473–1485 (1996)
K. Rosen, Elementary Number Theory and Its Applications, 6th edn. (Addison-Wesley, Boston, 2011)
N.P. Smart, Cryptography Made Simple (Springer, Cham, 2016)
J.T. Talbot, D. Welsh, Complexity and Cryptography: An Introduction (Cambridge University Press, Cambridge, 2006)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Underwood, R.G. (2022). Public Key Cryptography. In: Cryptography for Secure Encryption. Universitext. Springer, Cham. https://doi.org/10.1007/978-3-030-97902-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-97902-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-97901-0
Online ISBN: 978-3-030-97902-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)