@inproceedings{361b42be83424492a593c1862b3f8433,

title = "At2-optimal galois field multiplier for VLSI",

abstract = "For every prime p, there are AT2-optimal VLSI multipliers for Galois fields GF(pn) in standard notation. In fact, the lower bound AT2 = Ω(n2) is matched for every computation time T in the range [Ω(log n), 0(√n)]. Similar results hold for variable primes p too. The designs are based on the DFT on a structure similar to Fermat rings. For p=2 the DFT uses 3ℓ-th instead of 2ℓ-th rotts of unity.",

author = "Martin Furer and Kurt Mehlhorn",

year = "1986",

month = jan,

day = "1",

doi = "10.1007/3-540-16766-8_19",

language = "English (US)",

isbn = "9783540167662",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "217--225",

editor = "Kurt Mehlhorn and Fillia Makedon and T. Papatheodorou and P. Spirakis",

booktitle = "VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings",

address = "Germany",

note = "Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1986 ; Conference date: 08-07-1986 Through 11-07-1986",

}