Evolving Cryptographic Boolean Functions with Minimal Multiplicative Complexity

Author(s):  
Jakub Husa ◽  
Lukas Sekanina
2018 ◽  
Vol 11 (1) ◽  
pp. 93-107 ◽  
Author(s):  
Çağdaş Çalık ◽  
Meltem Sönmez Turan ◽  
René Peralta

Author(s):  
Magnus Gausdal Find ◽  
Meltem Sönmez Turan ◽  
Daniel Smith Tone

2015 ◽  
Vol 25 (2) ◽  
Author(s):  
Svetlana N. Selezneva

AbstractThe multiplicative (or conjunctive) complexity of a Boolean function f(x


2000 ◽  
Vol 235 (1) ◽  
pp. 43-57 ◽  
Author(s):  
Joan Boyar ◽  
René Peralta ◽  
Denis Pochuev

2017 ◽  
Vol 4 (4) ◽  
pp. 222 ◽  
Author(s):  
Magnus Gausdal Find ◽  
Daniel Smith Tone ◽  
Meltem Sönmez Turan

2019 ◽  
Vol 11 (6) ◽  
pp. 1339-1362 ◽  
Author(s):  
Luís T. A. N. Brandão ◽  
Çağdaş Çalık ◽  
Meltem Sönmez Turan ◽  
René Peralta

2016 ◽  
Vol 145 (3) ◽  
pp. 399-404
Author(s):  
Svetlana N. Selezneva

Sign in / Sign up

Export Citation Format

Share Document