NIST · ИТ · bfcab2431cfc6d7177b0
The Exact Multiplicative Complexity of the Hamming Weight Function
We consider the problem of computing the Hamming weight of an n-bit vector using a circuit with gates for addition and multiplication modulo 2 (alternatively, XOR and conjunction gates) only. The number of multiplications necessary and sufficient to build
NIST · ИТОфициальный источник · 2005-09-13
{
"title_en": "The Exact Multiplicative Complexity of the Hamming Weight Function",
"designation": "",
"series": "",
"status": "",
"date": "2005-09-13",
"date_original": "September 13, 2005",
"url": "https://www.nist.gov/publications/exact-multiplicative-complexity-hamming-weight-function",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Rene C. Peralta , Joan Boyar",
"abstract_excerpt_en": "We consider the problem of computing the Hamming weight of an n-bit vector using a circuit with gates for addition and multiplication modulo 2 (alternatively, XOR and conjunction gates) only. The number of multiplications necessary and sufficient to build",
"id": "bfcab2431cfc6d7177b0",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "The Exact Multiplicative Complexity of the Hamming Weight Function",
"designation": "",
"series": "",
"status": "",
"date": "2005-09-13",
"date_original": "September 13, 2005",
"url": "https://www.nist.gov/publications/exact-multiplicative-complexity-hamming-weight-function",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Rene C. Peralta , Joan Boyar",
"abstract_excerpt_en": "We consider the problem of computing the Hamming weight of an n-bit vector using a circuit with gates for addition and multiplication modulo 2 (alternatively, XOR and conjunction gates) only. The number of multiplications necessary and sufficient to build"
}
],
"translation_state": "none"
}