<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Number theory with applications to cryptography</title>
  </titleInfo>
  <name type="personal">
    <namePart>Spezia, Stefano</namePart>
    <role>
      <roleTerm type="text">editor. </roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">onc</placeTerm>
    </place>
    <dateIssued encoding="marc">2020</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xxii, 285 pages ; 24 cm. </extent>
  </physicalDescription>
  <tableOfContents>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.  </tableOfContents>
  <note type="statement of responsibility">edited by Stefano Spezia. </note>
  <note>Includes bibliographical references and index. </note>
  <subject>
    <topic>Number theory</topic>
  </subject>
  <subject>
    <topic>Cryptography</topic>
    <topic>Mathematics</topic>
  </subject>
  <classification authority="lcc">QA268</classification>
  <classification authority="ddc">518 N917</classification>
  <identifier type="isbn">9781774073513</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">CSPC</recordContentSource>
    <recordCreationDate encoding="marc">231016</recordCreationDate>
    <recordChangeDate encoding="iso8601">20240524104815.0</recordChangeDate>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
