|
|
|
|
| LEADER |
03546nam a22004093i 4500 |
| 001 |
EBC6954145 |
| 003 |
MiAaPQ |
| 005 |
20231204023222.0 |
| 006 |
m o d | |
| 007 |
cr cnu|||||||| |
| 008 |
231204s2022 xx o ||||0 eng d |
| 020 |
|
|
|a 9789811909207
|q (electronic bk.)
|
| 020 |
|
|
|z 9789811909191
|
| 035 |
|
|
|a (MiAaPQ)EBC6954145
|
| 035 |
|
|
|a (Au-PeEL)EBL6954145
|
| 035 |
|
|
|a (OCoLC)1311487086
|
| 040 |
|
|
|a MiAaPQ
|b eng
|e rda
|e pn
|c MiAaPQ
|d MiAaPQ
|
| 050 |
|
4 |
|a HG176.7
|
| 100 |
1 |
|
|a Zheng, Zhiyong.
|
| 245 |
1 |
0 |
|a Modern Cryptography Volume 1 :
|b A Classical Introduction to Informational and Mathematical Principle.
|
| 250 |
|
|
|a 1st ed.
|
| 264 |
|
1 |
|a Singapore :
|b Springer,
|c 2022.
|
| 264 |
|
4 |
|c Ã2022.
|
| 300 |
|
|
|a 1 online resource (364 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Financial Mathematics and Fintech Series
|
| 505 |
0 |
|
|a Intro -- Preface -- Contents -- Acronyms -- 1 Preparatory Knowledge -- 1.1 Injective -- 1.2 Computational Complexity -- 1.3 Jensen Inequality -- 1.4 Stirling Formula -- 1.5 n-fold Bernoulli Experiment -- 1.6 Chebyshev Inequality -- 1.7 Stochastic Process -- References -- 2 The Basis of Code Theory -- 2.1 Hamming Distance -- 2.2 Linear Code -- 2.3 Lee Distance -- 2.4 Some Typical Codes -- 2.4.1 Hadamard Codes -- 2.4.2 Binary Golay Codes -- 2.4.3 3-Ary Golay Code -- 2.4.4 Reed-Muller Codes -- 2.5 Shannon Theorem -- References -- 3 Shannon Theory -- 3.1 Information Space -- 3.2 Joint Entropy, Conditional Entropy, Mutual Information -- 3.3 Redundancy -- 3.4 Markov Chain -- 3.5 Source Coding Theorem -- 3.6 Optimal Code Theory -- 3.7 Several Examples of Compression Coding -- 3.7.1 Morse Codes -- 3.7.2 Huffman Codes -- 3.7.3 Shannon-Fano Codes -- 3.8 Channel Coding Theorem -- References -- 4 Cryptosystem and Authentication System -- 4.1 Definition and Statistical Characteristics of Cryptosystem -- 4.2 Fully Confidential System -- 4.3 Ideal Security System -- 4.4 Message Authentication -- 4.5 Forgery Attack -- 4.6 Substitute Attack -- 4.7 Basic Algorithm -- 4.7.1 Affine Transformation -- 4.7.2 RSA -- 4.7.3 Discrete Logarithm -- 4.7.4 Knapsack Problem -- References -- 5 Prime Test -- 5.1 Fermat Test -- 5.2 Euler Test -- 5.3 Monte Carlo Method -- 5.4 Fermat Decomposition and Factor Basis Method -- 5.5 Continued Fraction Method -- References -- 6 Elliptic Curve -- 6.1 Basic Theory -- 6.2 Elliptic Curve Public Key Cryptosystem -- 6.3 Elliptic Curve Factorization -- References -- 7 Lattice-Based Cryptography -- 7.1 Geometry of Numbers -- 7.2 Basic Properties of Lattice -- 7.3 Integer Lattice and q-Ary Lattice -- 7.4 Reduced Basis -- 7.5 Approximation of SVP and CVP -- 7.6 GGH/HNF Cryptosystem -- 7.7 NTRU Cryptosystem -- 7.8 McEliece/Niederreiter Cryptosystem.
|
| 505 |
8 |
|
|a 7.9 Ajtai/Dwork Cryptosystem -- References -- Appendix References.
|
| 588 |
|
|
|a Description based on publisher supplied metadata and other sources.
|
| 590 |
|
|
|a Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2023. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
|
| 655 |
|
4 |
|a Electronic books.
|
| 776 |
0 |
8 |
|i Print version:
|a Zheng, Zhiyong
|t Modern Cryptography Volume 1
|d Singapore : Springer,c2022
|z 9789811909191
|
| 797 |
2 |
|
|a ProQuest (Firm)
|
| 830 |
|
0 |
|a Financial Mathematics and Fintech Series
|
| 856 |
4 |
0 |
|u https://ebookcentral.proquest.com/lib/matrademy/detail.action?docID=6954145
|z Click to View
|
