Häftad, Engelska, 2013
Stream Ciphers
826 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Fler format och utgåvor
Beskrivning
Produktinformation
- Utgivningsdatum: 2013-04-20
- Mått: 155 x 235 x 23 mm
- Vikt: 634 g
- Format: Häftad
- Språk: Engelska
- Antal sidor: 399
- Upplaga: 2013
- Förlag: Springer London Ltd
- ISBN: 9781447150787
Utforska kategorier
Mer om författaren
The author's research includes: Discrete Mathematics/Combinatorics and its application. Finite Geometry (partial ovoids, spreads, etc.) Cryptography (e.g. Visual Cryptography) Complexity Theory (parallel automata) Coding Theory (geometric constructions, convolutional codes, etc.) Miscellaneous
Recensioner i media
From the book reviews: "This book focuses on the theory of stream ciphers and their applications. ... Seldom does one find a summary of the theory of stream ciphers as systematic as that in the book under review. ... the book covers completely the topic of attacks on stream ciphers ... . This is a remarkable book and it should be of interest to scholars and students in discrete mathematics, cryptography, coding theory, computer security and related fields." (Zhixiong Chen, Mathematical Reviews, March, 2014) "Starting with a historical overview, this book gives a very good and comprehensive introduction to the mathematics of stream ciphers. ... the book can serve as a valuable contribution to advanced undergraduate and graduate cryptography lectures in mathematics and computer science." (Wilfried Meidl, zbMATH, Vol. 1288, 2014) "Provide a coherent discussion of stream ciphers, how they are implemented, and how they can be attacked. ... The material is presented in a logical fashion. The writing is clear and the mathematics well presented ... . The book is intended for advanced undergraduate and graduate students of mathematics or computer science. ... it presents the reader with applications in a number of important theoretical areas of mathematics and computer science, including graph theory, complexity and performance analysis of algorithms, P versus NP, and more." (G. R. Mayforth, Computing Reviews, September, 2013)
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.