Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth(5393 Lecture Notes in Computer Science)

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.

Table of Contents:
Cryptography I.- On the Security of Beth’s Identification Schemes against Active and Concurrent Adversaries.- Designs.- Steiner t-Designs for Large t.- New Spatial Configurations.- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance.- Quantum Computing.- Invited Talk: Embedding Classical into Quantum Computation.- A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases.- An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups.- Algorithms.- Computing Equiangular Lines in Complex Space.- Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm.- Coding Theory.- Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy.- Kernel Dimension for Some Families of Quaternary Reed-Muller Codes.- Cryptography II.- Coding-Based Oblivious Transfer.- Protection of Sensitive Security Parameters in Integrated Circuits.- On Reconstruction of RC4 Keys from Internal States.