Discrete algebraic methods : arithmetic, cryptography, automata, and groups / / Volker Diekert [and three others]
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Autore: |
Diekert Volker <1955->
|
| Titolo: |
Discrete algebraic methods : arithmetic, cryptography, automata, and groups / / Volker Diekert [and three others]
|
| Pubblicazione: | Berlin, Germany ; ; Boston, Massachusetts : , : De Gruyter, , 2016 |
| ©2016 | |
| Descrizione fisica: | 1 online resource (354 pages) : illustrations |
| Disciplina: | 511.3/3 |
| Soggetto topico: | Ordered algebraic structures |
| Algorithms | |
| Computer science - Mathematics | |
| Cryptography | |
| Algebra | |
| Soggetto genere / forma: | Electronic books. |
| Persona (resp. second.): | DiekertVolker |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | Frontmatter -- Preface -- Contents -- 1. Algebraic structures -- 2. Cryptography -- 3. Number theoretic algorithms -- 4. Polynomial time primality test -- 5. Elliptic curves -- 6. Combinatorics on words -- 7. Automata -- 8. Discrete infinite groups -- Solutions to exercises -- Bibliography -- Index |
| Sommario/riassunto: | The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts with a general chapter on algebraic structures; this part provides all the necessary knowledge for the rest of the book. The next chapter gives a concise overview of cryptography. Chapter 3 on number theoretic algorithms is important for developping cryptosystems, Chapter 4 presents the deterministic primality test of Agrawal, Kayal, and Saxena. The account to elliptic curves again focuses on cryptographic applications and algorithms. With combinatorics on words and automata theory, the reader is introduced to two areas of theoretical computer science where semigroups play a fundamental role.The last chapter is devoted to combinatorial group theory and its connections to automata. Contents:Algebraic structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups |
| Titolo autorizzato: | Discrete algebraic methods |
| ISBN: | 3-11-041333-7 |
| 3-11-041632-8 | |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910465807703321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |