Search | CSRC

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Results

Showing 19 matching records.

Series	Number	Title Publications	Status	Release Date	Relevance*
Conference Paper		New Bounds on the Multiplicative Complexity of Boolean Functions Conference Paper (Final) New Bounds on the Multiplicative Complexity of Boolean Functions 9/11/2022 Status: Final	Final	9/11/2022	100%
Other		On the Multiplicative Complexity of Cubic Boolean Functions Other (Final) On the Multiplicative Complexity of Cubic Boolean Functions 8/11/2021 Status: Final	Final	8/11/2021	100%
Journal Article		Boolean Functions with Multiplicative Complexity 3 and 4 Journal Article (Final) Boolean Functions with Multiplicative Complexity 3 and 4 7/18/2020 Status: Final	Final	7/18/2020	100%
Journal Article		Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions Journal Article (Final) Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions 8/17/2019 Status: Final	Final	8/17/2019	81%
Conference Paper		Searching for Best Karatsuba Recurrences Conference Paper (Final) Searching for Best Karatsuba Recurrences 6/24/2019 Status: Final	Final	6/24/2019	81%
Journal Article		Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2) Journal Article (Final) Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2) 9/01/2018 Status: Final	Final	9/01/2018	81%
Journal Article		The Multiplicative Complexity of 6-variable Boolean Functions Journal Article (Final) The Multiplicative Complexity of 6-variable Boolean Functions 4/03/2018 Status: Final	Final	4/03/2018	81%
Conference Paper		A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function Conference Paper (Final) A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function 10/11/2016 Status: Final	Final	10/11/2016	81%
Conference Paper		Four Measures of Nonlinearity Conference Paper (Final) Four Measures of Nonlinearity 6/23/2013 Status: Final	Final	6/23/2013	81%
Journal Article		Logic Minimization Techniques with Applications to Cryptology Journal Article (Final) Logic Minimization Techniques with Applications to Cryptology 4/01/2013 Status: Final	Final	4/01/2013	81%
Conference Paper		A New Combinational Logic Minimization Technique with Applications to Cryptology Conference Paper (Final) A New Combinational Logic Minimization Technique with Applications to Cryptology 5/20/2010 Status: Final	Final	5/20/2010	81%
Conference Paper		On the Shortest Linear Straight-Line Program for Computing Linear Forms Conference Paper (Final) On the Shortest Linear Straight-Line Program for Computing Linear Forms 8/29/2008 Status: Final	Final	8/29/2008	81%
Journal Article		Tight Bounds for the Multiplicative Complexity of Symmetric Functions Journal Article (Final) Tight Bounds for the Multiplicative Complexity of Symmetric Functions 4/28/2008 Status: Final	Final	4/28/2008	81%
IR	8165	Impact of Code Complexity on Software Analysis IR 8165 (Final) Impact of Code Complexity on Software Analysis 2/09/2017 Status: Final	Final	2/09/2017	71%
Conference Paper		Minimizing Attack Graph Data Structures Conference Paper (Final) Minimizing Attack Graph Data Structures 11/15/2015 Status: Final	Final	11/15/2015	71%
Other		The Number of Boolean Functions with Multiplicative Complexity 2 Other (Final) The Number of Boolean Functions with Multiplicative Complexity 2 10/27/2015 Status: Final	Final	10/27/2015	71%
Other		Multiplicative Complexity of Vector Value Boolean Functions Other (Final) Multiplicative Complexity of Vector Value Boolean Functions 9/21/2015 Status: Final	Final	9/21/2015	71%
Conference Paper		The Multiplicative Complexity of Boolean Functions on Four and Five Variables Conference Paper (Final) The Multiplicative Complexity of Boolean Functions on Four and Five Variables 3/17/2015 Status: Final	Final	3/17/2015	71%
Other		A depth-16 circuit for the AES S-box Other (Final) A depth-16 circuit for the AES S-box 6/17/2011 Status: Final	Final	6/17/2011	71%

* "Relevance" merely indicates the search engine's score for a document. It is based on the search parameters and information in the document's detailed record.

View All Publications

Current Publications

NIST Series Pubs
- Final Pubs
- Drafts Open for Comment
- Drafts (all)
- View By Series
  - FIPS (standards)
  - SP 800 (guidance)
  - SP 1800 (practice guides)
  - SP (all subseries)
  - IR (interagency/internal reports)
  - CSWP (cybersecurity white papers)
  - ITL Bulletins
Other Pubs