ENC: Review of Cryptanalysis book?
Remember I asked some time ago about a review for Samuel Wagstaff's recent book on cryptanalysis of number theoretic ciphers? I still haven't found any, but I wrote to Samuel to ask him if he knew if any existed. Below I have, with his permission, copied his answer. Regards, Mads -Mensagem original- De: Samuel S Wagstaff [mailto:[EMAIL PROTECTED] Enviada em: quarta-feira, 2 de abril de 2003 17:44 Para: Mads Rasmussen Assunto: Re: Review of Cryptanalysis book? Dear Mads, In fact I have not seen a review of my book yet. I think it is too soon for one to be published, although I expect that reviews of it are being prepared. If I wrote a review, of course it would be favorably biased and so not much use to you. An announcement (flyer) describing the book is available at the URL <http://www.cerias.purdue.edu/homes/ssw/contc/index.html> Part of the Preface to the book is appended to this note. Perhaps that will satisfy your employer. Sincerely, Sam Wagstaff -- >From the Preface of Cryptanalysis of Number Theoretic Ciphers: This work has its origins in a cryptography course taught by the author many times during the past twenty years in the Computer Science Department at Purdue University. Part I gives the mathematical background for cryptography as well as some definitions and simple examples from cryptography. The cryptographic definitions appear in the first chapter. The second chapter treats some topics from elementary probability theory which are needed most for cryptanalysis. Chapters 3 through 7 give a standard first course in elementary number theory, but with a slant toward computation and with the needs of cryptography always in mind. Thus, Chapter 3, on divisibility, also tells how to perform arithmetic with large integers and Chapter 4, which is about primes, discusses the probability that a ``random'' large integer will have only small prime factors. This topic is rarely discussed in the chapter on primes in an elementary number theory book, but is needed to estimate the difficulty of breaking certain ciphers. Chapter 5 introduces congruences, which are used in many modern cryptographic algorithms. Chapter 6 proves Fermat's little theorem and Euler's generalization of it. These important results are used throughout the rest of the book. This chapter also introduces primitive roots and discrete logarithms, which are needed for many ciphers and protocols. Chapter 7 deals with the solution of quadratic congruences. We do not prove the quadratic reciprocity law, but do explain its importance in computation. We state this law in a form useful for programming rather than in the slick concise way found in many number theory texts. Chapter 8 introduces information theory and gives examples of some obsolete ciphers. Chapter 9 offers a selection of topics from modern algebra that are used in later chapters to make and break various ciphers. Chapters 10 through 13 treat the complementary problems of factoring large integers and identifying large primes. Many cryptographic algorithms begin by choosing large primes. Some ciphers and protocols can be broken by factoring a large integer. Slow but nevertheless important factoring methods are the topic of Chapter 10. In Chapter 11, the reader learns how to tell whether a large integer is probably prime, how to give a rigorous proof that a large number is prime, and how to construct large primes that have an easy rigorous proof of primality. Chapter 12 deals with the important elliptic curve groups used in prime proofs, in factoring integers, and directly in ciphers and protocols. The fastest known factoring algorithms are described in Chapter 13. Chapter 14 discusses the best ways to break certain ciphers by computing ``discrete logarithms.'' We describe several good methods for choosing random numbers in Chapter 15. Cryptographic algorithms that need secret random integers can be compromised if the numbers are not sufficiently random. Part II describes a selection of cryptographic algorithms, most of which use number theory. Chapter 16 presents some single-key ciphers, in which all keys are supposed to remain secret. Rijndael, the new Advanced Encryption Standard, is the fastest of these ciphers. The Pollig-Hellman ciphers are slower, but enjoy special properties which make them useful in certain protocols. Chapter 17 introduces public-key ciphers, including those of Rivest, Shamir and Adleman, Massey-Omura, ElGamal, and Rabin-Williams. Methods of signing messages electronically are presented in Chapter 18. Chapter 19 explains ways for two users to exchange keys in a secure manner, so that no one else can discover these keys by eavesdropping on their messages, and so that the users can be sure that they are talking to each other and not to an impersonator. In Chapter 20 we describe simple protocols for playing games, sharing secrets, signing documents wit
RES: Test Vectors?
> -Mensagem original- > De: Ben Laurie [mailto:[EMAIL PROTECTED] > Enviada em: sexta-feira, 28 de março de 2003 05:14 > Para: Cryptography > Assunto: Test Vectors? > > Does anyone have test vectors for the X19.7 PRNG (HAC p.173)? The NIST STS PRNG test suite includes an implementation for X9.17 http://csrc.nist.gov/rng/sts-1.5.tar look in generators/generator3.c Mads - The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
SV: REQ: Review of Nigel Smart's "Introduction to Cryptography"
Thanks, I wasn't aware of that More info at http://cryptography.informatik.fh-nuernberg.de/ It seems like chapters 9 and 10 are what you were referring to Regards, Mads > -Oprindelig meddelelse- > Fra: Jaap-Henk Hoepman [mailto:[EMAIL PROTECTED] > Actually, there's the textbook "Introduction to Cryptography" > by Delfs and > Knebl that covers provably secure encryption and digital > signatures as well. > Published by Springer. > > Jaap-Henk > > On Fri, 7 Mar 2003 15:14:04 -0300 "Mads Rasmussen" > <[EMAIL PROTECTED]> writes: > > Has anyone read Nigel Smart's book from late 2002, "introduction to > > Cryptography" > > > > The latest IACR newsletter brought an overview and TOC of the book, > > which I found interesting. It seems to me the first time provable > > security is mentioned in a textbook (see part IV, 17 and 18) > > > > As the newsletter said, more info is available at > > > > http://www.mcgraw-hill.co.uk/html/0077099877.html > > <http://www.mcgraw-hill.co.uk/html/0077099877.html> > > > - The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
REQ: Review of Nigel Smart's "Introduction to Cryptography"
Has anyone read Nigel Smart's book from late 2002, "introduction to Cryptography" The latest IACR newsletter brought an overview and TOC of the book, which I found interesting. It seems to me the first time provable security is mentioned in a textbook (see part IV, 17 and 18) As the newsletter said, more info is available at http://www.mcgraw-hill.co.uk/html/0077099877.html <http://www.mcgraw-hill.co.uk/html/0077099877.html> I would be very interested in hearing from someone that read the book on how this material is presented. I find Bellare and Rogaway's lecture notes magnificent but it isn't a textbook. I quoted the excerpt from the IACR newsletter below for those who might be interested Regards, Mads Rasmussen -- Cryptography, An Introduction by Nigel Smart, McGraw-Hill, 2002. ISBN 0 077 09987 7 (PB). Nigel Smart's Cryptography provides the rigorous detail required for advanced cryptographic studies, yet approaches the subject matter in an accessible style in order to gently guide new students through difficult mathematical topics. Covering the latest developments in cryptography, including the Rijndael algorithm chosen for the new Advanced Encryption Standard, the OAEP padding system for RSA, elliptic curve based systems and provable security this book is a complete introduction to cryptography. Part I Mathematical Background 1 Modular Arithmetic, Groups, Finite Fields and Probability 2 Elliptic Curves Part II Symmetric Encryption 3 Historical Ciphers 4 Information Theoretic Security 5 Symmetric Ciphers 6 Symmetric Key Distribution Part III Public Key Encryption and Signatures 7 Basic Public Key Encryption Algorithms 8 Primality Testing and Factoring 9 Discrete Logarithms 10 Key Exchange, Signature Schemes and Hash Functions 11 Implementation Issues 12 Obtaining Authentic Public Keys 13 Protocols Part IV Security Issues 14 Attacks on Public Key Schemes 15 Definitions of Security 16 Complexity Theoretic Approaches 17 Provable Security: With Random Oracles 18 Provable Security: Without Random Oracles Appendices Appendix A Basic Mathematical Terminology Appendix B Java Examples Index - The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
ENC: Proven Primes
> -Mensagem original- > De: Ben Laurie [mailto:[EMAIL PROTECTED] > Enviada em: quinta-feira, 6 de março de 2003 08:47 > Para: Cryptography > Assunto: Proven Primes > > I'm looking for a list or lists of sensibly sized proven primes - all > the lists I can find are more interested in records, which are _way_ too > big for cryptographic purposes. > > By "sensibly sized" I mean in the range 512-8192 bits. I'm particularly > after Sophie Germain primes right now, but I guess all primes are of > interest. You might look at the IKE groups The Internet Key Exchange (IKE) http://www.ietf.org/rfc/rfc2409.txt "More MODP Diffie-Hellman groups for IKE" http://www.ietf.org/internet-drafts/draft-ietf-ipsec-ike-modp-groups-05. txt Regards, Mads - The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
RES: Request: review of new Cryptanalysis book
> -Mensagem original- > De: Anton Stiglic [mailto:[EMAIL PROTECTED]] > Enviada em: sexta-feira, 31 de janeiro de 2003 16:50 > Para: Mads Rasmussen > Assunto: Re: Request: review of new Cryptanalysis book > > There was a small thread on sci.crypt > > http://groups.google.ca/groups?hl=en&lr=&ie=UTF-8&oe=UTF- >8&threadm=3C01F24E.89E065AC%40compuserve.com&rnum=1&prev=/groups%3Fq%3D sci.>crypt%2BWagstaff%26hl%3Den%26lr%3D%26ie%3DUTF-8%26oe%3DUTF->8%26sel m%3D3C01F24E.89E065AC%2540compuserve.com%26rnum%3D1 > > (the URL will probably break up, just stick everything together). > > The only relevant reply was a speculative one by Molnar. Thanks Anton, This description refers to a published contents index of the book that the author published online (CRC press) long before the book was published. The comment by Molnar, however, might still be valid. That's why a review would be nice :) Mads - The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
RES: Request: review of new Cryptanalysis book
Hmm nobody reacted to my request :( I found this recently, not really a review, but here it goes http://www.cerias.purdue.edu/homes/ssw/contc/C1534FL.pdf I guess I have to cough up the 80 bucks and see for myself :o( Mads Rasmussen Open Communications Security +55(11)3345-2525 > -Mensagem original- > De: Mads Rasmussen > Enviada em: quinta-feira, 23 de janeiro de 2003 09:16 > Para: [EMAIL PROTECTED] > Assunto: Request: review of new Cryptanalysis book > > I wonder if anyone reading this list has read the following book: > > Cryptanalysis of Number Theoretic Ciphers > by Samuel S., Jr. Wagstaff, Mikhail J. Atallah (Editor) > ISBN: 1584881534 > CRC Press > > See the following link for details > > http://www.crcpress.com/shopping_cart/products/product_detail.asp?sku=C1 > 534&parent_id=&pc= > > I would appreciate any comments > > Regards, > > Mads Rasmussen > Open Communications Security > +55(11)3345-2525 > > > - > The Cryptography Mailing List > Unsubscribe by sending "unsubscribe cryptography" to > [EMAIL PROTECTED] - The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
Request: review of new Cryptanalysis book
I wonder if anyone reading this list has read the following book: Cryptanalysis of Number Theoretic Ciphers by Samuel S., Jr. Wagstaff, Mikhail J. Atallah (Editor) ISBN: 1584881534 CRC Press See the following link for details http://www.crcpress.com/shopping_cart/products/product_detail.asp?sku=C1 534&parent_id=&pc= I would appreciate any comments Regards, Mads Rasmussen Open Communications Security +55(11)3345-2525 - The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
Chaotic encryption research being evaluated
Giving a recent thread on sci.crypt about chaotic encryption I thought this seemed interesting The actual paper is available from the link below >From Security Wire Digest Vol 5 No 5 The --- *CHAOTIC ENCRYPTION RESEARCH BEING EVALUATED By Carl Weinschenk A new approach to chaotic encryption proposed by researchers at Beijing Normal University has a good pedigree, but many experts are taking a wait-and-see attitude on its speed and security. Chaotic encryption employs an algorithm to transmit information in a stream that grows increasingly disordered--or chaotic--over time. The receiver can use the algorithm to remove the random data. This, in essence, rolls back the clock to reveal the initial data. The challenge to the commercialization of any new encryption technique--one that chaotic encryption hasn't reached--is proving it's as fast and secure as existing systems, such as TripleDES, says Jon Callas, CTO of PGP Corp. The research on encrypting two-way voice communications using chaotic encryption was reported in Physical Review E. Dr. Hu Gang, who led the research, says that the approach has commercial potential because it uses fast "single round" analytical computations. The speed is achieved without compromising security because the type of chaos used--"spatiotemporal"--is highly secure. "The particular advantage with our system is that we can produce ciphertexts in each round," he says. "Professor Hu...has a very talented group of researchers and does excellent work," says Rajarshi Roy, a professor in the Department of Physics and the Institute for Physical Science and Technology at the University of Maryland. "As a method of speech encoding using computer hardware and software, this is an interesting technique, and its privacy and security need to be studied." But Janusz Szczepanski, a researcher at the Polish Academy of Sciences' Institute of Fundamental Technological Research, says the authors have only considered one type of attack, so the jury is still out on the quality of this method's security. "I have looked at their system and, without detailed analysis, I can point out some points that can be attacked," says Szczepanski. He awaits the further research that the paper's authors say is coming. http://ojps.aip.org/getabs/servlet/GetabsServlet?prog=normal <http://ojps.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=PLEEE80 000660606520201&idtype=cvips&gifs=yes&jsessionid=339324104281771 0305> &id=PLEEE8660606520201&idtype=cvips&gifs=yes&jsessionid=3393 241042817710305 --- Mads Rasmussen Open Communications Security +55(11)3345-2525 - The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
