Cost analysis of hash collisions: will quantum computers make SHARCS obsolete? D. J. Bernstein University of Illinois at Chicago NSF ITR–

First Page		Document Content
Date: 2009-09-22 19:00:54 Theoretical computer science Emerging technologies Quantum information science Quantum computing Quantum cryptography Applied mathematics Quantum mechanics Quantum algorithm Hash function Quantum information Quantum machine learning		Cost analysis of hash collisions: will quantum computers make SHARCS obsolete? D. J. Bernstein University of Illinois at Chicago NSF ITR– Add to Reading List Source URL: www.hyperelliptic.org Download Document from Source Website File Size: 85,92 KB Share Document on Facebook

	Machine Learning Researcher Zapata computing is a quantum software, services, and applications company developing quantum algorithms to solve critical problems. A vital part of our mission at Zapata is to create an envir DocID: 1ujnc - View Document
	Parallel Implementation of BDD enumeration for LWE Elena Kirshanova, Alexander May, Friedrich Wiemer Horst G¨ ortz Institute for IT-Security Faculty of Mathematics DocID: 1pJyl - View Document
	Faculty Members and Labs in Department of Computer Science Professor Masami Hagiya The world is full of computation! From Anshin-Anzen (reliable and safe) to Ayashii-Abunai (enigmatic and adventurous) Whi DocID: 1pvan - View Document
	Journal of Machine Learning Research ?? (2013) ???-??? Submitted 10/12; Published ??/13 On the Learnability of Shuffle Ideals Dana Angluin DocID: 19qiC - View Document
	Post-quantum Authenticated Key Exchange from Ideal Lattices ¨ u¨ r Dagdelen3 Jiang Zhang1 , Zhenfeng Zhang1,∗ , Jintai Ding2,∗ , Michael Snook2 , and Ozg 1 Institute of Software, Chinese Academy of Sciences, China DocID: 196CQ - View Document