January 2007
Beginner
544 pages
14h 21m
English
Content preview from Computer Security and Cryptography
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
REFERENCES
L. M. ADELMAN, “A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography,” Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science, New York, 1979, pp. 55–60.
A. K. LENSTRA AND H. W. LENSTRA, JR, The Development of the Number Field Sieve, Lecture Notes in Mathematics #1554, Springer-Verlag, New York, NY, 1993.
A. M. ODLYZKO, “Discrete Logarithms: The Past and the Future,” Designs, Codes, and Cryptography, 19, 129–145 (1999).
W. WESLEY PETERSON AND E. J. WELDON, Error-Correcting Codes Revised 2nd edn., The M.I.T Press, Cambridge, Massachusetts, 1972.
S. POHLIG AND M. HELLMAN, “An Improved Method for Computing Logarithms Over GF(p) and its Cryptographic Significance,” IEEE Transactions on Information Theory, IT-24, 107–110 (1978).
J. M. POLLARD, “Monte Carlo Methods for Index Computation Mod p,” Mathematics of Computation, 32, 918–924 (1978).
D. SHANKS, Solved and Unsolved Problems in Number Theory, Chealsea Publishing Spartan Books (New York, NY), 1962.
P. W. SHOR, “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,” SIAM Journal of Computing, 26, 1484–1509 (1997).
Computer Security and Cryptography. By Alan G. KonheimCopyright © 2007 John Wiley & Sons, Inc.
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.