Back to Results
First PageMeta Content
Theoretical computer science / Cryptography / Lattice points / Quantum information science / Analytic geometry / Lattice / Quantum algorithm / Quantum computer / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Mathematics / Applied mathematics / Abstract algebra


SOLILOQUY: A CAUTIONARY TALE Peter Campbell, Michael Groves and Dan Shepherd CESG, Cheltenham, UK 1. Introduction The Soliloquy primitive, first proposed by the third author in 2007, is
Add to Reading List

Document Date: 2014-10-13 10:57:18


Open Document

File Size: 151,23 KB

Share Result on Facebook

City

Berlin / Cheltenham / Paris / /

Company

O0× / Abelian Hidden Subgroup / /

Country

United Kingdom / /

IndustryTerm

round-off algorithm / cryptographic solutions / subexponential algorithm / public-key protocols / quantum algorithm / basic quantum algorithm / unit / lattice reduction algorithm / classical algorithms / computing / polynomialtime quantum algorithm / similar quantum algorithm / classical lattice-based algorithm / quantum algorithms / class / be achieved using Babai’s round-off algorithm / /

Person

Michael Groves / Dan Shepherd / Soliloquy / Peter Campbell / /

Position

author / distinguished coset representative / candidate / /

PublishedMedium

the Theory of Computing / Theory of Computing / /

Technology

encryption / classical lattice-based algorithm / cryptography / quantum algorithm / polynomialtime quantum algorithm / public-key protocols / public key / quantum algorithms / LLL lattice reduction algorithm / CVP algorithm / Polynomial-time quantum algorithms / similar quantum algorithm / private key / round-off algorithm / Soliloquy algorithm / basic quantum algorithm / /

SocialTag