NIST · ИТ · e358bc97fcd3076c3faf
Better Circuits for Binary Polynomial Multiplication
We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of polynomials over GF2. These techniques, along with interpolation-based recurrences, yield circuits that are better (smaller and with lower depth) than anything
NIST · ИТОфициальный источник · 2019-04-01
{
"title_en": "Better Circuits for Binary Polynomial Multiplication",
"designation": "",
"series": "",
"status": "",
"date": "2019-04-01",
"date_original": "April 1, 2019",
"url": "https://www.nist.gov/publications/better-circuits-binary-polynomial-multiplication",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Rene C. Peralta , Magnus G. Find",
"abstract_excerpt_en": "We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of polynomials over GF2. These techniques, along with interpolation-based recurrences, yield circuits that are better (smaller and with lower depth) than anything",
"id": "e358bc97fcd3076c3faf",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Better Circuits for Binary Polynomial Multiplication",
"designation": "",
"series": "",
"status": "",
"date": "2019-04-01",
"date_original": "April 1, 2019",
"url": "https://www.nist.gov/publications/better-circuits-binary-polynomial-multiplication",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Rene C. Peralta , Magnus G. Find",
"abstract_excerpt_en": "We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of polynomials over GF2. These techniques, along with interpolation-based recurrences, yield circuits that are better (smaller and with lower depth) than anything"
}
],
"translation_state": "none",
"possible_title_matches": 1
}