U.S. flag   An unofficial archive of your favorite United States government website
Dot gov

Official websites do not use .rip
We are an unofficial archive, replace .rip by .gov in the URL to access the official website. Access our document index here.

Https

We are building a provable archive!
A lock (Dot gov) or https:// don't prove our archive is authentic, only that you securely accessed it. Note that we are working to fix that :)

This is an archive
(replace .gov by .rip)

Journal Article

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

Published: September 01, 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:
Journal Article (DOI)

Supplemental Material:
Article (other)
Article (PubReader) (other)

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

Topics

Security and Privacy
cryptography

Technologies
circuits; complexity