Chargement en cours...
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2)
Minimizing the Boolean circuit implementation of a given cryptographic function is an important issue. A number of papers [1], [2], [3], [4] only consider cancellation-free straight-line programs for producing small circuits over GF(2). Cancellation is allowed by the Boyar-Peralta (BP ) heuristic [5...
Enregistré dans:
| Publié dans: | Inf Process Lett |
|---|---|
| Auteurs principaux: | , , |
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
2018
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6463526/ https://ncbi.nlm.nih.gov/pubmed/30996399 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.ipl.2018.04.010 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|