NIST · ИТ · 0bacc1d515e856575405
The Multiplicative Complexity of Boolean Functions on Four and Five Variables
A generic way to design lightweight cryptographic primitives is to construct simple rounds using small nonlinear components such as 4x4 S-boxes and use these iteratively (e.g., PRESENT and SPONGENT). In order to efficiently implement the primitive, optimal
NIST · ИТОфициальный источник · 2015-03-17
{
"title_en": "The Multiplicative Complexity of Boolean Functions on Four and Five Variables",
"designation": "",
"series": "",
"status": "",
"date": "2015-03-17",
"date_original": "March 17, 2015",
"url": "https://www.nist.gov/publications/multiplicative-complexity-boolean-functions-four-and-five-variables",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Meltem Sonmez Turan , Rene C. Peralta",
"abstract_excerpt_en": "A generic way to design lightweight cryptographic primitives is to construct simple rounds using small nonlinear components such as 4x4 S-boxes and use these iteratively (e.g., PRESENT and SPONGENT). In order to efficiently implement the primitive, optimal",
"id": "0bacc1d515e856575405",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "The Multiplicative Complexity of Boolean Functions on Four and Five Variables",
"designation": "",
"series": "",
"status": "",
"date": "2015-03-17",
"date_original": "March 17, 2015",
"url": "https://www.nist.gov/publications/multiplicative-complexity-boolean-functions-four-and-five-variables",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Meltem Sonmez Turan , Rene C. Peralta",
"abstract_excerpt_en": "A generic way to design lightweight cryptographic primitives is to construct simple rounds using small nonlinear components such as 4x4 S-boxes and use these iteratively (e.g., PRESENT and SPONGENT). In order to efficiently implement the primitive, optimal"
}
],
"translation_state": "none",
"possible_title_matches": 1
}