## Abstract

For every prime p, there are AT^{2}-optimal VLSI multipliers for Galois fields GF(p^{n}) in standard notation. In fact, the lower bound AT^{2} = Ω(n^{2}) 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 language | English (US) |
---|---|

Title of host publication | VLSl Algorithms and Architectures - Aegean Workshop on Computing, Proceedings |

Editors | Kurt Mehlhorn, Fillia Makedon, T. Papatheodorou, P. Spirakis |

Publisher | Springer Verlag |

Pages | 217-225 |

Number of pages | 9 |

ISBN (Print) | 9783540167662 |

DOIs | |

State | Published - 1986 |

Event | Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1986 - Loutrak, Greece Duration: Jul 8 1986 → Jul 11 1986 |

### Publication series

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

Volume | 227 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1986 |
---|---|

Country/Territory | Greece |

City | Loutrak |

Period | 7/8/86 → 7/11/86 |

## All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint

Dive into the research topics of 'At^{2}-optimal galois field multiplier for VLSI'. Together they form a unique fingerprint.