Akinori Kawachi

Generating author description...

All published works

Action	Title	Year	Authors
+	Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher	2023	Akinori Kawachi Yuki Naito
+	Communication Complexity of Private Simultaneous Quantum Messages Protocols	2021	Akinori Kawachi Harumichi Nishimura
+	Communication Complexity of Private Simultaneous Quantum Messages Protocols.	2021	Akinori Kawachi Harumichi Nishimura
+	Hard Functions for Low-Degree Polynomials over Prime Fields	2013	Andrej Bogdanov Akinori Kawachi Hidetoki Tanaka
+ PDF Chat	Estimating the Gowers Norm of Modulo Functions over Prime Fields	2012	Akinori Kawachi Hidetoki Tanaka Osamu Watanabe
+ PDF Chat	Computational Indistinguishability Between Quantum States and Its Cryptographic Application	2011	Akinori Kawachi Takeshi Koshiba Harumichi Nishimura Tomoyuki Yamakami
+	Hard Functions for Low-Degree Polynomials over Prime Fields	2011	Andrej Bogdanov Akinori Kawachi Hidetoki Tanaka
+	Hard Functions for Low-degree Polynomials over Prime Fields (Extended Abstract)	2010	Bogdanov Andrej Akinori Kawachi Hidetoki Tanaka
+ PDF Chat	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding	2010	Akinori Kawachi Tomoyuki Yamakami
+ PDF Chat	On the Power of Quantum Encryption Keys	2008	Akinori Kawachi Christopher Portmann
+	Multi-Bit Cryptosystems based on Lattice Problems : Extended Abstract(New Trends in Theory of Computation and Algorithm)	2006	Keita Xagawa Akinori Kawachi Keisuke Tanaka
+	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding	2006	Akinori Kawachi Tomoyuki Yamakami
+ PDF Chat	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding	2006	Akinori Kawachi Tomoyuki Yamakami
+ PDF Chat	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding	2006	Akinori Kawachi Tomoyuki Yamakami
+	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding	2006	Akinori Kawachi Tomoyuki Yamakami
+	Quantum Measurements for Hidden Subgroup Problems with Optimal Sample Complexity	2006	Masahito Hayashi Akinori Kawachi Hirotada Kobayashi
+ PDF Chat	Universal test for quantum one-way permutations	2005	Akinori Kawachi Hirotada Kobayashi Takeshi Koshiba Raymond H. Putra
+	Universal test for quantum one-way permutations	2004	Akinori Kawachi Hirotada Kobayashi Takeshi Koshiba Raymond H. Putra
+	Quantum Asymmetric-Key Cryptosystem based on the Worst-Case Hardness of Graph Automorphism	2004	Akinori Kawachi Koshiba Takeshi Harumichi Nishimura Tomoyuki Yamakami
+	Computational Distinguishability between Quantum States: Random Coset States vs. Maximally Mixed States over the Symmetric Groups	2004	Akinori Kawachi Takeshi Koshiba Harumichi Nishimura Tomoyuki Yamakami
+	Characterizing the Existence of Quantum One-Way Permutations	2004	Akinori Kawachi Hirotada Kobayashi Takeshi Koshiba Rudy Raymond Harry Putra
+	Robust Quantum Algorithms for Oracle Identification	2004	Andris Ambainis Kazuo Iwama Akinori Kawachi Rudy Raymond Shigeru Yamashita
+ PDF Chat	Universal Test for Quantum One-Way Permutations	2004	Akinori Kawachi Hirotada Kobayashi Takeshi Koshiba Raymond H. Putra
+	Quantum Identification of Boolean Oracles	2004	Andris Ambainis Kazuo Iwama Akinori Kawachi Hiroyuki Masuda Raymond H. Putra Shigeru Yamashita
+	Quantum Evaluation of Multi-Valued Boolean Functions	2003	Kazuo Iwama Akinori Kawachi Hiroyuki Masuda Raymond H. Putra Shigeru Yamashita

Common Coauthors

Coauthor	Papers Together
Tomoyuki Yamakami	8
Takeshi Koshiba	6
Harumichi Nishimura	5
Raymond H. Putra	5
Hirotada Kobayashi	5
Hidetoki Tanaka	4
Kazuo Iwama	3
Shigeru Yamashita	3
Andris Ambainis	2
Hiroyuki Masuda	2
Andrej Bogdanov	2
Koshiba Takeshi	1
Rudy Raymond	1
Bogdanov Andrej	1
Rudy Raymond Harry Putra	1
Keisuke Tanaka	1
Masahito Hayashi	1
Osamu Watanabe	1
Christopher Portmann	1
Yuki Naito	1
Keita Xagawa	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	A Quantum Goldreich-Levin Theorem with Cryptographic Applications	2002	Mark Adcock Richard Cleve	9
+	How to Generate Cryptographically Strong Sequences of Pseudorandom Bits	1984	Manuel Blum Silvio Micali	6
+	Theory and application of trapdoor functions	1982	Andrew Chi-Chih Yao	4
+ PDF Chat	Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer	1997	Peter W. Shor	4
+	Theory and application of trapdoor functions	1982	Andrew Chi-Chih Yao	4
+ PDF Chat	Quantum Search on Bounded-Error Inputs	2003	Peter Høyer Michele Mosca Ronald de Wolf	4
+ PDF Chat	Improved Bounds on Quantum Learning Algorithms	2005	Alp Atıcı Rocco A. Servedio	4
+	The Hidden Subgroup Problem in Affine Groups: Basis Selection in Fourier Sampling	2002	Cristopher Moore Daniel N. Rockmore Alexander Russell Leonard J. Schulman	3
+	Prime Numbers: A Computational Perspective	2012	Richard E. Crandall Carl Pomerance	3
+	A New Proof of Szemer�di's Theorem for Arithmetic Progressions of Length Four	1998	W. T. Gowers	3
+	The hidden subgroup problem and permutation group theory	2005	Julia Kempe Aner Shalev	3
+	EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM	2003	Gábor Ivanyos Frédéric Magniez Miklós Sántha	3
+ PDF Chat	Strengths and Weaknesses of Quantum Computing	1997	Charles H. Bennett Ethan Bernstein Gilles Brassard Umesh Vazirani	3
+	A new proof of Szemerédi's theorem	2001	W. T. Gowers	3
+ PDF Chat	Quantum Mechanics Helps in Searching for a Needle in a Haystack	1997	Lov K. Grover	3
+ PDF Chat	Quantum Algorithms for Some Hidden Shift Problems	2006	Wim van Dam Sean Hallgren Lawrence Ip	3
+ PDF Chat	On quantum detection and the square-root measurement	2001	Yonina C. Eldar G. David Forney	3
+ PDF Chat	Low-degree tests at large distances	2007	Alex Samorodnitsky	3
+ PDF Chat	Optimal Testing of Reed-Muller Codes	2010	Arnab Bhattacharyya Swastik Kopparty Grant Schoenebeck Madhu Sudan David Zuckerman	2
+	An improved bound on correlation between polynomials over Z_m and MOD_q.	2006	Arkadev Chattopadhyay	2
+	Quantum measurements and the Abelian Stabilizer Problem	1995	Alexei Kitaev	2
+	Universal tests for nonuniform distributions	1993	A. W. Schrift Adi Shamir	2
+	On Quantum Algorithms for Noncommutative Hidden Subgroups	2000	Mark Ettinger Peter Høyer	2
+	The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer	1999	Michele Mosca Artur Ekert	2
+	Quantum Lower Bounds by Polynomials	1998	Robert Beals Harry Buhrman Richard Cleve Michele Mosca Ronald de Wolf	2
+ PDF Chat	Tight Bounds on Quantum Searching	1998	Michel Boyer Gilles Brassard Peter Høyer Alain Tapp	2
+ PDF Chat	Quantum lower bounds for the collision and the element distinctness problems	2003	Yaoyun Shi	2
+ PDF Chat	Fast Quantum Fourier Transforms for a Class of Non-abelian Groups	1999	Markus Püschel Martin Rötteler Thomas Beth	2
+ PDF Chat	Bounds on an exponential sum arising in Boolean circuit complexity	2005	Frederic Green Amitabha Roy Howard Straubing	2
+ PDF Chat	From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups	2005	Dave Bacon Andrew M. Childs Wim van Dam	2
+ PDF Chat	Unconditional security in quantum cryptography	2001	Dominic Mayers	2
+	Robust Quantum Algorithms for Oracle Identification	2004	Andris Ambainis Kazuo Iwama Akinori Kawachi Rudy Raymond Shigeru Yamashita	2
+	Generic quantum Fourier transforms	2004	Cristopher Moore Daniel N. Rockmore Alexander Russell	2
+	Quantum amplitude amplification and estimation	2002	Gilles Brassard Peter Høyer Michele Mosca Alain Tapp	2
+ PDF Chat	Limitations of quantum coset states for graph isomorphism	2006	Sean Hallgren Cristopher Moore Martin Rötteler Alexander Russell Pranab Kumar Sen	2
+ PDF Chat	Simple Proof of Security of the BB84 Quantum Key Distribution Protocol	2000	Peter W. Shor John Preskill	2
+	None	2009	Charanjit S. Jutla Anindya C. Patthak Atri Rudra David Zuckerman	2
+ PDF Chat	AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM	2008	Ben Green Terence Tao	2
+ PDF Chat	A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem	2005	Greg Kuperberg	2
+ PDF Chat	Estimation of certain exponential sums arising in complexity theory	2005	Jean Bourgain	2
+ PDF Chat	Unconditionally Secure Quantum Bit Commitment is Impossible	1997	Dominic Mayers	2
+ PDF Chat	A Foundation of Programming a Multi-tape Quantum Turing Machine	1999	Tomoyuki Yamakami	2
+	Worst‐Case to Average‐Case Reductions Based on Gaussian Measures	2007	Daniele Micciancio Oded Regev	1
+ PDF Chat	One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size	2007	Hartmut Klauck	1
+	A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space	2004	Oded Regev	1
+ PDF Chat	Randomizing Quantum States: Constructions and Applications	2004	Patrick Hayden Debbie Leung Peter W. Shor Andreas Winter	1
+ PDF Chat	Gowers uniformity, influence of variables, and PCPs	2006	Alex Samorodnitsky Luca Trevisan	1
+	Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups	1998	Martin Roetteler Thomas Beth	1
+ PDF Chat	Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding	2006	Akinori Kawachi Tomoyuki Yamakami	1
+	New lattice-based cryptographic constructions	2004	Oded Regev	1