Product Description
lobal information superhighway, this book addresses the need for a strong national policy on cryptography that protects the information interests of individuals and businesses while respecting the needs of law enforcement and intelligence for national security and foreign policy purposes. ... Read more

Customer Reviews (3)

Essential, but with two flaws
This book, prepared by the Committee to Study National Cryptography Policy of the Computer Science and Telecommunications Board of the National Research Council, is essential reading for anybody concerned with the role of crytography in information security. Written by experts, it surveys the topic dispassionately, and makes wise recommendations. No technical knowledge is required to read it, so it is suitable for everyone from policymakers to techies.

It has two flaws, one minor and inevitable, the other more serious. The first stems from the fact that the National Research Council undertakes studies like this only at the request of the US government. The federal government is notorious for its belief that anything worth saying should be said in the dullest possible bureaucratese. I know the staff members who produced the actual text of this book; they are excellent writers, and did their best to make the book readable within the constraints imposed by government mindset, but it's still dull and tedious to read. Compared to the Federal Register, however, it's a model of expository clarity.

The second flaw is the very cursory treatment given to one of the most serious problems in using cryptography for information security. The great majority of civilian computers, and even some military computers, are vulnerable to a wide variety of viruses, worms and trojan horses, and in most cases the users and system administrators are unaware of how vulnerable they are.

Cryptography is completely useless as a protective mechanism if cleartext or keys can be retrieved and transmitted from an originating or destination computer by a program inserted by an attacker. Equally serious, if the attacker substitutes trojan horse code for the encipherment/decipherment techniques employed, the whole system is wide open. I regard this as the current greatest weakness in the use of cryptography for information security, except within certain parts of the military. I dn't have any good ideas at all about how to plug this weakness, but it deserves much more careful attention than it gets in this book. If you are responsible for any aspect of computer or communications security, think hard about this problem.

Not obsolete yet
Excellent overview of social & organizational issues that affect use of encryption.Some of the material is becoming quickly dated, but the chapters on "Roles, Market & Infrastructure," "CryptoPrimer," "Public Key Infrastructure," and"[Applicability of Encryption by] Industry" will be useful foryears.

A valuable reference.
A thorough, and unbiased inquiry, commissioned by congress, of the importance of cryptography to the information economy. Still highly useful, despite being increasingly dated. ... Read more

Product Description
Algorithmic number theory is a rapidly developing branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. Among the algorithms used in cryptography, the following are especially important:algorithms for primality testing; factorization algorithms for integers and for polynomials in one variable; applications of the theory of elliptic curves; algorithms for computation of discrete logarithms; algorithms for solving linear equations over finite fields; algorithms for performing arithmetic operations on large integers. The book describes the current state of these and some other algorithms. It also contains extensive bibliography. For this English translation, additional references were prepared and commented on by the author. ... Read more

Product Description
This book is an introduction to the algorithmic aspects of number theory and its applications to cryptography, with special emphasis on the RSA cryptosys-tem. It covers many of the familiar topics of elementary number theory, all with an algorithmic twist. The text also includes many interesting historical notes. ... Read more

Customer Reviews (4)

Good introduction to RSA
I've used this book for teaching the basic theory of RSA cryptography. However, some knowledge of number theory is required in order to get full benefit of the text and exercises. I found "Number Theory and Its History," by Oystein Ore, to be an excellent complement to this text.

(Note that there are a few typographical errors in the exercises, but these are easily spotted.)

all about understanding RSA
The book revolves around RSA. The motivation for the book is that the reader wants to understand public/private key cryptography, where this is represented by the seminal RSA algorithm.

The author assumes little previous acquaintance with number theory on your part. He develops his arguments from this minimal background. So modular arithmetic is introduced, and thence such key ideas as groups, primality tests, Chinese Remainder Theorem and, finally, the RSA cryptosystem. Each chapter has a problem set of moderate difficulty.

A maths undergraduate at the sophomore level or higher should be able to benefit from the book.

Excellent introduction
This book is a very readable introduction to the theory of numbers. The author manages to concentrate in a relatively short book and with a very clear and pleasant style the material necessary to understand the mathematics underneath the RSA cryptosystem. No previous knowledge ofadvanced mathematics is assumed. Perhaps not enough for mathematicians, butmore than rewarding for the rest of us. It reminds me a bit of the style ofM. Gardner. Books on mathematics can be very dull without the style ofexposition of Mr. Coutinho. Highly recommended !

multiplication
multiplicatio ... Read more

Product Description
All current methods of secure communication such as public-key cryptography can eventually be broken by faster computing. At the interface of physics and computer science lies a powerful solution for secure communications: quantum cryptography. Because eavesdropping changes the physical nature of the information, users in a quantum exchange can easily detect eavesdroppers. This allows for totally secure random key distribution, a central requirement for use of the one-time pad. Since the one-time pad is theoretically proven to be undecipherable, quantum cryptography is the key to perfect secrecy.

Quantum Communications and Cryptography is the first comprehensive review of the past, present, and potential developments in this dynamic field. Leading expert contributors from around the world discuss the scientific foundations, experimental and theoretical developments, and cutting-edge technical and engineering advances in quantum communications and cryptography.

The book describes the engineering principles and practical implementations in a real-world metropolitan network as well as physical principles and experimental results of such technologies as entanglement swapping and quantum teleportation. It also offers the first detailed treatment of quantum information processing with continuous variables. Technologies include both free-space and fiber-based communications systems along with the necessary protocols and information processing approaches.

Bridging the gap between physics and engineering, Quantum Communications and Cryptography supplies a springboard for further developments and breakthroughs in this rapidly growing area. ... Read more

Product Description
This book illustrates the application of Number Theory to practical problems in physics, digital information processing. computing, cryptography, acoustics, crystallography (quasicrystals), fractals and self-similarity. Its aim is to widen the horizon of readers with a minimum of mathematicasl training to the basic facts of number theory. The otpics treated informally, stressing intuition rather then formal proofs. The book demonstrates that there are a surprising numbe rof applications of a field which is tradiationally considered raterh abstract, and from this realization readers are led to a depp appreciation of tzhe usefulness of finite mathematics and its multi-faeted interactions with the real world. The Second Edition includes much new material on self-similarity, factals, quasicrystals, Cantor sets, Hausdorff dimensions, detemrinicstic chaos, errof-free computation, spread-spectrum communication systems, optimal ambiguity functions for radar and sonar, and Fibonacci numbers. From the reviews "A lighthearted and readable volume with a wide range of applications to which the author has been a püroductive contributor - useful mathematics given outside the formalities of theorem and proof. Philip Morrison - Scientific American NTS*** ... Read more

Customer Reviews (2)

Good mix of theory and mathematics
This book provides good examples and has a good mix of number theory and the associated mathematics. Very useful for people interested in cryptography and number theory in general.
However, this book is not easy to read and requires some effort to digest the given information.

could have included some problems
[A review of the 4th Edition 2006.]

It is possible when teaching number theory to drown the reader in theorems, lemmas and corrolaries. So much so that she can get lost in the thickets and fail to appreciate the broad motivating ideas. Schroeder refrains from such a presentation. He is certainly rigorous enough, when needed. But the book is a graceful exposition. Explaining key concepts and proving enough along the way to satisfy most readers.

So Euler, Fermat, Gauss and other luminaries make their appearance at numerous points. Along with the classic and still unproven Goldbach Conjecture. Many readers will probably turn to the sections on modern applications, notably in cryptography. The explanation of the public key algorithm is elegant.

Other applications include making random numbers. Something quite subtle and difficult to do well. And vitally necessary for cryptography.

The last chapter on fractals and self similar transformations is accompanied by a few pretty pictures of fractals and Julia sets in the plane. Though by now most readers must be familiar with fractal art.

The only drawback of the book is the lack of problems. Pity, as it reduces the book's suitability as an undergrad text. ... Read more

Product Description

This companion exercise and solution book to A Classical Introduction to Cryptography: Applications for Communications Security contains a carefully revised version of teaching material used by the authors and given as examinations to advanced-level students of the Cryptography and Security Lecture at EPFL from 2000 to mid-2005.

A Classical Introduction to Cryptography Exercise Book covers a majority of the subjects that make up today's cryptology, including symmetric or public-key cryptography, cryptographic protocols, design, cryptanalysis, and implementation of cryptosystems. Exercises do not require an extensive background in mathematics, since the most important notions are introduced and discussed in many of the exercises.

The authors expect the readers to be comfortable with basic facts of discrete probability theory, discrete mathematics, calculus, algebra, and computer science. Following the model of A Classical Introduction to Cryptography: Applications for Communications Security, exercises related to the more advanced parts of the textbook are marked with a star.

Product Description

This book consists of a collection of works on utilizing the automatic identification technology provided by Radio Frequency Identification (RFID) to address the problems of global counterfeiting of goods. The book presents current research, directed to securing supply chains against the efforts of counterfeit operators, carried out at the Auto-ID Labs around the globe. It assumes very little knowledge on the part of the reader on Networked RFID systems as the material provided in the introduction familiarizes the reader with concepts, underlying principles and vulnerabilities of modern RFID systems.

Product Description
Gain the skills and knowledge needed to create effective data security systems

This book updates readers with all the tools, techniques, and concepts needed to understand and implement data security systems. It presents a wide range of topics for a thorough understanding of the factors that affect the efficiency of secrecy, authentication, and digital signature schema. Most importantly, readers gain hands-on experience in cryptanalysis and learn how to create effective cryptographic systems.

The author contributed to the design and analysis of the Data Encryption Standard (DES), a widely used symmetric-key encryption algorithm. His recommendations are based on firsthand experience of what does and does not work.

Thorough in its coverage, the book starts with a discussion of the history of cryptography, including a description of the basic encryption systems and many of the cipher systems used in the twentieth century. The author then discusses the theory of symmetric- and public-key cryptography. Readers not only discover what cryptography can do to protect sensitive data, but also learn the practical limitations of the technology. The book ends with two chapters that explore a wide range of cryptography applications.

Three basic types of chapters are featured to facilitate learning:

• Chapters that develop technical skills
• Chapters that describe a cryptosystem and present a method of analysis
• Chapters that describe a cryptosystem, present a method of analysis, and provide problems to test your grasp of the material and your ability to implement practical solutions

With consumers becoming increasingly wary of identity theft and companies struggling to develop safe, secure systems, this book is essential reading for professionals in e-commerce and information technology. Written by a professor who teaches cryptography, it is also ideal for students. ... Read more

Product Description
Innovative Cryptography, Second Edition provides a cutting-edge evaluation and review of current findings in the area of cryptography and explores how to implement these new techniques efficiently. It covers current cryptographic problems and suggests practical solutions. The book also discusses the role of symmetric ciphers and symmetric block ciphers, and details the need for fast symmetric ciphers for hardware (DES), software (RC5, Blowfish), and universal (AES, RC6, Twofish, IDEA, GOST) implementations. In addition, the book covers the issues surrounding the development and design of software-oriented ciphers, including ciphers based on the algorithm formed depending on the secret key. Some specific issues related to the cryptographic strength of ciphers with the flexible algorithm of data transformation are considered, and a combinational probabilistic model is suggested for obtaining minimal evaluations of the software ciphers being considered. A highly promising new command suggested to be used in universal processors is also discussed. This command executes controlled bit permutation, and is expected to sharply increase the performance of cryptographic algorithms including bit permutations of arbitrary type. Innovative Cryptography, Second Edition is written for anyone involved in the development of cryptopgraphic tools, including engineers, researches, programmers, and IT security professionals. ... Read more

Product Description
Today's information technology and security networks demand increasingly complex algorithms and cryptographic systems. Individuals implementing security policies for their companies must utilize technical skill and information technology knowledge to implement these security mechanisms.Cryptography and Security Devices: Mechanisms and Applications addresses cryptography from the perspective of the security services and mechanisms available to implement these services: discussing issues such as e-mail security, public-key architecture, virtual private networks, Web services security, wireless security, and the confidentiality and integrity of security services. This book provides scholars and practitioners in the field of information assurance working knowledge of fundamental encryption algorithms and systems supported in information technology and secure communication networks. ... Read more

Customer Reviews (1)

Not that good
I see that he wanted to make it easy, but perhaps he should have made it a bit more difficult. There is a lack of explanation in many area's of the book. Overall, not a nice flow of information either. Don't bother trying to review what you understood by answering questions at the end of the chapter. Many of them frequently ask questions that were simply never mentioned in the chapter or the entire book for that matter. I would avoid this book at all costs. ... Read more

Product Description

The author investigates proofs of correctness of realistic security protocols in a formal, intuitive setting. The protocols examined include Kerberos versions, smartcard protocols, non-repudiation protocols, and certified email protocols. The method of analysis turns out to be both powerful and flexible. This research advances significant extensions to the method of analysis, while the findings on the protocols analysed are novel and illuminating.

Product Description
Quantum cryptography is a rapidly developing field that draws from a number of disciplines, from quantum optics to information theory to electrical engineering. By combining some fundamental quantum mechanical principles of single photons with various aspects of information theory, quantum cryptography represents a fundamental shift in the basis for security from numerical complexity to the fundamental physical nature of the communications channel. As such, it promises the holy grail of data security: theoretically unbreakable encryption. Of course, implementing quantum cryptography in real broadband communications systems poses some unique challenges, including generating single photons, distilling random keys from the quantum key distribution process, and maintaining security at both the theoretical and practical level. Overall, quantum cryptography has a place in the history of secret keeping as a novel and potentially useful paradigm shift in the approach to broadband data encryption.Table of Contents: Introduction / Elements of Classical Cryptography / The Quantum Mechanics of Photons / Fundamentals of Quantum Key Distribution / Information Theory and Key Reconciliation / Components for Broadband QKD / A Survey of QKD Implementations / Conclusion - QKD in the Marketplace ... Read more

Customer Reviews (1)

Accessible and excellent introduction to the subject
Disclaimer: I am a professional colleague of the author and have previously coauthored several publications with him that are cited in this book.That being said, I find this book to be one of the best available monograph introductions to the field of quantum cryptography, for it is written in a most accessible style. I have recommended its reading to a graduating high school senior whom I hope to recruit for a summer internship in my research group.The treatment here is clear and expressive, and though it deals with quite advanced telecommunications concepts in later parts, it gives an elementary yet thoughtful introduction to the basic ideas of quantum cryptography, and a balanced set of references to current work. ... Read more

Product Description
The discrete logarithm problem based on elliptic and hyperelliptic curves has gained a lot of popularity as a cryptographic primitive. The main reason is that no subexponential algorithm for computing discrete logarithms on small genus curves is currently available, except in very special cases. Therefore curve-based cryptosystems require much smaller key sizes than RSA to attain the same security level. This makes them particularly attractive for implementations on memory-restricted devices like smart cards and in high-security applications.

The Handbook of Elliptic and Hyperelliptic Curve Cryptography introduces the theory and algorithms involved in curve-based cryptography. After a very detailed exposition of the mathematical background, it provides ready-to-implement algorithms for the group operations and computation of pairings. It explores methods for point counting and constructing curves with the complex multiplication method and provides the algorithms in an explicit manner. It also surveys generic methods to compute discrete logarithms and details index calculus methods for hyperelliptic curves. For some special curves the discrete logarithm problem can be transferred to an easier one; the consequences are explained and suggestions for good choices are given. The authors present applications to protocols for discrete-logarithm-based systems (including bilinear structures) and explain the use of elliptic and hyperelliptic curves in factorization and primality proving. Two chapters explore their design and efficient implementations in smart cards. Practical and theoretical aspects of side-channel attacks and countermeasures and a chapter devoted to (pseudo-)random number generation round off the exposition.

The broad coverage of all- important areas makes this book a complete handbook of elliptic and hyperelliptic curve cryptography and an invaluable reference to anyone interested in this exciting field. ... Read more

Customer Reviews (4)

Very thorough, but...
don't be fooled: This is a book written by experts, for professionals. The introductory chapters "cover" the mathematical preliminaries, but if you're not already familiar with the concepts, you won't get enough help there to be able to digest the real content of the book, which is very detailed, and looks to be very complete.

This is a reference book, not a textbook.

I gave it a 5-star rating because it would not be fair to down-grade the book because of my own limitations. However, in all honesty, I think most people interested in Elliptic Curve Cryptography will want to be introduced at "lower altitude".

A seminal work in its field
When I first opened this book, a tear fell from my eye.Never in my life have I seen such mathematical beauty as summarized from this book.Elliptic curves, isogenies, complex multiplication, higher order abelian varieties, finite fields, point counting, Teichmuller modulus, p-adic numbers, and applications to cryptography: it's all there, and in one amazing book.And the algorithms are written so perfectly that it is easy to translate to the computer language of your choice.Ladies and gentlemen, I promise you, you will not be disappointed by this masterpiece.

One of the best books on this domain
It is one of the best books about elliptic curve cryptography, taking the reader from the basics of number theory to the elaborate and tricky field of elliptic curves.
It takes into discussion both theoretical and practical aspects of the domain.

Very understandable overview of modern developments
Elliptic curve cryptography is now an entrenched field and has been subjected to an enormous amount of research in the last fifteen years. As soon as encryption schemes based on arithmetic in elliptic curves were proposed, it was natural to speculate on whether these schemes could be generalized to hyperelliptic curves or even general abelian varieties. This book gives an overview of what has been done, and even though most of the proofs are omitted, it does serve a need for those interested in the latest developments in the subject. This reviewer did not read the entire book, but concentrated instead on only a few parts that discussed developments in the last few years. Just skimming the book though will reveal that the authors have been very thorough in giving the reader the necessary mathematical background for a study of ECC and HECC cryptography. Readers needing more detailed background can consult the many references.

As expected, a substantial portion of the book is devoted to point counting methods. One of the methods discussed is the p-adic approach to counting the number of points on an elliptic curve over a field with a small characteristic, with the three most practical ones given the most attention. One of these, the Satoh algorithm, first computes the p-adic approximation of the canonical lift of an elliptic curve E over a finite field F(q), where q = p^d and p is a small prime. This involves lifting the j-invariants using a multivariate version of Newton's root finding algorithm. The trace of the Frobenius endomorphism must then be recovered, and this is done by using the action of the lift on a holomorphic differential on the lift. The resulting factoring problems are formidable, so instead the q-th Verschiebung, which is the dual isogeny to the Frobenius endomorphism is used. The Verschiebung is a separable morphism and the trace of an endomorphism is the trace of its dual. These facts are used to express the trace of the Frobenius endomorphism as a product (modulo q) of coefficients in Z(q). These coefficients are then calculated using certain polynomials.

Another algorithm using the p-adic approach to counting is the Arithmetic-Geometric-Mean (AGM) algorithm, which is discussed for the 2-adic case.As the name implies, this method is based on the AGM iteration, wherein a sequence of elliptic curves is constructed all of which are 2-isogenous to each other. This sequence is constructed so that it converges to the canonical lift of an ordinary elliptic curve, and then an explicit formula for the trace of the Frobenius map is derived. It is then shown how to extend the AGM algorithm to hyperelliptic curves by interpreting it as a special case of the Riemann duplication formula for theta functions.

The third p-adic algorithm discussed is called the Kedlaya algorithm and involves working with the affine curve associated to a hyperelliptic curve of genus g. Associated with this affine curve is its `dagger algebra,' the latter of which is discussed in the book and has its origins in the Monsky-Washnitzer cohomology for nonsingular affine curves over a finite field. This cohomology, which is currently listed under the classification of `rigid cohomology' is a cohomology for algebraic fields over fields of nonzero characteristic and can be considered to be a version of de Rham cohomology (in positive characteristic). In arises when one attempts to lift the Frobenius endomorphism on the coordinate ring of the curve to the coordinate ring of a lift of the curve. Taking the p-adic completion of the coordinate ring of the lift results in a de Rham cohomology which is even larger than the coordinate ring (the limit of exact differentials may not be exact), and so one works with a subring of the completion, which is called the `dagger ring.' The Frobenius endomorphism on the coordinate ring can then be lifted to a (Z(q)) endomorphism on the dagger ring. One can then define differentials of elements in the dagger ring, yielding a module over the dagger ring. The kernel and cokernel of this differential map can then be used to construct the zeroth and first Monsky-Washnitzer cohomology groups. The lift of the Frobenius endomorphism to the dagger ring induces an endomorphism on the cohomology groups, and this allows a Lefschetz fixed point formula to be proved, thus giving the number of rational points on the curve. The Kedlaya algorithm essentially follows this approach to do the point counting, but outputting the zeta function and working only for p greater than or equal to 3.

The book is not just a discussion on theoretical developments and computational algorithms, as an entire part of the book is devoted to applications. One of the applications discussed is that of `smart cards' which to date have been one of most widely used applications of cryptography. An entire chapter is spent on the hardware of smart cards, followed by one on how to attack the implementations of cryptosystems. One particular method for extracting the keys from inside a tamper-proof device involves the use of `power consumption analysis,' which is discussed in some detail in this chapter. The power consumption curve of the device or smart card is analyzed by the attacker, and this, coupled with an understanding of cryptographic algorithms, allows the keys to be compromised. Countermeasures against these attacks are discussed in the next chapter. The discussion is general enough in these chapters to give the motivated reader enough information to experiment with both attacking and with designing and testing effective countermeasures. ... Read more

Product Description
Text tells the story of Frank B. Rowlett, a codebreaker whose work was done for years before and during World War II in deepest secrecy. Although dozens of cryptographic systems of both friends and enemy were broken, the greatest triumph was perhaps that of breaking the Japanese PURPLE diplomatic cipher machine, the machine used for transmission of Japan's most secret and sensitive diplomatic messages before and after the entrance of the United States into World War II. Adding greatly to the book is its Foreword and Epilogue, written by David Kahn, author of The Codebreakers. Text includes pictures. ... Read more

Customer Reviews (5)

A tribute to a genius and a true patriot
I thought the book was very interesting and hard to put down.The detail was amazing until I realized the subject had kept notes of his early career. It left me wishing for more information about his war and post-war career. While the intricisies of the cryptanalytic processes described were hard to follow sometimes,enough information was given to keep the reader's interest. A real tribute to a genius and a national treasure. The book aroused my patriotic emotions.

a reader's review
Frank Rowlett's story is an intense day-by-day account oflife as a cryptanalyst in the Signal Intelligence Service during the years leading up to WW II.This story puts together important pieces of the historical puzzle.As a story, it is exciting, and brings history alive.

This book was published as a well bound, hardback, dust jacketed book by Aegean Park Press, a publishing house well known for re-printing (keeping available and alive) important Cryptanalytical, Cryptological, Cryptograhic publications in softcover 8-1/2" x 11" format.Just the way this particular publishing house, who specializes in crypto works is treating this book "screams" the high regard they have for it.

If you're looking for crypto course work, the how-to-do-it, Aegean Park Press has it, (though not in this book).If you are looking for the taste and feel, the heart and soul of real cryptanalysts enjoying their work, that IS the form & substance of this book; as well as being an important historical work.

Nothing new but in greater detail
This book goes into considerable detail regarding what was done but provides almost no information on how it was accomplished. Rowlett was one of a small group of mathematicians who were introduced to cryptography bythe legendary William Friedman. As recounted in the book, the group hadremarkable success in breaking both Red and Purple,the Japanese diplomaticcodes in use prior to WW II. Rowlett describes how the group was trainedunder Friedman's direction but supplies no information what so everregarding the nature of the training. This is the case throughout the bookas it relates to how every issue of importance was analyzed. The section ofthe book which describes the construction of the device to decode Purple isexcellent in recreating the intensity of the event. One can almost smellthe odor of burning electrial equipment when the contacts on the firstversion of the device melt and then fuse. Rowlett was obviously acutelyaware of the importance of protecting the technical information related tothe activities he was engaged in ; however, in doing so he produced adocument which although descriptive is not at all informative. It is highlyunlikely, because of antiquated security considerations, that the fullstory of this remarkable accomplishment will ever be presented at a levelof granularity it deserves.

A fascinating book on World War II secert communications.
This book by a pioneer cryptanalyst gives afascinating insight into how Army cryptanalystsdeveloped the skills and techniques that lead to the breaking of the high level Japanese Diplomatic code "Purple". Itdescribes how the team lead by Rowlett duplicated the complex JapanesePurple cipher machine from manually broken intercepted messages - a featthat astonished Navy cryptanalysts.It describes how Rowlett developed theconcepts for a code machine used by the United States during World War IIthat was never broken by enemy cryptanalysts. The overall account isexciting. It gives the reader a behind the scene look at the numerousobstacles American cryptanalysts faced both internally and externally - andhow they overcame them. It is written by a man who for security reasonsremained in the shadows for years but in the world of secret communicationsstood as a giant. After reading The Story of Magic one should read Hitler'sJapanese Confidant by Carl Boyd. The reader can then begin to fullyappreciate how reading Japanese diplomatic messages contributed to theUnited States diplomatic and military successes.

Fascinating reading for anyone interested in cryptography
Truly a great American hero -- Rowlett provides an abundance of detailed history and information regarding U.S. cryptography during WWII.

His book demonstrates how he applied his genius in extremely high stakesmilitary situations involving the development and application of codebreaking and encryption technology.

The author is able to keep thereader's interest in dealing with a complex subject.

An intriguingdisclosure of highly secret activities that moves one from the days of the"Little Orphan Annie Secret Decoder Pin" to the ultimate in theuse of electronic machines in the 1940's. ... Read more

Product Description

Cryptography in Chinese consists of two characters meaning "secret coded". Thanks to Ch'in Chiu-Shao and his successors, the Chinese Remainder Theorem became a cornerstone of public key cryptography. Today, as we observe the constant usage of high-speed computers interconnected via the Internet, we realize that cryptography and its related applications have developed far beyond "secret coding". China, which is rapidly developing in all areas of technology, is also writing a new page of history in cryptography. As more and more Chinese become recognized as leading researchers in a variety of topics in cryptography, it is not surprising that many of them are Professor Xiao's former students.

Progress on Cryptography: 25 Years of Cryptography in China is a compilation of papers presented at an international workshop in conjunction with the ChinaCrypt, 2004. After 20 years, the research interests of the group have extended to a variety of areas in cryptography. This edited volume includes 32 contributed chapters. The material will cover a range of topics, from mathematical results of cryptography to practical applications. This book also includes a sample of research, conducted by Professor Xiao's former and current students.

Progress on Cryptography: 25 Years of Cryptography in China is designed for a professional audience, composed of researchers and practitioners in industry. This book is also suitable as a secondary text for graduate-level students in computer science, mathematics and engineering.

Product Description
Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, held on Cheju Island, Korea, February 13-15, 2001. Topics include identification, signature and signcryption, marking, the security of Lenstra's variant of DSA, and more. Softcover. ... Read more

Product Description
These six comprehensive lectures, with illustrations, were prepared and delivered at NSA headquarters by Mr.Friedman at the request of the Agency in order to have the history of cryptology recorded by the most eminent pioneer in the application of scientific principles to the field -- one who, without question, laid the foundation for modern concepts of cryptography and cryptanalysis. Text contains a complete historical study concerning cryptography and cryptanalysis. ... Read more

Customer Reviews (1)

Classic Material but Poorly Reproduced
Friedman is an important figure in the history of cryptology. For students of the subject, reading orginal writings by the man credited with breaking the "Purple Code" is de rigueur. The content of this material is very good but the quality of reproduction is sub-standard. ... Read more

Product Description
This book provides a practical introduction to cryptographic principles and algorithms for communication security and data privacy--written by one of the world's leading authorities on encryption and coding. ... Read more