Mon compte
Ma liste - 0
Catalogue
Ressources numériques
Nouveautés
Liens utiles
Mon compte
Recherche rapide
Recherche avancée
Recherche alphabétique
Historique
Information
Recherche
Auteur
Titre
Sujet
Titre de revue
Collection
Cotes BU
Cotes ENSEA
Cotes IUFM
Modifier la recherche
>
CERGY
Elargir la recherche
Sur le même sujet :
Data structures (Computer science)
Computer science -- Mathematics.
Discrete mathematics
System safety
Computer science
Data structures (Computer scienc.
Parcourir le catalogue
par auteur:
Smart , Nigel P.
Rechercher sur Internet
Localiser dans une autre bibliothèque (SUDOC) (PPN ou ISBN ou ISSN)
Aperçu dans Google Books
Affichage MARC
Auteur :
Smart , Nigel P.
Titre :
Cryptography Made Simple , by Nigel P. Smart.
Edition :
1st ed. 2015.
Editeur :
Cham : Springer International Publishing : Imprint: Springer , 2016
Collection :
Information Security and Cryptography , 2197-845X
ISBN:
978-3-319-21936-3
Notes :
L'accès complet à la ressource est réservé aux usagers des établissements qui en ont fait l'acquisition
In this introductory textbook the author explains the key topics in cryptography. He takes a modern approach, where defining what is meant by "secure" is as important as creating something that achieves that goal, and security definitions are central to the discussion throughout. The chapters in Part 1 offer a brief introduction to the mathematical foundations: modular arithmetic, groups, finite fields, and probability; primality testing and factoring; discrete logarithms; elliptic curves; and lattices. Part 2 of the book shows how historical ciphers were broken, thus motivating the design of modern cryptosystems since the 1960s; this part also includes a chapter on information-theoretic security. Part 3 covers the core aspects of modern cryptography: the definition of security; modern stream ciphers; block ciphers and modes of operation; hash functions, message authentication codes, and key derivation functions; the "naive" RSA algorithm; public key encryption and signature algorithms; cryptography based on computational complexity; and certificates, key transport and key agreement. Finally, Part 4 addresses advanced prot ocols, where the parties may have different or even conflicting security goals: secret sharing schemes; commitments and oblivious transfer; zero-knowledge proofs; and secure multi-party computation. The author balances a largely non-rigorous style — many proofs are sketched only — with appropriate formality and depth. For example, he uses the terminology of groups and finite fields so that the reader can understand both the latest academic research and "real-world" documents such as application programming interface descriptions and cryptographic standards. The text employs colour to distinguish between public and private information, and all chapters include summaries and suggestions for further reading. This is a suitable textbook for advanced undergraduate and graduate students in computer science, mathematics and engineering, and for self-study by professionals in information security. While the appendix summarizes most of the basic algebra and notation required, it is assumed that the reader has a basic knowledge of discrete mathematics, probability, and elementary calculus
Nécessite un lecteur de fichier PDF
Contient :
Modular Arithmetic, Groups, Finite Fields and Probability ; Elliptic Curves ; Historical Ciphers ; The Enigma Machine ; Information Theoretic Security ; Historical Stream Ciphers ; Modern Stream Ciphers ; Block Ciphers ; Symmetric Key Distribution ; Hash Functions and Message Authentication Codes ; Basic Public Key Encryption Algorithms ; Primality Testing and Factoring ; Discrete Logarithms ; Key Exchange and Signature Schemes ; Implementation Issues ; Obtaining Authentic Public Keys ; Attacks on Public Key Schemes ; Definitions of Security ; Complexity Theoretic Approaches ; Provable Security: With Random Oracles ; Hybrid Encryption ; Provable Security: Without Random Oracles ; Secret Sharing Schemes ; Commitments and Oblivious Transfer ; Zero-Knowledge Proofs ; Secure Multiparty Computation
Sujet :
Data structures (Computer science)
Computer science -- Mathematics.
Discrete mathematics
System safety
Computer science
Data structures (Computer scienc.
Exemplaires
Pas de données exemplaires
Pour toute question,
contactez la bibliothèque
Horizon Information Portal 3.0© 2001-2019
SirsiDynix
Tous droits réservés.