Muutke küpsiste eelistusi

E-raamat: Codes, Cryptology and Curves with Computer Algebra

(Griffith University, Queensland), , (Technische Universiteit Eindhoven, The Netherlands), (Université de Neuchâtel, Switzerland)
  • Formaat: PDF+DRM
  • Ilmumisaeg: 02-Nov-2017
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781108547826
  • Formaat - PDF+DRM
  • Hind: 71,62 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: PDF+DRM
  • Ilmumisaeg: 02-Nov-2017
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781108547826

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This well-balanced text touches on theoretical and applied aspects of protecting digital data. The reader is provided with the basic theory and is then shown deeper fascinating detail, including the current state of the art. Readers will soon become familiar with methods of protecting digital data while it is transmitted, as well as while the data is being stored. Both basic and advanced error-correcting codes are introduced together with numerous results on their parameters and properties. The authors explain how to apply these codes to symmetric and public key cryptosystems and secret sharing. Interesting approaches based on polynomial systems solving are applied to cryptography and decoding codes. Computer algebra systems are also used to provide an understanding of how objects introduced in the book are constructed, and how their properties can be examined. This book is designed for Masters-level students studying mathematics, computer science, electrical engineering or physics.

Arvustused

'The book under review is intended as an introduction to the field for beginning graduate students. The authors do a good job of covering a wide range of topics and keeping the discussion detailed while still as elementary as one can hope to make it.' Darren Glass, MAA Reviews 'While 'coding' may commonly connote confidential communication and security for sensitive data, coding also enters the engineering of information transmission and retrieval, simply for efficient resilience against mechanical error and corrupting noise. From these two purposes rise the two distinct subjects of cryptology and error-correction, receiving here an unusual, unified treatment. Good codes spring from diverse directions, since so many branches of mathematics inform their development: combinatorics, linear algebra, finite fields, ring theory, algebraic geometry, and computer algebra. The girth of this volume reflects the reasonably detailed exposition of all this background material, most of it likely new to engineering students (but students of pure mathematics should also read this book for practical applications of seemingly abstract material they have likely studied). The authors maintain a high level of rigor, keeping all proofs short by astute organization without ever stinting on detail.' D. V. Feldman, Choice 'This book provides a fine exposition of the topics to those students who are novices to the field. At the same time it will also be of interest to readers who are already familiar with some of the concepts discussed in the book. It provides a valuable schematic summary and consolidated overview of the field.' S. V. Nagaraj, SIGACT News I was impressed by the scope of the book: many topics in algebraic coding theory are addressed and now collected in one book. Someone reading the entire book, will obtain a very good overview of algebraic coding theory. Peter Beelen, Nieuw Archief voor Weskunde

Muu info

Graduate-level introduction to error-correcting codes, which are used to protect digital data and applied in public key cryptosystems.
Preface xi
1 Error-correcting Codes
1(48)
Ruud Pellikaan
Xin-Wen Wu
1.1 Block Codes
2(9)
1.2 Linear Codes
11(7)
1.3 Parity Checks and Dual Code
18(9)
1.4 Decoding and the Error Probability
27(12)
1.5 Equivalent Codes
39(9)
1.6 Notes
48(1)
2 Code Constructions and Bounds on Codes
49(47)
Ruud Pellikaan
Xin-Wen Wu
2.1 Code Constructions
49(21)
2.2 Bounds on Codes
70(17)
2.3 Asymptotic Bounds
87(7)
2.4 Notes
94(2)
3 Weight Enumeration
96(45)
Relinde Jurrius
Ruud Pellikaan
Xin-Wen Wu
3.1 Weight Enumerator
96(13)
3.2 Extended Weight Enumerator
109(16)
3.3 Generalized Weight Enumerator
125(10)
3.4 Error Probability
135(4)
3.5 Notes
139(2)
4 Cyclic Codes
141(59)
Ruud Pellikaan
4.1 Cyclic Codes
141(14)
4.2 Finite Fields
155(14)
4.3 Defining Zeros
169(4)
4.4 Bounds on the Minimum Distance
173(7)
4.5 Improvements of the BCH Bound
180(5)
4.6 Locator Polynomials and Decoding Cyclic Codes
185(14)
4.7 Notes
199(1)
5 Polynomial Codes
200(43)
Ruud Pellikaan
5.1 RS Codes and their Generalizations
200(15)
5.2 Subfield Subcodes and Trace Codes
215(10)
5.3 Some Families of Polynomial Codes
225(8)
5.4 Reed-Muller Codes
233(8)
5.5 Notes
241(2)
6 Algebraic Decoding
243(34)
Ruud Pellikaan
Xin-Wen Wu
6.1 Decoding by Key Equation
243(10)
6.2 Error-correcting Pairs
253(6)
6.3 List Decoding by Sudan's Algorithm
259(16)
6.4 Notes
275(2)
7 Complexity and Decoding
277(26)
Stanislav Bulygin
Ruud Pellikaan
Xin-Wen Wu
7.1 Complexity
277(9)
7.2 Decoding Complexity
286(11)
7.3 Difficult Problems in Coding Theory
297(5)
7.4 Notes
302(1)
8 Codes and Related Structures
303(65)
Relinde Jurrius
Ruud Pellikaan
8.1 Graphs and Codes
304(5)
8.2 Matroids and Codes
309(10)
8.3 Finite Geometry and Codes
319(11)
8.4 Geometric Lattices and Codes
330(13)
8.5 Characteristic Polynomial
343(18)
8.6 Combinatorics and Codes
361(4)
8.7 Notes
365(3)
9 Cryptology
368(62)
Stanislav Bulygin
9.1 Symmetric Encryption Schemes and Block Ciphers
368(17)
9.2 Stream Ciphers and Linear Feedback Shift Registers
385(7)
9.3 Authentication, Orthogonal Arrays and Codes
392(10)
9.4 Secret Sharing
402(4)
9.5 Asymmetric Encryption Schemes
406(11)
9.6 Encryption Schemes from Error-correcting Codes
417(8)
9.7 Notes
425(5)
10 Grobner Bases for Coding and Cryptology
430(37)
Stanislav Bulygin
10.1 Polynomial System Solving
431(13)
10.2 Decoding Codes with Grobner Bases
444(12)
10.3 Algebraic Cryptanalysis
456(8)
10.4 Notes
464(3)
11 Codes on Curves
467(57)
Ruud Pellikaan
11.1 Algebraic Curves
467(25)
11.2 Codes from Algebraic Curves
492(11)
11.3 Order Functions
503(10)
11.4 Evaluation Codes
513(9)
11.5 Notes
522(2)
12 Coding and Cryptology with Computer Algebra
524(41)
Stanislav Bulygin
12.1 Singular
524(3)
12.2 Magma
527(3)
12.3 GAP
530(1)
12.4 Sage
531(1)
12.5 Error-correcting Codes with Computer Algebra
532(21)
12.6 Cryptography with Computer Algebra
553(6)
12.7 Grobner Bases with Computer Algebra
559(6)
References 565(21)
Index 586
Ruud Pellikaan has tenure at the Technische Universiteit Eindhoven, The Netherlands where his research has shifted from a devotion to coding theory, particularly algebraic geometry codes and their decoding, to code-based cryptography. He previously served as an associate editor of the IEEE Transactions of Information Theory and has organised several conferences. Xin-Wen Wu is a Senior Lecturer at the School of Information and Communication Technology, Griffith University, Queensland. His research interests include coding theory and information theory, cyber and data security, applied cryptography communications and networks. He has published extensively in these areas and is a senior member of Institute of Electrical and Electronics Engineers (IEEE). Stanislav Bulygin works as a technology specialist and product manager in the field of IT security and banking services. He previously worked as a researcher focusing on cryptology and IT security at the Technical University of Darmstadt, Germany. His main research activities were connected to the theory of error-correcting codes and their use in cryptography, quantum resistant cryptosystems and algebraic methods in cryptology. Relinde Jurrius is an Assistant Professor at the Université de Neuchatel, Switzerland. Her research interests are in coding theory, network coding and its connection with other branches of mathematics such as matroid theory, algebraic and finite geometry, and combinatorics. Apart from research and teaching, she is active in organising outreach activities, including a math camp for high school students, a public open day for the Faculty of Science and extra-curricular activities for elementary school children.