TEST - Catálogo BURRF
   

Complexity Theory and Cryptology : An Introduction to Cryptocomplexity / by Jörg Rothe.

Por: Colaborador(es): Tipo de material: TextoTextoSeries Texts in Theoretical Computer Science An EATCS Series, On behalf of the European Association for Theoretical Computer Science (EATCS)Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005Descripción: xI, 478 páginas 63 ilustraciones recurso en líneaTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783540285205
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • QA75.5-76.95
Recursos en línea:
Contenidos:
to Cryptocomplexity -- Foundations of Computer Science and Mathematics -- Foundations of Complexity Theory -- Foundations of Cryptology -- Hierarchies Based on NP -- Randomized Algorithms and Complexity Classes -- RSA Cryptosystem, Primality, and Factoring -- Other Public-Key Cryptosystems and Protocols.
Resumen: Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas. This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

to Cryptocomplexity -- Foundations of Computer Science and Mathematics -- Foundations of Complexity Theory -- Foundations of Cryptology -- Hierarchies Based on NP -- Randomized Algorithms and Complexity Classes -- RSA Cryptosystem, Primality, and Factoring -- Other Public-Key Cryptosystems and Protocols.

Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas. This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha