Muutke küpsiste eelistusi

E-raamat: Chinese Remainder Theorem: Applications In Computing, Coding, Cryptography

(Chinese Academy Of Sciences, China), (Turku Centre For Computer Science, Finland), (Hong Kong Univ Of Sci & Tech, Hong Kong)
  • Formaat: 224 pages
  • Ilmumisaeg: 25-Oct-1996
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • Keel: eng
  • ISBN-13: 9789814498364
  • Formaat - PDF+DRM
  • Hind: 38,61 €*
  • * 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.
  • Raamatukogudele
  • Formaat: 224 pages
  • Ilmumisaeg: 25-Oct-1996
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • Keel: eng
  • ISBN-13: 9789814498364

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. 

Chinese Remainder Theorem, CRT, is one of the jewels of mathematics. It is a perfect combination of beauty and utility or, in the words of Horace, omne tulit punctum qui miscuit utile dulci. Known already for ages, CRT continues to present itself in new contexts and open vistas for new types of applications. So far, its usefulness has been obvious within the realm of three C's. Computing was its original field of application, and continues to be important as regards various aspects of algorithmics and modular computations. Theory of codes and cryptography are two more recent fields of application.This book tells about CRT, its background and philosophy, history, generalizations and, most importantly, its applications. The book is self-contained. This means that no factual knowledge is assumed on the part of the reader. We even provide brief tutorials on relevant subjects, algebra and information theory. However, some mathematical maturity is surely a prerequisite, as our presentation is at an advanced undergraduate or beginning graduate level. We have tried to make the exposition innovative, many of the individual results being new. We will return to this matter, as well as to the interdependence of the various parts of the book, at the end of the Introduction.A special course about CRT can be based on the book. The individual chapters are largely independent and, consequently, the book can be used as supplementary material for courses in algorithmics, coding theory, cryptography or theory of computing. Of course, the book is also a reference for matters dealing with CRT.
Preface v
Introduction and Philosophy
1(12)
A Historical Overview
1(2)
Pars pro toto
3(2)
Chinese Remainder Theorem: A First Formulation
5(3)
CRT in the Hands of Old Mathematicians
8(2)
CRT in Applications: the Three C's
10(3)
Chinese Remainder Algorithm
13(20)
Historical Development
13(9)
Chinese Remainder Algorithms
22(2)
Chinese Remainder Theorem
24(1)
A Generalized CRA
25(4)
Another Generalized CRT
29(4)
In Modular Computations
33(32)
Modular Computation Based on CRA
33(5)
A Modular Approach to Multiplication
38(9)
Computing Exact Polynomial Resultants
47(11)
Other Applications in Symbolic Computations
58(1)
CRA and Homomorphic Image Computing
59(3)
Information and CRT
62(3)
In Algorithmics
65(30)
Divide-and-Conquer Techniques
66(2)
Polynomial Interpolation over Fields
68(3)
Polynomial Interpolation over Z/(m)
71(3)
Shift-Register Synthesis over Z/(m)
74(6)
Common Primitive Roots
80(2)
From One- to Multi-dimension
82(3)
A Modular Algorithm for Cyclic Convolution
85(2)
A Fast Algorithm for Cyclic Convolution
87(3)
Fast Fourier Transform and CRT
90(5)
In Bridging Computations
95(18)
A Main Bridge
95(2)
Solving Equations over Z/(m)
97(2)
Number of Roots of Equations over Z/(m)
99(2)
Computing Fixed Points
101(4)
Bridging Divisions of Polynomials
105(1)
Permutation Polynomials of Z/(m)
106(7)
In Coding Theory
113(44)
Basics of Block Codes
114(6)
Redundant Residue Codes
120(2)
Reed-Solomon Codes
122(6)
Redundant Residue Codes of Degree 2
128(3)
Bossen-Yau Codes
131(10)
Generalized Redundant Residue Codes
141(5)
Restricted GRR Codes
146(1)
A Class of Arithmetic Residue Codes
147(10)
In Cryptography
157(28)
Secret Sharing and CRT
157(8)
Secret Sharing and Codes
165(6)
CRT and Stream Ciphering
171(4)
CRA and Knapsack Problems
175(4)
Public-Key Systems via CRT
179(6)
A Tutorial in Information Theory 185(8)
B Tutorial in Algebra 193(8)
C List of Mathematical Symbols 201(2)
Bibliography 203(8)
Index 211