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.

Journal Article

Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2)

Published: September 1, 2018
Citation: Information Processing Letters vol. 137, (September 2018) pp. 1-5

Author(s)

Andrea Viscontia (University of Milano), Chiara Schiavo (University of Milano), Rene Peralta (NIST)

Abstract

Keywords

gate complexity; linear systems; dense matrices; XOR gates; cryptography
Control Families

None selected

Documentation

Publication:
https://doi.org/10.1016/j.ipl.2018.04.010

Supplemental Material:
Article
Article (PubReader)

Document History:
09/01/18: Journal Article (Final)

Topics

Security and Privacy

cryptography

Technologies

circuits, complexity