Reversible Logic Synthesis Benchmarks Page

you are in... Main\gf2^512mult

Function gf2^512mult finds product of two elements, a and b, of a field GF(2512). The output, c=ab, is written onto the last 512 bits. Inputs a and b must remain unchanged.
Primitive polynomial Picture Machine-readable version Model Garbage Gate count Quantum cost Author(s) Date
x512+x8+x5+x2+1 N/A (too large) here CNT 1,024 263,677 1,312,253 D. Cheung, D. Maslov, J. Mathew, and D. K. Pradhan July, 2010
m - the number is shown to be minimal