Post-Quantum Cryptography 4th International Workshop, PQCrypto 2011,
This book constitutes the refereed proceedings of the 4th International Workshop on Post-Quantum Cryptography, PQCrypto 2011, held in Taipei, Taiwan, in November/December 2011. The 18 revised full papers presented were carefully reviewed and selected from
- PDF / 4,222,112 Bytes
- 304 Pages / 429.442 x 659.895 pts Page_size
- 63 Downloads / 210 Views
Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany
7071
Bo-Yin Yang (Ed.)
Post-Quantum Cryptography 4th International Workshop, PQCrypto 2011 Taipei, Taiwan, November 29 – December 2, 2011 Proceedings
13
Volume Editor Bo-Yin Yang Academia Sinica Institute of Information Science 128 Section 2 Academia Road, Taipei 115, Taiwan E-mail: [email protected]
ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-642-25404-8 e-ISBN 978-3-642-25405-5 DOI 10.1007/978-3-642-25405-5 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2011940842 CR Subject Classification (1998): E.3, K.6.5, D.4.6, C.2, J.1, G.2.1 LNCS Sublibrary: SL 4 – Security and Cryptology
© Springer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Foreword
With Shor’s algorithm (Peter W. Shor, “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”, SIAM J. Sci. Statist. Comput. 41 (2): 303–332, 1999) and its first public instantiation in 2001, when Isaac Chuang and Neil Gershenfeld implemented Shor’s algorithm on a 7-qubit quantum computer, it became common knowledge that RSA will crumble with the advent of large quantum computers. Follow-ups made it clear that discrete logarithm problems are equally as broke
Data Loading...
