All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $52.98Trending at AU $79.19
- AU $69.30Trending at AU $126.99
- AU $6.90Trending at AU $10.45
- AU $26.88Trending at AU $29.54
- AU $16.99Trending at AU $22.31
- AU $36.48Trending at AU $41.48
- AU $40.00Trending at AU $40.72
About this product
- DescriptionCovering classical cryptography, modern cryptography, and stegagraphy, this volume details how data can be kept secure and private. Each topic is presented and explained by describing various methods, techniques, and algorithms. Moreover, there are numerous helpful examples to reinforce the reader's understanding and expertise with these techniques and methodologies. Features & Benefits: * Incorporates both data encryption and data hiding * Supplies a wealth of exercises and solutions to help readers readily understand the material * Presents information in an accessible, nmathematical style * Concentrates on specific methodologies that readers can choose from and pursue, for their data-security needs and goals * Describes new topics, such as the advanced encryption standard (Rijndael), quantum cryptography, and elliptic-curve cryptography. The book, with its accessible style, is an essential companion for all security practitioners and professionals who need to understand and effectively use both information hiding and encryption to protect digital data and communications. It is also suitable for self-study in the areas of programming, software engineering, and security.
- Author(s)David Salomon
- PublisherSpringer-Verlag New York Inc.
- Date of Publication14/12/2011
- SubjectComputing: Professional & Programming
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Noteblack & white illustrations
- Weight905 g
- Width178 mm
- Height254 mm
- Spine24 mm
- Format DetailsTrade paperback (US)
- Edition StatementSoftcover reprint of the original 1st ed. 2003
This item doesn't belong on this page.
Thanks, we'll look into this.