Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth
Springer Science & Business Media, Dec 9, 2008 - Computers - 191 pages
The conference Mathematical Methods in Computer Science (MMICS) was held in the memory of Thomas Beth during December 17–19 in Karlsruhe. The c- ference was meant to re?ect the many interests of Thomas Beth. Even though these interests might seem diverse the mathematical methods employed and - pecially algebra as a language were the common denominator of all his scienti?c achievements. The 12 contributed talks reaching from t-designs to integrated circuits were selected from 30 submissions from 14 countries. The contributed talks were complemented by three invited talks. Teo Mora gave a talk on “Decoding Cyclic Codes: The Cooper Philosophy” embracing the areas of coding theory and symbolic computation. These areas were especially appreciated by Thomas Beth, because they combine algebra and algorithmics. Richard Jozsa lectured about “Embedding Classical into Quantum Compu- tion” in the area of quantum information. Quantum information was a focus of research of Tomas Beth since 1993 when he co-organized one of the e- liest workshops on quantum cryptography in Dagstuhl. Quantum information became his passion in 1994 when the connection between the Fourier transf- mation and breaking the RSA crypto system became apparent via Shor's al- rithm, which can factor integers in polynomial time on a quantum computer. The Fourier transform and cryptography were topics that played an important role in Thomas Beth's research and this connection, once again, justi?ed his broad view on computer science.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abelian algebra arxiv Beth binary codes binary linear BM-algorithm circuit classical Cliﬀord codewords column Combinatorial Designs complexity conﬁguration constant dimension code coset cryptographic decoding deﬁned Deﬁnition delay line delay line pairs denoted diﬀerent dimensional irreps eﬃcient elements encryption equations equiangular lines ﬁeld ﬁnd ﬁnite ﬁrst ﬂag-transitive Fourier matrix function given Goppa code Gpub Gr¨obner group G Hadamard Hadamard matrices Hamming distance Heidelberg 2008 hidden subgroup problem IC-Eigenkey IC-EK identiﬁcation scheme IEEE impersonation attack input integer inverter matrix irreps Lemma linear code LNCS McEliece monomial order oblivious transfer obtain orbits orthogonal permutation polynomial Proof protocol prove public key quantum computing quaternary linear code Rabin random Reed-Muller codes result scheme Beth-SI-0 secret key security parameter sender signature scheme Springer Steiner t-design subspace system of MUBs Theorem Theory upper bound vectors veriﬁer Welch bounds Weyl-Heisenberg group Z4-linear codes ZKID