1998, ISBN: 3540634460

[EAN: 9783540634461], Neubuch, [PU: Springer Berlin Heidelberg Jan 1998], ALGEBRA; KRYPTOGRAFIE; VERSCHLÜSSELUNG; DES; DIGITAL SIGNATURE ALGORITHM; ALGEBRAIC METHODS; ALGORITHMS; COMPLEXI… Mehr…

[EAN: 9783540634461], Neubuch, [PU: Springer Berlin Heidelberg Jan 1998], ALGEBRA; KRYPTOGRAFIE; VERSCHLÜSSELUNG; DES; DIGITAL SIGNATURE ALGORITHM; ALGEBRAIC METHODS; ALGORITHMS; COMPLEXITY; COMPUTATIONAL NUMBER THEORY; DATA SECURITY; ELLIPTIC AND HYPERELLIPTIC CURVES; FINITE FIELD; LINEAR COMBINATORICS, This item is printed on demand - it takes 3-4 days longer - Neuware -This book is intended as a text for a course on cryptography with emphasis on algebraic methods. It is written so as to be accessible to graduate or advanced undergraduate students, as well as to scientists in other fields. The first three chapters form a self-contained introduction to basic concepts and techniques. Here my approach is intuitive and informal. For example, the treatment of computational complexity in Chapter 2, while lacking formalistic rigor, emphasizes the aspects of the subject that are most important in cryptography. Chapters 4-6 and the Appendix contain material that for the most part has not previously appeared in textbook form. A novel feature is the inclusion of three types of cryptography - 'hidden monomial' systems, combinatorial-algebraic sys tems, and hyperelliptic systems - that are at an early stage of development. It is too soon to know which, if any, of these cryptosystems will ultimately be of practical use. But in the rapidly growing field of cryptography it is worthwhile to continually explore new one-way constructions coming from different areas of mathematics. Perhaps some of the readers will contribute to the research that still needs to be done. This book is designed not as a comprehensive reference work, but rather as a selective textbook. The many exercises (with answers at the back of the book) make it suitable for use in a math or computer science course or in a program of independent study. 220 pp. Englisch, Books<

1998, ISBN: 3540634460

[EAN: 9783540634461], Neubuch, [SC: 35.6], [PU: Springer Berlin Heidelberg], ALGEBRA; KRYPTOGRAFIE; VERSCHLüSSELUNG; DES; DIGITAL SIGNATURE ALGORITHM; ALGEBRAIC METHODS; ALGORITHMS; COMP… Mehr…

[EAN: 9783540634461], Neubuch, [SC: 35.6], [PU: Springer Berlin Heidelberg], ALGEBRA; KRYPTOGRAFIE; VERSCHLüSSELUNG; DES; DIGITAL SIGNATURE ALGORITHM; ALGEBRAIC METHODS; ALGORITHMS; COMPLEXITY; COMPUTATIONAL NUMBER THEORY; DATA SECURITY; ELLIPTIC AND HYPERELLIPTIC CURVES; FINITE FIELD; LINEAR COMBINATORICS, Druck auf Anfrage Neuware - Printed after ordering - This book is intended as a text for a course on cryptography with emphasis on algebraic methods. It is written so as to be accessible to graduate or advanced undergraduate students, as well as to scientists in other fields. The first three chapters form a self-contained introduction to basic concepts and techniques. Here my approach is intuitive and informal. For example, the treatment of computational complexity in Chapter 2, while lacking formalistic rigor, emphasizes the aspects of the subject that are most important in cryptography. Chapters 4-6 and the Appendix contain material that for the most part has not previously appeared in textbook form. A novel feature is the inclusion of three types of cryptography - 'hidden monomial' systems, combinatorial-algebraic sys tems, and hyperelliptic systems - that are at an early stage of development. It is too soon to know which, if any, of these cryptosystems will ultimately be of practical use. But in the rapidly growing field of cryptography it is worthwhile to continually explore new one-way constructions coming from different areas of mathematics. Perhaps some of the readers will contribute to the research that still needs to be done. This book is designed not as a comprehensive reference work, but rather as a selective textbook. The many exercises (with answers at the back of the book) make it suitable for use in a math or computer science course or in a program of independent study., Books<

1998, ISBN: 9783540634461

Gebundene Ausgabe

Contributor: Menezes, A.J. Contributor: Wu, Y.-H. Contributor: Zuccherato, R.J. Springer, Hardcover, Auflage: 1st ed. 1998. Corr. 3rd printing 2004, 215 Seiten, Publiziert: 1998-01-05T00:… Mehr…

Contributor: Menezes, A.J. Contributor: Wu, Y.-H. Contributor: Zuccherato, R.J. Springer, Hardcover, Auflage: 1st ed. 1998. Corr. 3rd printing 2004, 215 Seiten, Publiziert: 1998-01-05T00:00:01Z, Produktgruppe: Book, Hersteller-Nr.: 7 black & white illustrations, 7 black &, 1.08 kg, Verkaufsrang: 521968, Special Features, Books, Information Systems, Computer Science, Computing & Internet, Subjects, Amazon, Online Shopping, Digital Lifestyle, Networking & Security, Algorithms, Programming, Introduction to Programming, Reference, Combinatorics & Graph Theory, Mathematics, Science, Nature & Maths, Discrete Mathematics, Mathematical Theory, Popular Science, Applied Mathematics, Scientific, Technical & Medical, Books Global Store, 579c3025-5e5c-446b-80c9-b24e6fd5c94f_3601, 579c3025-5e5c-446b-80c9-b24e6fd5c94f_0, Special Features Stores, Arborist Merchandising Root, Springer, 1998<

1998, ISBN: 3540634460

1998 Gebundene Ausgabe Algebra, Kryptografie, Verschlüsselung, Kodierungstheorie und Verschlüsselung (Kryptologie), Diskrete Mathematik, Zahlentheorie, Algorithmen und Datenstrukturen, … Mehr…

1998 Gebundene Ausgabe Algebra, Kryptografie, Verschlüsselung, Kodierungstheorie und Verschlüsselung (Kryptologie), Diskrete Mathematik, Zahlentheorie, Algorithmen und Datenstrukturen, Kryptografie, Verschlüsselungstechnologie, Theoretische Informatik, Algebra; DES; Digital Signature Algorithm; Algebraic Methods; algorithms; complexity; Computational Number Theory; Data Security; elliptic and hyperelliptic curves; finite field; linear algebra; Number Theory; combinatorics, mit Schutzumschlag 11, [PU:Springer Berlin Heidelberg; Springer-Verlag GmbH]<