default search action
MMICS 2008: Karlsruhe, Germany
- Jacques Calmet, Willi Geiselmann, Jörn Müller-Quade:
Mathematical Methods in Computer Science, MMICS 2008, Karlsruhe, Germany, December 17-19, 2008 - Essays in Memory of Thomas Beth. Lecture Notes in Computer Science 5393, Springer 2008, ISBN 978-3-540-89993-8
Cryptography I
- Giovanni Di Crescenzo:
On the Security of Beth's Identification Schemes against Active and Concurrent Adversaries. 1-17
Designs
- Michael Huber:
Steiner t-Designs for Large t. 18-26 - Harald Gropp:
New Spatial Configurations. 27-30 - Axel Kohnert, Sascha Kurz:
Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance. 31-42
Quantum Computing
- Richard Jozsa:
Invited Talk: Embedding Classical into Quantum Computation. 43-49 - Aleksandrs Belovs, Juris Smotrovs:
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases. 50-69 - Hari Krovi, Martin Rötteler:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups. 70-88
Algorithms
- Markus Grassl:
Computing Equiangular Lines in Complex Space. 89-104 - Samuel Lundqvist:
Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm. 105-125
Coding Theory
- Teo Mora, Emmanuela Orsini:
Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy. 126-127 - Jaume Pernas, Jaume Pujol, Mercè Villanueva:
Kernel Dimension for Some Families of Quaternary Reed-Muller Codes. 128-141
Cryptography II
- Kazukuni Kobara, Kirill Morozov, Raphael Overbeck:
Coding-Based Oblivious Transfer. 142-156 - Dejan E. Lazich, Micaela Wuensche:
Protection of Sensitive Security Parameters in Integrated Circuits. 157-178 - Shahram Khazaei, Willi Meier:
On Reconstruction of RC4 Keys from Internal States. 179-189
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.