![]() |
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
||
Showing 1 - 2 of 2 matches in All Departments
The sixth Algorithmic Number Theory Symposium was held at the University of Vermont, in Burlington, from 13-18 June 2004. The organization was a joint e?ort of number theorists from around the world. There were four invited talks at ANTS VI, by Dan Bernstein of the Univ- sity of Illinois at Chicago, Kiran Kedlaya of MIT, Alice Silverberg of Ohio State University, and Mark Watkins of Pennsylvania State University. Thirty cont- buted talks were presented, and a poster session was held. This volume contains the written versions of the contributed talks and three of the four invited talks. (Not included is the talk by Dan Bernstein.) ANTS in Burlington is the sixth in a series that began with ANTS I in 1994 at Cornell University, Ithaca, New York, USA and continued at UniversiteB- deaux I, Bordeaux, France (1996), Reed College, Portland, Oregon, USA (1998), the University of Leiden, Leiden, The Netherlands (2000), and the University of Sydney, Sydney, Australia (2002). The proceedings have been published as volumes 877, 1122, 1423, 1838, and 2369 of Springer-Verlag's Lecture Notes in Computer Science series. The organizers of the 2004 ANTS conference express their special gratitude and thanks to John Cannon and Joe Buhler for invaluable behind-the-scenes advice."
Cryptography, as done in this century, is heavily mathematical. But it also has roots in what is computationally feasible. This unique textbook text balances the theorems of mathematics against the feasibility of computation. Cryptography is something one actually "does", not a mathematical game one proves theorems about. There is deep math; there are some theorems that must be proved; and there is a need to recognize the brilliant work done by those who focus on theory. But at the level of an undergraduate course, the emphasis should be first on knowing and understanding the algorithms and how to implement them, and also to be aware that the algorithms must be implemented carefully to avoid the "easy" ways to break the cryptography. This text covers the algorithmic foundations and is complemented by core mathematics and arithmetic.
|
You may like...
Graphene Based Biopolymer Nanocomposites
Bhasha Sharma, Purnima Jain
Hardcover
R4,276
Discovery Miles 42 760
Real Estate Investing - The Ultimate…
Charles Pennyfeather
Hardcover
The Science and Technology of Silicones…
Stephen J. Clarson, John J Fitzgerald, …
Hardcover
R2,561
Discovery Miles 25 610
Thermodynamics of Fluids Under Flow
David Jou, Jose Casas-Vazquez, …
Hardcover
R2,821
Discovery Miles 28 210
The Industries of Buffalo - a Résume…
Buffalo Elstner Publishing Company
Hardcover
R870
Discovery Miles 8 700
|