rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Number theoretic methods in cryptography
    sub title: complexity lower bounds
  name:
    name part: Shparlinski, Igor E.
    role:
      role term: creator
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  origin info:
    place:
      place term: sz
    date issued: 1999
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: preservation
    reformatting quality: access
    form: remote
    extent: 1 online resource (viii, 180 pages)
  abstract: The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research.
  note: Igor Shparlinski.
  note: Electronic resource.
  note: Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL
  note: digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL
  note: Includes bibliographical references (pages [165]-177) and index.
  subject:
    topic: Computational complexity
  subject:
    topic: Number theory
  subject:
    topic: Cryptography
  subject:
    topic: Complexité de calcul (Informatique)
  subject:
    topic: Nombres, Théorie des
  subject:
    topic: Cryptographie
  subject:
    topic: Computational complexity
  subject:
    topic: Cryptography
  subject:
    topic: Number theory
  subject:
    topic: Algebraische Zahlentheorie
    topic: Komplexität
    topic: Kryptosystem
  subject:
    topic: Komplexität
    topic: Algebraische Zahlentheorie
    topic: Kryptosystem
  subject:
    topic: Kryptosystem
    topic: Komplexität
    topic: Algebraische Zahlentheorie
  subject:
    topic: Boolesche Funktion
    topic: Komplexität
    topic: Kryptosystem
  subject:
    topic: Komplexität
    topic: Boolesche Funktion
    topic: Kryptosystem
  subject:
    topic: Kryptosystem
    topic: Komplexität
    topic: Boolesche Funktion
  subject:
    topic: Polynom
    topic: Faktorisierung
    topic: Komplexität
    topic: Kryptosystem
  subject:
    topic: Faktorisierung
    topic: Polynom
    topic: Komplexität
    topic: Kryptosystem
  subject:
    topic: Komplexität
    topic: Faktorisierung
    topic: Polynom
    topic: Kryptosystem
  subject:
    topic: Kryptosystem
    topic: Polynom
    topic: Faktorisierung
    topic: Komplexität
  subject:
    topic: Modularithmetik
    topic: Kryptosystem
  subject:
    topic: Kryptosystem
    topic: Modularithmetik
  classification: QA267.7 .S57 1999
  classification: 003/.54
  related item:
    title info:
      title: Number theoretic methods in cryptography
    name:
      name part: Shparlinski, Igor E.
    origin info:
      publisher: Basel ; Boston : Birkhäuser, ©1999
    identifier: (DLC) 99200367
    identifier: (OCoLC)41078609
  related item:
    title info:
      title: Progress in computer science and applied logic ; v. 17
  identifier: 9783034886642 (electronic bk.)
  identifier: 3034886640 (electronic bk.)
  identifier: 3764358882 (Basel)
  identifier: 9783764358884 (Basel)
  identifier: 0817658882 (Boston)
  identifier: 9780817658885 (Boston)
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: OCLCE
    record creation date: 110111
    record change date: 20260420215001.7
    record identifier: in00003512984
    language of cataloging:
      language term: eng