Number theory with applications to cryptography / edited by Stefano Spezia.

Includes bibliographical references and index.

A disaggregation approach for solving linear Diophantine equations -- Diophantine equations. Elementary methods II -- Almost and nearly isosceles Pythagorean triples -- A public key cryptosystem based on Diophantine equations of degree increasing type -- Hamiltonian for the zeros of the Riemann zeta function -- Fractional parts and their relations to the values of the Riemann zeta function -- 11-Dissection and modulo 11 congruences properties for partition generating function -- Effective congruences for mock theta functions -- On integer solutions of the cubic equations over certain fields -- Interative sliding window method for shorter number of operations in modular exponentiation and scalar multiplication -- Implementation of pollard rho over binary fields using brent cycle detection algorithm -- Cryptanalysis of a proposal based on the discrete logarithm problem inside S-- Research on attacking a special elliptic curve discrete logarithm problem -- Are matrices useful in public key cryptography -- An application of Fibonacci sequence on continued fractions -- On the quantitative metric theory of continued fractions in positive characteristic -- Some new continued fraction sequence convergent to Somos quadratic recurrence constant -- Continued fractions for some transcendental numbers.