Quantum circuits for $${\mathbb {F}}_{2^{n}}$$ F 2 n -multiplication with subquadratic gate count

Quantum circuits for $${\mathbb {F}}_{2^{n}}$$ F 2 n -multiplication with subquadratic... One of the most cost-critical operations when applying Shor’s algorithm to binary elliptic curves is the underlying field arithmetic. Here, we consider binary fields $${\mathbb {F}}_{2^n}$$ F 2 n in polynomial basis representation, targeting especially field sizes as used in elliptic curve cryptography. Building on Karatsuba’s algorithm, our software implementation automatically synthesizes a multiplication circuit with the number of $$T$$ T -gates being bounded by $$7\cdot n^{\log _2(3)}$$ 7 · n log 2 ( 3 ) for any given reduction polynomial of degree $$n=2^N$$ n = 2 N . If an irreducible trinomial of degree $$n$$ n exists, then a multiplication circuit with a total gate count of $${\mathcal {O}}(n^{\log _2(3)})$$ O ( n log 2 ( 3 ) ) is available. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Quantum circuits for $${\mathbb {F}}_{2^{n}}$$ F 2 n -multiplication with subquadratic gate count

Loading next page...
 
/lp/springer_journal/quantum-circuits-for-mathbb-f-2-n-f-2-n-multiplication-with-ZXot2RDDFc
Publisher
Springer Journals
Copyright
Copyright © 2015 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-015-0993-1
Publisher site
See Article on Publisher Site

Abstract

One of the most cost-critical operations when applying Shor’s algorithm to binary elliptic curves is the underlying field arithmetic. Here, we consider binary fields $${\mathbb {F}}_{2^n}$$ F 2 n in polynomial basis representation, targeting especially field sizes as used in elliptic curve cryptography. Building on Karatsuba’s algorithm, our software implementation automatically synthesizes a multiplication circuit with the number of $$T$$ T -gates being bounded by $$7\cdot n^{\log _2(3)}$$ 7 · n log 2 ( 3 ) for any given reduction polynomial of degree $$n=2^N$$ n = 2 N . If an irreducible trinomial of degree $$n$$ n exists, then a multiplication circuit with a total gate count of $${\mathcal {O}}(n^{\log _2(3)})$$ O ( n log 2 ( 3 ) ) is available.

Journal

Quantum Information ProcessingSpringer Journals

Published: May 12, 2015

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off