Jacques Calmet / Willi Geiselmann / Jörn Müller-Quade (Volume editor)

Mathematical Methods in Computer Science

Essays in Memory of Thomas Beth
Herausgegeben:Calmet, Jacques; Geiselmann, Willi; Müller-Quade, Jörn

• Broschiertes Buch

Produktbeschreibung

This Festschrift volume contains the proceedings of the conference Mathematical Methods in Computer Science, MMICS 2008, which was held during December 17-19, 2008, in Karlsruhe, Germany, in memory of Thomas Beth.

The themes of the conference reflected the many interests of Thomas Beth. Although, these interests might seem diverse, mathematical methods and especially algebra as a language constituted the common denominator of all of his scientific achievements.

The 12 contributed talks presented were carefully selected from 30 submissions and cover the topics cryptography, designs, quantum computing, algorithms, and coding theory. Furthermore, this volume contains two invited talks held at the conference. One focuses on the area of coding theory and symbolic computation, an area especially appreciated by Thomas Beth, because it combines algebra and algorithmics. The other one discusses quantum information, which again was a focus of Thomas Beth's research.

Produktdetails

• Theoretical Computer Science and General Issues 5393
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-89993-8
• Seitenzahl: 191
• Englisch
• Abmessung: 11mm x 155mm x 235mm
• Gewicht: 320g
• ISBN-13: 9783540899938
• ISBN-10: 3540899936
• Artikelnr.: 25643435

Autorenporträt

Jörn Müller-Quade, geb. 1967, ist Professor für Kryptografie und Sicherheit am Karlsruher Institut für Technologie. Außerdem ist er Direktor am Forschungszentrum Informatik, ebenfalls in Karlsruhe.

Inhaltsangabe

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.