Number theory with applications to cryptography / 
edited by Stefano Spezia. 
 - Oakville, Ontario :  Arcler Press,  c2020. 
 - xxi, 309 pages :  color illustrations 
<br/><br/>To access the E-Book : https://www.bibliotex.com/ (Log-in/Register is required). 
<br/><br/>Includes bibliography references and index. 
<br/><br/>Chapter 1 : A Disaggregation Approach for Solving Linear Diophantine Equations<br/>Chapter 2 : Diophantine Equations, Elementary Methods<br/>Chapter 3 : Diophantine Equations, Elementary Methods II<br/>Chapter 4 : Almost and Nearly Isosceles Pythagorean Triples<br/>Chapter 5  : A Public Key Cryptosystem based  on DIophantine Equations of Degree Increasing Type<br/>Chapter 6 : Hamiltonian for the Zeros of the Riemann Zeta Function<br/>Chapter 7 : Fractional Parts and their Relations to the Values of the Riemann Zeta Function<br/>Chapter 8 : 11-Dissection and Modulo 11 Congruences Properties for Partition Generating Function<br/>Chapter 9 : Effective Congruences for Mock Theta Functions<br/>Chapter 10 : On Integer Solutions of the Cubic Equations Over Certain Fields<br/>Chapter 11 : Iterative Sliding Window Method for Shorter Number of Operations in Modular Exponentiation and Scalar<br/>Chapter 12 : Implementation of Pollard Rho overbinary fields using Brent Cycle Detection Algorithm<br/>Chapter 13 : Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside S<br/>Chapter 14 : Research on Attacking a Special Elliptic Curve Discrete Logarithm Problem<br/>Chapter 15 : Are matrices Useful in Public-Key Cryptography?<br/>Chapter 16 : An application of Fibonacci Sequence on Continued Fractions<br/>Chapter 17 : On the QuantitativeMetric Theory of Continued Fractions in Positive Characteristic<br/>Chapter 18 : Some New Continued Fraction Sequence Convergent to the Somos Quadratfic Reccurance Constant<br/> 
<br/><br/> Number Theory with Applications to Cryptography takes into account the application of number theory in the field of cryptography. It comprises elementary methods of Diophantine equations, the basic theorem of arithmetic and the Riemann Zeta function. This book also discusses about Congruences and their use in mock theta functions, Method of Iterative Sliding Window for Shorter Number of Operations in case of Modular Exponentiation and Scalar Multiplication, Discrete log problem, elliptic curves, matrices and public-key cryptography and Implementation of Pollard Rho over binary fields using Brent Cycle Detection Algorithm. It also provides the reader with the significant insights of number theory to the practice of cryptography in order to understand discrete log problem, matrices, elliptic curves and public-key cryptography and the applications of Fibonacci sequence on continued fractions.EBOP0000015 
<br/><br/><br/>In English text. 
<br/><br/><label>ISBN: </label>
<br/><br/><label>Subjects--Topical Terms: </label><br/>Number theory.<br/>Cryptography.<br/>Coinage, International.<br/>Cryptocurrencies.
<br/><br/><label>LC Class. No.: </label>EBOP QA 241  / N86 2020