Helmut Knebl - Böcker
Visar alla böcker från författaren Helmut Knebl. Handla med fri frakt och snabb leverans.
6 produkter
6 produkter
Algorithms and Data Structures
Foundations and Probabilistic Methods for Design and Analysis
Inbunden, Engelska, 2020
824 kr
Skickas inom 10-15 vardagar
To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm.
Algorithms and Data Structures
Foundations and Probabilistic Methods for Design and Analysis
Häftad, Engelska, 2021
606 kr
Skickas inom 10-15 vardagar
To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm.
641 kr
Skickas inom 10-15 vardagar
Due to the rapid growth of digital communication and electronic data exchange, information security has become a crucial issue in industry, business, and administration. Modern cryptography provides essential techniques for securing information and protecting data. In the first part, this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises.The second edition contains corrections, revisions and new material, including a complete description of the AES, an extended section on cryptographic hash functions, a new section on random oracle proofs, and a new section on public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks.
Algorithmen und Datenstrukturen
Grundlagen und probabilistische Methoden für den Entwurf und die Analyse
Häftad, Tyska, 2021
567 kr
Skickas inom 10-15 vardagar
Lernen Sie in diesem Buch mehr über Algorithmen und DatenstrukturenIn diesem Lehrbuch werden Algorithmen und Datenstrukturen exakt aber auch anschaulich und nachvollziehbar vermittelt, denn Algorithmen sind heute allgegenwärtig und vielfältig. Sie sind Gegenstand intensiver Forschung und zählen zu den fundamentalen Konzepten der Informatik. Dieses Buch über Algorithmen und Datenstrukturen ist aus Vorlesungen für Studierende der Informatik sowie der Medien- und Wirtschaftsinformatik an der Technischen Hochschule Nürnberg entstanden. Die grundlegenden Themen werden in den Bachelorkursen behandelt. Fortgeschrittene Teile, wie zum Beispiel die probabilistischen Algorithmen, stammen dagegen aus Masterkursen.Der Inhalt des Werks im ÜberblickIm ersten Kapitel seines Buchs über Algorithmen und Datenstrukturen führt Knebl relevante Grundlagen und Designprinzipien für Algorithmen ein.Die anschließenden Kapitel2 – 6 sind nach Problembereichen organisiert: Sortieren und Suchen (2), Hashverfahren (3), Bäume zur Speicherung von Daten und zur Datenkomprimierung (4), fundamentale Graphenalgorithmen, wie Tiefen- und Breitensuche und Anwendungen davon (5), die Berechnung von minimalen aufspannenden Bäumen und von kürzesten Wegen in gewichteten Graphen als auch die Lösung des Flussproblems in Netzwerken (6).Probabilistische Methoden sind grundlegend für einfache sowie effiziente Algorithmen und Datenstrukturen. Deshalb wird in jedem Kapitel dieses Buchs mindestens ein Problem mit einem probabilistischen Algorithmus gelöst. Die notwendigen mathematischen Grundlagen werden im ersten Kapitel sowie im Anhang entwickelt. Lösungen zu den zahlreichen Übungsaufgaben stehen Ihnen bequem zum Download bereit.
747 kr
Skickas inom 10-15 vardagar
In the second edition the authors added a complete description of the AES, an extended section on cryptographic hash functions, and new sections on random oracle proofs and public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks.
536 kr
Skickas inom 10-15 vardagar
The first part of this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises. In the second edition the authors added a complete description of the AES, an extended section on cryptographic hash functions, and new sections on random oracle proofs and public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks. The third edition is a further substantive extension, with new topics added, including: elliptic curve cryptography; Paillier encryption; quantum cryptography; the new SHA-3 standard for cryptographic hash functions; a considerably extended section on electronic elections and Internet voting; mix nets; and zero-knowledge proofs of shuffles.The book is appropriate for undergraduate and graduate students in computer science, mathematics, and engineering.