Modern Cryptography Volume 1 : : A Classical Introduction to Informational and Mathematical Principle.
Saved in:
Superior document: | Financial Mathematics and Fintech Series |
---|---|
: | |
Place / Publishing House: | Singapore : : Springer,, 2022. Ã2022. |
Year of Publication: | 2022 |
Edition: | 1st ed. |
Language: | English |
Series: | Financial Mathematics and Fintech Series
|
Online Access: | |
Physical Description: | 1 online resource (364 pages) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
5006954145 |
---|---|
ctrlnum |
(MiAaPQ)5006954145 (Au-PeEL)EBL6954145 (OCoLC)1311487086 |
collection |
bib_alma |
record_format |
marc |
spelling |
Zheng, Zhiyong. Modern Cryptography Volume 1 : A Classical Introduction to Informational and Mathematical Principle. 1st ed. Singapore : Springer, 2022. Ã2022. 1 online resource (364 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Financial Mathematics and Fintech Series 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. 7.9 Ajtai/Dwork Cryptosystem -- References -- Appendix References. Description based on publisher supplied metadata and other sources. Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. Electronic books. Print version: Zheng, Zhiyong Modern Cryptography Volume 1 Singapore : Springer,c2022 9789811909191 ProQuest (Firm) https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6954145 Click to View |
language |
English |
format |
eBook |
author |
Zheng, Zhiyong. |
spellingShingle |
Zheng, Zhiyong. Modern Cryptography Volume 1 : A Classical Introduction to Informational and Mathematical Principle. Financial Mathematics and Fintech Series 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. 7.9 Ajtai/Dwork Cryptosystem -- References -- Appendix References. |
author_facet |
Zheng, Zhiyong. |
author_variant |
z z zz |
author_sort |
Zheng, Zhiyong. |
title |
Modern Cryptography Volume 1 : A Classical Introduction to Informational and Mathematical Principle. |
title_sub |
A Classical Introduction to Informational and Mathematical Principle. |
title_full |
Modern Cryptography Volume 1 : A Classical Introduction to Informational and Mathematical Principle. |
title_fullStr |
Modern Cryptography Volume 1 : A Classical Introduction to Informational and Mathematical Principle. |
title_full_unstemmed |
Modern Cryptography Volume 1 : A Classical Introduction to Informational and Mathematical Principle. |
title_auth |
Modern Cryptography Volume 1 : A Classical Introduction to Informational and Mathematical Principle. |
title_new |
Modern Cryptography Volume 1 : |
title_sort |
modern cryptography volume 1 : a classical introduction to informational and mathematical principle. |
series |
Financial Mathematics and Fintech Series |
series2 |
Financial Mathematics and Fintech Series |
publisher |
Springer, |
publishDate |
2022 |
physical |
1 online resource (364 pages) |
edition |
1st ed. |
contents |
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. 7.9 Ajtai/Dwork Cryptosystem -- References -- Appendix References. |
isbn |
9789811909207 9789811909191 |
callnumber-first |
H - Social Science |
callnumber-subject |
HG - Finance |
callnumber-label |
HG176 |
callnumber-sort |
HG 3176.7 |
genre |
Electronic books. |
genre_facet |
Electronic books. |
url |
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6954145 |
illustrated |
Not Illustrated |
oclc_num |
1311487086 |
work_keys_str_mv |
AT zhengzhiyong moderncryptographyvolume1aclassicalintroductiontoinformationalandmathematicalprinciple |
status_str |
n |
ids_txt_mv |
(MiAaPQ)5006954145 (Au-PeEL)EBL6954145 (OCoLC)1311487086 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Financial Mathematics and Fintech Series |
is_hierarchy_title |
Modern Cryptography Volume 1 : A Classical Introduction to Informational and Mathematical Principle. |
container_title |
Financial Mathematics and Fintech Series |
marc_error |
Info : Unimarc and ISO-8859-1 translations identical, choosing ISO-8859-1. --- [ 856 : z ] |
_version_ |
1792331062528966656 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03542nam a22004093i 4500</leader><controlfield tag="001">5006954145</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20240229073846.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cnu||||||||</controlfield><controlfield tag="008">240229s2022 xx o ||||0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789811909207</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789811909191</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)5006954145</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL6954145</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1311487086</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">HG176.7</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zheng, Zhiyong.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modern Cryptography Volume 1 :</subfield><subfield code="b">A Classical Introduction to Informational and Mathematical Principle.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore :</subfield><subfield code="b">Springer,</subfield><subfield code="c">2022.</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">Ã2022.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (364 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Financial Mathematics and Fintech Series</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">7.9 Ajtai/Dwork Cryptosystem -- References -- Appendix References.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources.</subfield></datafield><datafield tag="590" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. </subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Zheng, Zhiyong</subfield><subfield code="t">Modern Cryptography Volume 1</subfield><subfield code="d">Singapore : Springer,c2022</subfield><subfield code="z">9789811909191</subfield></datafield><datafield tag="797" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Financial Mathematics and Fintech Series</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6954145</subfield><subfield code="z">Click to View</subfield></datafield></record></collection> |