Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Giovanni Di Crescenzo (auth.), Jacques Calmet, Willi Geiselmann, Jörn Müller-Quade (eds.)
Series: Lecture Notes in Computer Science 5393 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008

Language: English
Pages: 191
Tags: Mathematics of Computing; Coding and Information Theory; Computing Methodologies; Data Structures, Cryptology and Information Theory; Data Encryption; Quantum Physics

Front Matter....Pages -
On the Security of Beth’s Identification Schemes against Active and Concurrent Adversaries....Pages 1-17
Steiner t -Designs for Large t ....Pages 18-26
New Spatial Configurations....Pages 27-30
Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance....Pages 31-42
Invited Talk: Embedding Classical into Quantum Computation....Pages 43-49
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases....Pages 50-69
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups....Pages 70-88
Computing Equiangular Lines in Complex Space....Pages 89-104
Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm....Pages 105-125
Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy....Pages 126-127
Kernel Dimension for Some Families of Quaternary Reed-Muller Codes....Pages 128-141
Coding-Based Oblivious Transfer....Pages 142-156
Protection of Sensitive Security Parameters in Integrated Circuits....Pages 157-178
On Reconstruction of RC4 Keys from Internal States....Pages 179-189
Back Matter....Pages -