Projects
Circuit Complexity
Circuit Complexity
Presentations
| Title / Presenter |
Type |
Date |
Poster: Additive and Multiplicative Complexities of Circuits
René Peralta
Presented at: NIST-ITL Science Day 2021 (October 28) --- Presentation by video-conference
Poster jointly produced by Luís Brandão and Meltem Sönmez Turan
|
Poster |
10/28/2021 |
Multiplicative Complexity of Boolean Functions
Meltem Sönmez Turan
Presented at:
Talk at the WPI ECE Graduate Seminar
|
Presentation |
03/17/2021 |
NIST Circuit Complexity Benchmarking
Meltem Sönmez Turan
Presented at: NIST-ITL Virtual Science Day 2020 (October 29) -- Poster presentation over video-conference.
Joint work with Luís Brandão, Çağdaş Çalık, Morris Dworkin, René Peralta
|
Poster |
10/29/2020 |
Research Directions on the Complexity of Boolean Circuits for Codes and Cryptography
René Peralta
Presented at: June 17, 2019 @ BFA 2019 (Florence, Italy)
Joint work: Luís T. A. N. Brandão, Çağdaş Çalık, Meltem Sönmez Turan, Morris Dworkin, Nathan Dykas, René Peralta
|
Presentation |
06/17/2020 |
Optimizing Cryptographic Circuits
Luís T. A. N. Brandão
Çağdaş Çalık
Morris Dworkin
René Peralta
Meltem Sönmez Turan
Presented at: NIST-ITL Science Day 2019 (November 1) -- Poster presentation at NIST Gaithersburg Campus
|
Poster |
11/06/2019 |
Boolean Functions with Multiplicative Complexity 3 and 4
René Peralta
Presented at: June 20, 2019 @ BFA 2019 (Florence, Italy)
Joint work: Çağdaş Çalık, René Peralta, Meltem Sönmez Turan
Subsequent paper: ia.cr/2019/1364
|
Presentation |
06/20/2019 |
On the Multiplicative Complexity of Symmetric Boolean Functions
Luís T. A. N. Brandão
Presented at: June 19, 2018 @ BFA (Loen, Norway)
Joint work: Luís T. A. N. Brandão; Çağdaş Çalık; Meltem Sönmez Turan; René Peralta.
Subsequent paper: ia.cr/2019/708
|
Presentation |
06/19/2018 |
On the Multiplicative Complexity of 6-variable Boolean Functions
Meltem Sönmez Turan
Presented at: July 05, 2017 @ BFA (Os, Norway)
Joint work between: Çağdaş Çalık; Meltem Sönmez Turan; René Peralta.
Subsequent paper: ia.cr/2018/002
|
Presentation |
07/05/2017 |
Multiplicative Complexity of Boolean Functions
René Peralta
Meltem Sönmez Turan
Presented at: NIST-ITL Science Day 2014 (October 1) -- Poster presentation
|
Poster |
10/01/2014 |
Project Links
Additional Pages
Created December 29, 2016, Updated November 08, 2021
) or https:// don't prove our archive is authentic, only that you securely accessed it. Note that we are working to fix that :)
