Cargando...
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...
Guardado en:
| Publicado en: | Inf Process Lett |
|---|---|
| Autores principales: | , , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | 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 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|