Michele Mosca

Publication Activity (10 Years)

Years Active: 1998-2025
Publications (10 Years): 27

Top Topics

Key Distribution

Quantum Computing

Top Venues

IACR Cryptol. ePrint Arch.

Dagstuhl Reports

IEEE Secur. Priv.

Publications

Vlad Gheorghiu, Michele Mosca
Quantum resource estimation for large scale quantum algorithms. Future Gener. Comput. Syst. 162 (2025)
Dohun Kim, Minyoung Kim, Sarah Meng Li, Michele Mosca
Improving the Fidelity of CNOT Circuits on NISQ Hardware. CoRR (2024)
Jiaxin Huang, Sarah Meng Li, Lia Yeh, Aleks Kissinger, Michele Mosca, Michael Vasmer
Graphical CSS Code Transformation Using ZX Calculus. CoRR (2023)
Vlad Gheorghiu, Jiaxin Huang, Sarah Meng Li, Michele Mosca, Priyanka Mukhopadhyay
Reducing the CNOT Count for Clifford+T Circuits on NISQ Architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42 (6) (2023)
Amelia Holcomb, Geovandro C. C. F. Pereira, Bhargav Das, Michele Mosca
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks. IEEE ICBC (2021)
Stacey Jeffery, Michele Mosca, María Naya-Plasencia, Rainer Steinwandt
Quantum Cryptanalysis (Dagstuhl Seminar 21421). Dagstuhl Reports 11 (9) (2021)
Bhargav Das, Amelia Holcomb, Michele Mosca, Geovandro C. C. F. Pereira
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks. CoRR (2020)
Michele Mosca, João Marcos Vensi Basso, Sebastian R. Verschoor
On speeding up factoring with quantum SAT solvers. CoRR (2019)
Michele Mosca, María Naya-Plasencia, Rainer Steinwandt
Quantum Cryptanalysis (Dagstuhl Seminar 19421). Dagstuhl Reports 9 (10) (2019)
Matthew Amy, Michele Mosca
T-Count Optimization and Reed-Muller Codes. IEEE Trans. Inf. Theory 65 (8) (2019)
Michele Mosca, Sebastian R. Verschoor
Factoring semi-primes with (quantum) SAT-solvers. CoRR (2019)
Johannes Buchmann, Kristin E. Lauter, Michele Mosca
Postquantum Cryptography, Part 2. IEEE Secur. Priv. 16 (5) (2018)
Michele Mosca, Martin Roetteler, Peter Selinger
Quantum Programming Languages (Dagstuhl Seminar 18381). Dagstuhl Reports 8 (9) (2018)
Michele Mosca
Cybersecurity in an Era with Quantum Computers: Will We Be Ready? IEEE Secur. Priv. 16 (5) (2018)
Piotr K. Tysowski, Xinhua Ling, Norbert Lütkenhaus, Michele Mosca
The Engineering of a Scalable Multi-Site Communications System Utilizing Quantum Key Distribution (QKD). CoRR (2017)
John Mulholland, Michele Mosca, Johannes Braun
The Day the Cryptography Dies. IEEE Secur. Priv. 15 (4) (2017)
Alex Parent, Martin Roetteler, Michele Mosca
Improved reversible and quantum circuits for Karatsuba-based integer multiplication. TQC (2017)
Johannes Buchmann, Kristin E. Lauter, Michele Mosca
Postquantum Cryptography - State of the Art. IEEE Secur. Priv. 15 (4) (2017)
Daniel J. Bernstein, Jean-François Biasse, Michele Mosca
A low-resource quantum factoring algorithm. IACR Cryptol. ePrint Arch. 2017 (2017)
Michele Mosca, Nicolas Sendrier, Rainer Steinwandt, Krysta M. Svore
Quantum Cryptanalysis (Dagstuhl Seminar 17401). Dagstuhl Reports 7 (10) (2017)
Daniel J. Bernstein, Jean-François Biasse, Michele Mosca
A Low-Resource Quantum Factoring Algorithm. PQCrypto (2017)
Alex Parent, Martin Roetteler, Michele Mosca
Improved reversible and quantum circuits for Karatsuba-based integer multiplication. CoRR (2017)
Douglas Stebila, Michele Mosca
Post-Quantum Key Exchange for the Internet and the Open Quantum Safe Project. IACR Cryptol. ePrint Arch. 2016 (2016)
Douglas Stebila, Michele Mosca
Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project. SAC (2016)
Matthew Amy, Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca, Alex Parent, John M. Schanck
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. IACR Cryptol. ePrint Arch. 2016 (2016)
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits. IEEE Trans. Computers 65 (1) (2016)
Matthew Amy, Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca, Alex Parent, John M. Schanck
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3. SAC (2016)
Michele Mosca
Cybersecurity in an era with quantum computers: will we be ready? IACR Cryptol. ePrint Arch. 2015 (2015)
Michele Mosca, Martin Roetteler, Nicolas Sendrier, Rainer Steinwandt
Quantum Cryptanalysis (Dagstuhl Seminar 15371). Dagstuhl Reports 5 (9) (2015)
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Finding shortest lattice vectors faster using quantum search. Des. Codes Cryptogr. 77 (2-3) (2015)
Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor, Michele Mosca, Priyaa Varshinee Srinivasan
On the Robustness of Bucket Brigade Quantum RAM. TQC (2015)
Lawrence M. Ioannou, Michele Mosca
Public-key cryptography based on bounded quantum reference frames. Theor. Comput. Sci. 560 (2014)
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Finding shortest lattice vectors faster using quantum search. IACR Cryptol. ePrint Arch. 2014 (2014)
Matthew Amy, Dmitri Maslov, Michele Mosca
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33 (10) (2014)
David Gosset, Vadym Kliuchnikov, Michele Mosca, Vincent Russo
An algorithm for the T-count. Quantum Inf. Comput. 14 (15-16) (2014)
Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32 (6) (2013)
Michele Mosca, Douglas Stebila, Berkant Ustaoglu
Quantum Key Distribution in the Classical Authenticated Key Exchange Framework. PQCrypto (2013)
Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt
Quantum Cryptanalysis (Dagstuhl Seminar 13371). Dagstuhl Reports 3 (9) (2013)
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search CoRR (2013)
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates. Quantum Inf. Comput. 13 (7-8) (2013)
Matthew Amy, Dmitri Maslov, Michele Mosca
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning CoRR (2013)
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. PQCrypto (2013)
Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits CoRR (2012)
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits CoRR (2012)
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits CoRR (2012)
Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates CoRR (2012)
Michele Mosca
Quantum Computing, Cryptography and Compilers. ISMVL (2012)
Michele Mosca, Douglas Stebila, Berkant Ustaoglu
Quantum Key Distribution in the Classical Authenticated Key Exchange Framework. IACR Cryptol. ePrint Arch. 2012 (2012)
Lawrence M. Ioannou, Michele Mosca
Unconditionally-Secure and Reusable Public-Key Authentication. TQC (2011)
Lawrence M. Ioannou, Michele Mosca
A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys. PQCrypto (2011)
Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt
Quantum Cryptanalysis (Dagstuhl Seminar 11381). Dagstuhl Reports 1 (9) (2011)
Matthew McKague, Michele Mosca
Generalized Self-testing and the Security of the 6-State Protocol. TQC (2010)
Lawrence M. Ioannou, Michele Mosca
Universal quantum computation in a hidden basis. Quantum Inf. Comput. 10 (7&8) (2010)
Douglas Stebila, Michele Mosca, Norbert Lütkenhaus
The Case for Quantum Key Distribution. IACR Cryptol. ePrint Arch. 2009 (2009)
Douglas Stebila, Michele Mosca, Norbert Lütkenhaus
The Case for Quantum Key Distribution. QuantumComm (2009)
Richard Cleve, Daniel Gottesman, Michele Mosca, Rolando D. Somma, David L. Yonge-Mallo
Efficient discrete-time simulations of continuous-time quantum query algorithms. STOC (2009)
Dmitri Maslov, Sean M. Falconer, Michele Mosca
Quantum Circuit Placement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27 (4) (2008)
Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. SIAM J. Comput. 37 (2) (2007)
Dmitri Maslov, Sean M. Falconer, Michele Mosca
Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment. DAC (2007)
Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier
Self-testing of Quantum Circuits. ICALP (1) (2006)
Peter Høyer, Michele Mosca, Ronald de Wolf
Quantum Search on Bounded-Error Inputs CoRR (2003)
Peter Høyer, Michele Mosca, Ronald de Wolf
Quantum Search on Bounded-Error Inputs. ICALP (2003)
Michele Mosca, Alain Tapp
Introduction. Algorithmica 34 (4) (2002)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum lower bounds by polynomials. J. ACM 48 (4) (2001)
Wim van Dam, Michele Mosca, Umesh V. Vazirani
How Powerful is Adiabatic Quantum Computation?. FOCS (2001)
Kevin K. H. Cheung, Michele Mosca
Decomposing finite Abelian groups. Quantum Inf. Comput. 1 (3) (2001)
Kevin K. H. Cheung, Michele Mosca
Decomposing Finite Abelian Groups CoRR (2001)
Michele Mosca
Counting by quantum eigenvalue estimation. Theor. Comput. Sci. 264 (1) (2001)
Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
Self-testing of universal and fault-tolerant sets of quantum gates. STOC (2000)
Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf
Private Quantum Channels. FOCS (2000)
Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates CoRR (1999)
Richard Cleve, Artur Ekert, Leah Henderson, Chiara Macchiavello, Michele Mosca
On quantum algorithms. Complex. 4 (1) (1998)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum Lower Bounds by Polynomials. FOCS (1998)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum Lower Bounds by Polynomials CoRR (1998)
Michele Mosca
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph. Comb. Probab. Comput. 7 (2) (1998)
Michele Mosca, Artur Ekert
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer. QCQC (1998)