At2-optimal galois field multiplier for VLSI

Martin Furer, Kurt Mehlhorn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish (US)
Title of host publicationVLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings
EditorsKurt Mehlhorn, Fillia Makedon, T. Papatheodorou, P. Spirakis
PublisherSpringer Verlag
Pages217-225
Number of pages9
ISBN (Print)9783540167662
DOIs
StatePublished - Jan 1 1986
EventAegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1986 - Loutrak, Greece
Duration: Jul 8 1986Jul 11 1986

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume227 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherAegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1986
CountryGreece
CityLoutrak
Period7/8/867/11/86

Fingerprint

Design for testability
Discrete Fourier transforms
Multiplier
Galois field
Fermat
Notation
Lower bound
Ring
Range of data
Design
Standards

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Furer, M., & Mehlhorn, K. (1986). At2-optimal galois field multiplier for VLSI. In K. Mehlhorn, F. Makedon, T. Papatheodorou, & P. Spirakis (Eds.), VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings (pp. 217-225). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 227 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-16766-8_19
Furer, Martin ; Mehlhorn, Kurt. / At2-optimal galois field multiplier for VLSI. VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings. editor / Kurt Mehlhorn ; Fillia Makedon ; T. Papatheodorou ; P. Spirakis. Springer Verlag, 1986. pp. 217-225 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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 = "1",
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",

}

Furer, M & Mehlhorn, K 1986, At2-optimal galois field multiplier for VLSI. in K Mehlhorn, F Makedon, T Papatheodorou & P Spirakis (eds), VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 227 LNCS, Springer Verlag, pp. 217-225, Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1986, Loutrak, Greece, 7/8/86. https://doi.org/10.1007/3-540-16766-8_19

At2-optimal galois field multiplier for VLSI. / Furer, Martin; Mehlhorn, Kurt.

VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings. ed. / Kurt Mehlhorn; Fillia Makedon; T. Papatheodorou; P. Spirakis. Springer Verlag, 1986. p. 217-225 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 227 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - At2-optimal galois field multiplier for VLSI

AU - Furer, Martin

AU - Mehlhorn, Kurt

PY - 1986/1/1

Y1 - 1986/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84919773602&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84919773602&partnerID=8YFLogxK

U2 - 10.1007/3-540-16766-8_19

DO - 10.1007/3-540-16766-8_19

M3 - Conference contribution

SN - 9783540167662

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 217

EP - 225

BT - VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings

A2 - Mehlhorn, Kurt

A2 - Makedon, Fillia

A2 - Papatheodorou, T.

A2 - Spirakis, P.

PB - Springer Verlag

ER -

Furer M, Mehlhorn K. At2-optimal galois field multiplier for VLSI. In Mehlhorn K, Makedon F, Papatheodorou T, Spirakis P, editors, VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings. Springer Verlag. 1986. p. 217-225. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-16766-8_19