LEADER 03477nam 2200733 450 001 9910798486803321 005 20220704035340.0 010 $a3-11-041333-7 010 $a3-11-041632-8 024 7 $a10.1515/9783110413335 035 $a(CKB)3710000000718425 035 $a(SSID)ssj0001677765 035 $a(PQKBManifestationID)16486985 035 $a(PQKBTitleCode)TC0001677765 035 $a(PQKBWorkID)14944418 035 $a(PQKB)11270564 035 $a(DE-B1597)448720 035 $a(OCoLC)951145267 035 $a(OCoLC)953920693 035 $a(DE-B1597)9783110413335 035 $a(Au-PeEL)EBL4533883 035 $a(CaPaEBR)ebr11214970 035 $a(CaONFJC)MIL927184 035 $a(OCoLC)951223219 035 $a(CaSebORM)9783110416329 035 $a(MiAaPQ)EBC4533883 035 $a(PPN)195103629 035 $a(EXLCZ)993710000000718425 100 $a20160609h20162016 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aDiscrete algebraic methods $earithmetic, cryptography, automata, and groups /$fVolker Diekert [and three others] 210 1$aBerlin, Germany ;$aBoston, Massachusetts :$cDe Gruyter,$d2016. 210 4$dİ2016 215 $a1 online resource (354 pages) $cillustrations 225 0 $aDe Gruyter Textbook 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-11-041332-9 320 $aIncludes bibliographical references and index. 327 $tFrontmatter --$tPreface --$tContents --$t1. Algebraic structures --$t2. Cryptography --$t3. Number theoretic algorithms --$t4. Polynomial time primality test --$t5. Elliptic curves --$t6. Combinatorics on words --$t7. Automata --$t8. Discrete infinite groups --$tSolutions to exercises --$tBibliography --$tIndex 330 $aThe 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 developing 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. 606 $aOrdered algebraic structures$vTextbooks 606 $aAlgorithms$vTextbooks 606 $aComputer science$xMathematics$vTextbooks 606 $aCryptography$vTextbooks 606 $aAlgebra$vTextbooks 615 0$aOrdered algebraic structures 615 0$aAlgorithms 615 0$aComputer science$xMathematics 615 0$aCryptography 615 0$aAlgebra 676 $a511.3/3 700 $aDiekert$b Volker$f1955-$01220869 702 $aDiekert$b Volker 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910798486803321 996 $aDiscrete algebraic methods$93693229 997 $aUNINA