e99 Online Shopping Mall
Help | |
Home - Science - Cryptography (Books) |
  | Back | 61-80 of 100 | Next 20 |
click price to see details click image to enlarge click link to go to the store
61. Access Control, Security, and Trust: A Logical Approach (Chapman & Hall/CRC Cryptography and Network Security Series) by Shiu-Kai Chin, Susan Beth Older | |
Hardcover: 351
Pages
(2010-07-26)
list price: US$89.95 -- used & new: US$71.89 (price subject to change: see help) Asin: 1584888628 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Developed from the authors’ courses at Syracuse University and the U.S. Air Force Research Laboratory, Access Control, Security, and Trust: A Logical Approach equips readers with an access control logic they can use to specify and verify their security designs. Throughout the text, the authors use a single access control logic based on a simple propositional modal logic. The first part of the book presents the syntax and semantics of access control logic, basic access control concepts, and an introduction to confidentiality and integrity policies. The second section covers access control in networks, delegation, protocols, and the use of cryptography. In the third section, the authors focus on hardware and virtual machines. The final part discusses confidentiality, integrity, and role-based access control. Taking a logical, rigorous approach to access control, this book shows how logic is a useful tool for analyzing security designs and spelling out the conditions upon which access control decisions depend. It is designed for computer engineers and computer scientists who are responsible for designing, implementing, and verifying secure computer and information systems. |
62. Codes: An Introduction to Information Communication and Cryptography (Springer Undergraduate Mathematics Series) by Norman L. Biggs | |
Paperback: 274
Pages
(2008-08-08)
list price: US$49.95 -- used & new: US$29.53 (price subject to change: see help) Asin: 1848002726 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Information is an important feature of the modern world. Mathematical techniques underlie the devices that we use to handle it, for example, mobile phones, digital cameras, and personal computers. This book is an integrated introduction to the mathematics of coding, that is, replacing information expressed in symbols, such as a natural language or a sequence of bits, by another message using (possibly) different symbols. There are three main reasons for doing this: economy, reliability, and security, and each is covered in detail. Only a modest mathematical background is assumed, the mathematical theory being introduced at a level that enables the basic problems to be stated carefully, but without unnecessary abstraction. Other features include: This modern introduction to all aspects of coding is suitable for advanced undergraduate or postgraduate courses in mathematics, computer science, electrical engineering, or informatics. It is also useful for researchers and practitioners in related areas of science, engineering and economics. Customer Reviews (1)
excellent basic text |
63. Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography (Texts in Theoretical Computer Science. An EATCS Series) by Juraj Hromkovic | |
Paperback: 313
Pages
(2010-11-02)
list price: US$89.95 -- used & new: US$71.97 (price subject to change: see help) Asin: 3642057292 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network design. |
64. Cryptography: An Introduction by Nigel Smart | |
Paperback: 433
Pages
(2004-12-30)
list price: US$97.30 Isbn: 0077099877 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
65. Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography (Mathematical Sciences Research Institute Publications) | |
Hardcover: 662
Pages
(2008-10-20)
list price: US$99.00 -- used & new: US$60.00 (price subject to change: see help) Asin: 0521808545 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
66. Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series) (v. 2) | |
Paperback: 298
Pages
(2005-05-31)
list price: US$69.99 -- used & new: US$50.00 (price subject to change: see help) Asin: 052160415X Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (3)
The latest cutting edge research on Elliptic Curve Cryptography
Good compact book on elliptic curves in cryptography The next three chaptersconcentrate on how to actually generate elliptic curves for cryptosystems,with particular attention payed to the Schoof Algorithm. The chapter onSchoof's algorithm is more detailed than the rest of the chapters and thismakes for better reading. The authors do discuss how to generate curvesusing complex multiplication although the discussion is somewhat hurried. The next chapter discusses how elliptic curves have been applied to otherareas in cryptography, such as factoring, etc. A good discussion of theECPP algorithm on proving primality ends the chapter.The authors endthe chapter with a discussion of hyperelliptic cryptography. Anyonefamiliar with the theory of elliptic curves and how they are applied tocryptography will naturually ask if hyperelliptic curves have anyadvantages over the elliptic case. The authors never really address thisexplicity but do give examples on just what is involved in implementinghyperelliptic curves in cryptography. Overall a fine addition to theliterature on elliptic curves in cryptography. One would hope that theauthors would write a follow-up book on hyperelliptic curves and maybe ongeneral algebraic curves and their possible use in this area.
Good book |
67. Practical Signcryption (Information Security and Cryptography) | |
Hardcover: 278
Pages
(2010-10-29)
list price: US$99.00 -- used & new: US$79.20 (price subject to change: see help) Asin: 3540894098 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
68. Public Key Cryptography - PKC 2005: 8th International Workshop on Theory and Practice in Public Key Cryptography (Lecture Notes in Computer Science / Security and Cryptology) | |
Paperback: 436
Pages
(2005-02-24)
list price: US$99.00 -- used & new: US$69.35 (price subject to change: see help) Asin: 3540244549 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description This book constitutes the refereed proceedings of the 8th International Workshop on Theory and Practice in Public Key Cryptography, PKC 2005, held in Les Diablerets, Switzerland in January 2005. The 28 revised full papers presented were carefully reviewed and selected from 126 submissions. The papers are organized in topical sections on cryptanalysis, key establishment, optimization, building blocks, RSA cryptography, multivariate asymmetric cryptography, signature schemes, and identity-based cryptography. |
69. Algebraic Aspects of Cryptography (Algorithms and Computation in Mathematics) by Neal Koblitz | |
Paperback: 206
Pages
(2010-11-30)
list price: US$139.00 -- used & new: US$139.00 (price subject to change: see help) Asin: 3642083323 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description From the reviews: "This is a textbook in cryptography with emphasis on algebraic methods. It is supported by many exercises (with answers) making it appropriate for a course in mathematics or computer science. [...] Overall, this is an excellent expository text, and will be very useful to both the student and researcher." Mathematical Reviews Customer Reviews (2)
Excellent, but only if you have extensive knowledge of math The book can be great for students with the mathematical prerequisites and with sufficient mathematical maturity to understand elaborate definitions, theorems and proofs and who want to learn the material efficiently and quickly. The beginning student is advised to look for other, more elementary textbooks. The book contains many exercises with solutions at the end of the book.
Excelent |
70. Cryptography: An Introduction to Computer Security (Advances in Computer Science Series) by Jennifer Seberry, Josef Pieprzyk | |
Hardcover: 689
Pages
(1989-09)
list price: US$66.00 -- used & new: US$35.98 (price subject to change: see help) Asin: 0131949861 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Customer Reviews (1)
A book mismatched to its subject Unfortunately, there is no book I know of that gives adequate treatment even to the role of cryptography in computer security, let alone to the entire subject of computer security, so we learn the hard way, from our mistakes. The only book I know that places this topic in proper perspective is "Cryptography's Role In Securing The Information Society" created in 1996 by the Computer Science and Technology Board of the National Research Council, and published by the National Academy Press. This latter book is kind of interminably boring, and it raises far more questions than it answers, but it's the best we've got; it's well balanced, and was prepared by a group of hard-bitten scientists and engineers with lots of practical experience (plenty of it bad.) So if you want to know how cryptography relates to computer security (maybe), read this latter book, not Seberry and Pieprzyck. ... Read more |
71. Algorithmic Cryptanalysis (Chapman & Hall/CRC Cryptography and Network Security Series) by Antoine Joux | |
Hardcover: 519
Pages
(2009-06-15)
list price: US$89.95 -- used & new: US$50.00 (price subject to change: see help) Asin: 1420070029 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program. Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applications. The final part addresses more sophisticated cryptographic applications, including LFSR-based stream ciphers and index calculus methods. Accounting for the impact of current computer architectures, this book explores the algorithmic and implementation aspects of cryptanalysis methods. It can serve as a handbook of algorithmic methods for cryptographers as well as a textbook for undergraduate and graduate courses on cryptanalysis and cryptography. |
72. Elliptic Curves: Number Theory and Cryptography, Second Edition (Discrete Mathematics and Its Applications) by Lawrence C. Washington | |
Hardcover: 536
Pages
(2008-04-03)
list price: US$91.95 -- used & new: US$62.17 (price subject to change: see help) Asin: 1420071467 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description New to the Second Edition Taking a basic approach to elliptic curves, this accessible book prepares readers to tackle more advanced problems in the field. It introduces elliptic curves over finite fields early in the text, before moving on to interesting applications, such as cryptography, factoring, and primality testing. The book also discusses the use of elliptic curves in Fermat’s Last Theorem. Relevant abstract algebra material on group theory and fields can be found in the appendices. Customer Reviews (1)
review of "Elliptic Curves" by Washington |
73. Encyclopedia of Cryptography and Security | |
Hardcover: 684
Pages
(2005-08-10)
list price: US$349.00 -- used & new: US$218.99 (price subject to change: see help) Asin: 038723473X Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description This comprehensive encyclopedia provides easy access to information on all aspects of cryptography and security. With an A–Z format of over 460 entries, 100+ international experts provide an accessible reference for those seeking entry into any aspect of the broad fields of cryptography and information security. Most entries in this preeminent work include useful literature references, providing more than 2500 references in total. Topics for the encyclopedia were selected by a distinguished advisory board consisting of 18 of the world’s leading scholars and practitioners. Main subject areas include: Authentication and identification Block ciphers and stream ciphers Computational issues Copy protection Cryptanalysis and security Cryptographic protocols Electronic payment and digital certificates Elliptic curve cryptography Factorization algorithms and primality tests Hash functions and MACs Historical systems Identity-based cryptography Implementation aspects for smart cards and standards Key management Multiparty computations like voting schemes Public key cryptography Quantum cryptography Secret sharing schemes Sequences Web security The style of the entries in the Encyclopedia of Cryptography and Security is expository and tutorial rather than detailed and technical, making the book a practical resource for information security experts as well as professionals in other fields who need to access this vital information but who may not have time to work their way through an entire text on their topic of interest. The underlying concepts in information security can be difficult to understand and may even be counter-intuitive. The Encyclopedia of Cryptography and Security will become the premier reference work on this complex subject. Customer Reviews (1)
excellent coverage of crypto! |
74. Public Key Cryptography | |
Paperback: 485
Pages
(2000-02-03)
list price: US$94.95 -- used & new: US$7.69 (price subject to change: see help) Asin: 3540669671 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
75. Cryptanalysis of RSA and Its Variants (Chapman & Hall/CRC Cryptography and Network Security Series) by M. Jason Hinek | |
Hardcover: 272
Pages
(2009-07-21)
list price: US$79.95 -- used & new: US$53.96 (price subject to change: see help) Asin: 1420075187 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Thirty years after RSA was first publicized, it remains an active research area. Although several good surveys exist, they are either slightly outdated or only focus on one type of attack. Offering an updated look at this field, Cryptanalysis of RSA and Its Variants presents the best known mathematical attacks on RSA and its main variants, including CRT-RSA, multi-prime RSA, and multi-power RSA. Divided into three parts, the book first introduces RSA and reviews the mathematical background needed for the majority of attacks described in the remainder of the text. It then brings together all of the most popular mathematical attacks on RSA and its variants. For each attack presented, the author includes a mathematical proof if possible or a mathematical justification for attacks that rely on assumptions. For the attacks that cannot be proven, he gives experimental evidence to illustrate their practical effectiveness. Focusing on mathematical attacks that exploit the structure of RSA and specific parameter choices, this book provides an up-to-date collection of the most well-known attacks, along with details of the attacks. It facilitates an understanding of the cryptanalysis of public-key cryptosystems, applications of lattice basis reduction, and the security of RSA and its variants. |
76. User's Guide To Cryptography And Standards (Artech House Computer Security) by Alex W. Dent, Chris J. Mitchell | |
Hardcover: 402
Pages
(2004-10-31)
list price: US$95.00 -- used & new: US$85.25 (price subject to change: see help) Asin: 1580535305 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (1)
UNDERPINNING THE SECURITY OF THE ELECTRONICS WORLD |
77. Cryptography: A New Dimension in Computer Data Security by Carl Meyer, S. M. Matyas | |
Hardcover: 780
Pages
(1982-09)
list price: US$195.00 -- used & new: US$99.00 (price subject to change: see help) Asin: 0471048925 Canada | United Kingdom | Germany | France | Japan | |
78. Quantum Cryptography and Secret-Key Distillation by Gilles Van Assche | |
Hardcover: 276
Pages
(2006-07-17)
list price: US$99.00 -- used & new: US$73.59 (price subject to change: see help) Asin: 0521864852 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
79. The LLL Algorithm: Survey and Applications (Information Security and Cryptography) | |
Hardcover: 496
Pages
(2009-12-02)
list price: US$129.00 -- used & new: US$100.92 (price subject to change: see help) Asin: 3642022944 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description The LLL algorithm is a polynomial-time lattice reduction algorithm, named after its inventors, Arjen Lenstra, Hendrik Lenstra and László Lovász. The algorithm has revolutionized computational aspects of the geometry of numbers since its introduction in 1982, leading to breakthroughs in fields as diverse as computer algebra, cryptology and algorithmic number theory. This book consists of 15 survey chapters on computational aspects of Euclidean lattices and their main applications. Topics covered include polynomial factorization, lattice reduction algorithms, applications in number theory, integer programming, provable security, lattice-based cryptography and complexity. The authors include many detailed motivations, explanations and examples, and the contributions are largely self-contained. The book will be of value to a wide range of researchers and graduate students working in related fields of theoretical computer science and mathematics. |
80. Elliptic Curves: Number Theory and Cryptography (Discrete Mathematics and Its Applications) by Lawrence C. Washington | |
Hardcover: 440
Pages
(2003-05-28)
list price: US$89.95 -- used & new: US$231.70 (price subject to change: see help) Asin: 1584883650 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (5)
Washington Elliptic Curves
Solid intermediate introduction to elliptic curves
A clear, concise introduction to elliptic curves
It might be a good book for a mathematic student but not a good one for an engineering student.
Excellent The author begins the book with two neat problems that motivate well the subject of elliptic curves: the pyramid of cannonballs and the right triangle problem, i.e. which integers can occur as areas of right triangles with integer sides? He then immediately begins the elementary theory of ECs in chapter 2. The treatment is pretty standard, although he proves Pascal's and Pappus's theorems using the associativity of the group operation on ECs, which is not usually done in books on ECs. Also somewhat non-standard this early in the game is the discussion of reduction of ECs modulo various primes, and the subsequent definitions of additive, split multiplicative, and non-split multiplicative reduction. The study of torsion points is done in chapter 3 with the Weil pairing on the n-torsion of an EC taking center stage. A fairly short chapter, the author delays the proof of the properties of the Weil pairing until chapter 11, where it is done with divisors. Chapter 4 deals with elliptic curves over finite fields, and is one of the most important in the book from the standpoint of cryptographic applications of ECs. Hasse's theorem, giving the bounds for the group of points on an EC over a finite field, is proven in detail. The Frobenius endomorphism is introduced, and a proof of Schoof's algorithm for computing the number of points on ECs over a finite field is given a detailed treatment. There are many symbolic computational software packages in both the open and commerical realm which will do the counting straightforwardly, and anyone interested in cryptography will need to be familiar with some of these. Supersingular curves in characteristic p are introduced, and the author gives a good discussion of the reason why they are named as such. The discrete logarithm problem, a topic also very important for cryptographic applications, is discussed in chapter 5. The chapter beings with the index calculus, and, recognizing that it does not apply to general groups, the Pohlig-Hellman, baby step-giant step method, and Pollards rho and lambda methods are discussed in details. The author then shows that for supersingular and "anomalous" curves, that the discrete logarithm problem can be reduced to an easier discrete logarithm problem. Along the way, two important concepts are introduced: the p-adic valuation, and the Tate-Lichtenbaum pairing, the latter of which is related to the Weil pairing, but applies to situations where the Weil pairing does not. Elliptic curve cryptography is then discussed in chapter 6, and the treatment is fairly thorough. The author shows to what extent the Decision Diffie-Hellman problem can be solved using the Weil pairing. He also shows how to represent a message on an elliptic curve, satisfying early on any reader's curiosity on just how this is done. The El Gamal and ECDSA are compared in terms of their computational efficiency. An EC generalization of RSA is also discussed in some detail, along with a cryptosystem based on the Weil pairing. Chapter 7 then gives other applications of ECs, such as factoring and primality testing. Chapter 8 marks the beginning of the "heavy artillery" in the theory of ECs, for here the author begins the discussion of elliptic curves over the rational numbers, which can be viewed as an example of Diophantine geometry. The famous Mordell-Weil theorem is proved, and as a sign that one is definitely in the arena of modern mathematics, the proof is given in terms of Galois cohomology, which is an abstraction of the Fermat method of descent. The reader gets a taste of height functions, and via some good examples, gets insight into why the rank of the EC is so difficult to compute. A neat example is given of a nontrivial Shafarevich-Tate group. I did not read the chapters 9, 10, or 11 on ECs over the complex numbers, complex multiplication, and divisors, so I will omit their review. Chapter 12 introduces the famous zeta functions, and their use in obtaining arithmetic information about an EC. Zeta functions motivate the definition of an L-function of an EC, these being tremendously important in modern developments in the theory of ECs, such as the Swinnerton-Dyer and Birch conjecture, the latter of which is motivated rather nicely in this chapter. The last chapter of the book is an excellent introduction to the proof of Fermat's Last Theorem. Considering the level of the book, the author captures very well the essential ideas. Readers will be well prepared, after studying more algebraic number theory and the theory of Galois representations (which the author only skims in the book), to tackle the full proof if so desired. ... Read more |
  | Back | 61-80 of 100 | Next 20 |