東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Data integrity." ]

切換: 標籤 | MARC模式 | ISBD

Integer algorithms in cryptology and...

Verkhovsky, Boris S.

FindBook

Google Book

Amazon

博客來

Integer algorithms in cryptology and information assurance

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Integer algorithms in cryptology and information assurance/ Boris S. Verkhovsky.
作者:	Verkhovsky, Boris S.
出版者:	[Hackensack] New Jersey :World Scientific, : 2014.,
面頁冊數:	1 online resource.
內容註:	About the Author; Preface; Acknowledgments; Contents; 0. Introductory Notes on Security and Reliability; 1. Background; 2. Basics of Modular Arithmetic; 3. Basic Properties in Modular Arithmetic; 4. Direct and Inverse Problems; 5. Complexity Enhancement; 1. Enhanced Algorithm for Modular Multiplicative Inverse; 1. Introduction: Division of Two Integers; 2. Basic Arrays and their Properties; 3. NEA for MMI; 4. Complexity Analysis of MMI Algorithm; 5. Extended-Euclid Algorithm (XEA); 6. Comparative Analysis of NEA vs. XEA; 7. Average Complexity of XEA and NEA.
內容註:	2. Multiplication of Large-Integers Based on Homogeneous Polynomials1. Introduction and Basic Definitions; 2. Multiplication C = AB based on Homogeneous Polynomials; 3. Separation of "Even" and "Odd" Coefficients in AHP; 3.1. Separation of unknowns: n=5; 3.2. AHP for multiplication of triple-large integers; 4. Reduction of Algebraic Additions; 5. Comparison of Evaluated Polynomials in TCA vs. AHP; 6. Comparison of TCA vs. AHP for n=6; 6.1. AHP framework; 6.2. Toom-Cook Algorithm; 7. AHP for n=7; 8. AHP for n=4 in Details; 9. Solution of System of Eqs. (8.6)-(8.10).
內容註:	10. Multistage Implementation of TCA and AHP10.1. Two-stage implementation (TSI); 10.2. Multi-stage implementation; 11. Number of Algebraic Additions; 12. Analysis of TCA vs. AHP; 13. Generalized Horner Rule for Homogeneous Polynomials; 14. Values of (p, q) Simplifying Computation of A(p, q) and B(p, q); 15. Optimized AHP; 16. Concluding Remark; 3. Deterministic Algorithms for Primitive Roots and Cyclic Groups with Mutual Generators; 1. Introduction and Basic Definitions; 2. Schematic Illustration of Cycles; 3. Verification Procedure: Is g a Generator?; 4. Safe Primes and their Properties.
內容註:	5. Computational Complexities6. Algorithm and its Validation; 7. Formula for Generator; 8. Multiplicative Groups with Common Generators; 9. Complex Generators and Super-safe Primes; 10. Concluding Remarks; Appendix; A.1. Proof of Theorem 6.2; A.2. Deterministic computation of generators: Proof of Theorem7.1; A.3. Search for smaller generators; 4. Primality Testing via Complex Integers and Pythagorean Triplets; 1. Introduction; 2. Basic Properties of Primes; 3. Generalizations; 4. Arithmetic Operations on Complex Integers; 4.1. Multiplications of complex numbers.
內容註:	4.2. Modular multiplicative inverse of complex integer4.3. Complex primes; 5. Fundamental Identity; 6. Major Results; 7. Carmichael Numbers; 8. Primality Tests; 9. Primality Testing with Quaternions; 10. Computer Experiments; 5. Algorithm Generating Random Permutation; 1. Applications of Permutations; 2. Permutation Generation; 3. Counting the Permutations; 4. Counting the Inversions; 5. Inversions-Permutation Mapping; 6. The Algorithm; 7. Modified Algorithm for Large n; 8. Example 6.1 Revisited; 6. Extractability of Square Roots and Divisibility Tests; 1. Introduction.
標題:	Information technology - Mathematics. -
電子資源:	http://www.worldscientific.com/worldscibooks/10.1142/9325#t=toc
ISBN:	9789814623759

Integer algorithms in cryptology and information assurance
Verkhovsky, Boris S.

Integer algorithms in cryptology and information assurance[electronic resource] /Boris S. Verkhovsky. - [Hackensack] New Jersey :World Scientific,2014. - 1 online resource.

Includes bibliographical references.

About the Author; Preface; Acknowledgments; Contents; 0. Introductory Notes on Security and Reliability; 1. Background; 2. Basics of Modular Arithmetic; 3. Basic Properties in Modular Arithmetic; 4. Direct and Inverse Problems; 5. Complexity Enhancement; 1. Enhanced Algorithm for Modular Multiplicative Inverse; 1. Introduction: Division of Two Integers; 2. Basic Arrays and their Properties; 3. NEA for MMI; 4. Complexity Analysis of MMI Algorithm; 5. Extended-Euclid Algorithm (XEA); 6. Comparative Analysis of NEA vs. XEA; 7. Average Complexity of XEA and NEA.

Integer Algorithms in Cryptology and Information Assurance is a collection of the author''s own innovative approaches in algorithms and protocols for secret and reliable communication. It concentrates on the " what " and " how " behind implementing the proposed cryptographic algorithms rather than on formal proofs of "why" these algorithms work. The book consists of five parts (in 28 chapters) and describes the author''s research results in: -->: Innovative methods in cryptography (secret communication between initiated parties); Cryptanalysis (how to break the encryption algorithms based on c.

ISBN: 9789814623759Subjects--Topical Terms:

2142313
Information technology
--Mathematics.

LC Class. No.: T58.5 / .V47 2014eb

Dewey Class. No.: 652/.8015181

Integer algorithms in cryptology and information assurance
LDR:04503cmm a2200337Ka 4500 001 1999645
003 OCoLC
005 20151106100144.0
006 m o d
007 cr cnu---unuuu
008 151123s2014 nju ob 000 0 eng d
020 $a 9789814623759 $q (electronic bk.)
020 $a 981462375X $q (electronic bk.)
020 $z 9789814623742
020 $z 9814623741
035 $a (OCoLC)892910998 $z (OCoLC)893332831
035 $a ocn892910998
040 $a N $b eng $c N $d IDEBK $d CDX $d YDXCP $d OCLCQ $d EBLCP $d OCLCQ
050 4 $a T58.5 $b .V47 2014eb
082 0 4 $a 652/.8015181 $2 23
100 1 $a Verkhovsky, Boris S. $3 2142312
245 1 0 $a Integer algorithms in cryptology and information assurance $h [electronic resource] / $c Boris S. Verkhovsky.
260 $a [Hackensack] New Jersey : $b World Scientific, $c 2014.
300 $a 1 online resource.
504 $a Includes bibliographical references.
505 0 $a About the Author; Preface; Acknowledgments; Contents; 0. Introductory Notes on Security and Reliability; 1. Background; 2. Basics of Modular Arithmetic; 3. Basic Properties in Modular Arithmetic; 4. Direct and Inverse Problems; 5. Complexity Enhancement; 1. Enhanced Algorithm for Modular Multiplicative Inverse; 1. Introduction: Division of Two Integers; 2. Basic Arrays and their Properties; 3. NEA for MMI; 4. Complexity Analysis of MMI Algorithm; 5. Extended-Euclid Algorithm (XEA); 6. Comparative Analysis of NEA vs. XEA; 7. Average Complexity of XEA and NEA.
505 8 $a 2. Multiplication of Large-Integers Based on Homogeneous Polynomials1. Introduction and Basic Definitions; 2. Multiplication C = AB based on Homogeneous Polynomials; 3. Separation of "Even" and "Odd" Coefficients in AHP; 3.1. Separation of unknowns: n=5; 3.2. AHP for multiplication of triple-large integers; 4. Reduction of Algebraic Additions; 5. Comparison of Evaluated Polynomials in TCA vs. AHP; 6. Comparison of TCA vs. AHP for n=6; 6.1. AHP framework; 6.2. Toom-Cook Algorithm; 7. AHP for n=7; 8. AHP for n=4 in Details; 9. Solution of System of Eqs. (8.6)-(8.10).
505 8 $a 10. Multistage Implementation of TCA and AHP10.1. Two-stage implementation (TSI); 10.2. Multi-stage implementation; 11. Number of Algebraic Additions; 12. Analysis of TCA vs. AHP; 13. Generalized Horner Rule for Homogeneous Polynomials; 14. Values of (p, q) Simplifying Computation of A(p, q) and B(p, q); 15. Optimized AHP; 16. Concluding Remark; 3. Deterministic Algorithms for Primitive Roots and Cyclic Groups with Mutual Generators; 1. Introduction and Basic Definitions; 2. Schematic Illustration of Cycles; 3. Verification Procedure: Is g a Generator?; 4. Safe Primes and their Properties.
505 8 $a 5. Computational Complexities6. Algorithm and its Validation; 7. Formula for Generator; 8. Multiplicative Groups with Common Generators; 9. Complex Generators and Super-safe Primes; 10. Concluding Remarks; Appendix; A.1. Proof of Theorem 6.2; A.2. Deterministic computation of generators: Proof of Theorem7.1; A.3. Search for smaller generators; 4. Primality Testing via Complex Integers and Pythagorean Triplets; 1. Introduction; 2. Basic Properties of Primes; 3. Generalizations; 4. Arithmetic Operations on Complex Integers; 4.1. Multiplications of complex numbers.
505 8 $a 4.2. Modular multiplicative inverse of complex integer4.3. Complex primes; 5. Fundamental Identity; 6. Major Results; 7. Carmichael Numbers; 8. Primality Tests; 9. Primality Testing with Quaternions; 10. Computer Experiments; 5. Algorithm Generating Random Permutation; 1. Applications of Permutations; 2. Permutation Generation; 3. Counting the Permutations; 4. Counting the Inversions; 5. Inversions-Permutation Mapping; 6. The Algorithm; 7. Modified Algorithm for Large n; 8. Example 6.1 Revisited; 6. Extractability of Square Roots and Divisibility Tests; 1. Introduction.
520 $a Integer Algorithms in Cryptology and Information Assurance is a collection of the author''s own innovative approaches in algorithms and protocols for secret and reliable communication. It concentrates on the " what " and " how " behind implementing the proposed cryptographic algorithms rather than on formal proofs of "why" these algorithms work. The book consists of five parts (in 28 chapters) and describes the author''s research results in: -->: Innovative methods in cryptography (secret communication between initiated parties); Cryptanalysis (how to break the encryption algorithms based on c.
588 0 $a Print version record.
650 0 $a Information technology $x Mathematics. $3 2142313
650 0 $a Cryptography $x Mathematics. $3 550199
650 0 $a Data integrity. $3 2142314
650 0 $a Algorithms. $3 536374
650 0 $a Numbers, Natural. $3 752923
650 0 $a Number theory. $3 515832
856 4 0 $u http://www.worldscientific.com/worldscibooks/10.1142/9325#t=toc