Integer algorithms in cryptology and information assurance / Boris S. Verkhovsky.
By: Verkhovsky, Boris S.
Material type: TextPublisher: New Jersey : World Scientific, 2014Description: xlii, 415 p. : illustrations ; 24 cm.ISBN: 9789814623742 (hardback : alk. paper).Subject(s): Information technology  Mathematics  Cryptography  Mathematics  Data integrityDDC classification: 652.8015181Item type  Current location  Call number  Status  Date due  Barcode  Item holds  

Books 
ISI Library, Kolkata

652.8015181 V519 (Browse shelf)  Available  136060 
Includes bibliographical references.
0. Introductory Notes on Security and Reliability;
1. Enhanced Algorithm for Modular Multiplicative Inverse;
2. Multiplication of LargeIntegers Based on Homogeneous Polynomials;
3. Deterministic Algorithms for Primitive Roots and Cyclic Groups with Mutual Generators;
4. Primality Testing via Complex Integers and Pythagorean Triplets;
5. Algorithm Generating Random Permutation;
6. Extractability of Square Roots and Divisibility Tests;
7. Extraction of roots of higher order in modular arithmetic;
8. Prblickey cryptography based on square roots and complex modulus;
9. Cubic roots of complex integers and encryption with digital isotopes;
10. Exponentiationfree accelerated encryption/decryption protocol;
11. Cryptocol based on threedimensional elliptic surface;
12.Multiparametric cryptography for rapid transmission of information;
13. Scheme for digital signature that always works;
14. Hybrid cryptography protocols providing digital signature;
15. Control protocols providing information assurance;
16. Information assurance based on cubic roots of integers;
17. Simultaneous information assurance and encryption based on quintic roots;
18. Modular equations and integer factorization;
19. Counting points on hyperelliptic curves and integer factorization;
20. Integer factorization via constrained discrete logarithm problem;
21. Decomposability of discrete logarithm problems;
22. Detecting intervals and order of point on elliptic curve;
23. Generalization of Gauss theorem and computation of complex primes;
24. Space complexity of algorithm for modular multiplicative inverse;
25. New algorithm can be computed;
26. Search for period of odd function;
27. Optimized search for maximum of function on large intervals;
28. Topological design of satellite communication networks;
References.
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.
There are no comments for this item.