Determining Affine and Extended Affine Equivalence of Boolean Functions with SAT [July 3, 2020]

 Summary

by Luis Moraes and Rakesh Verma presented by Luis Moraes for the 11th Pragmatics of SAT International workshop (http://www.pragmaticsofsat.org/2020/)

Many cryptographically desirable properties of Boolean functions are preserved by affine and extended affine equivalence. Thus, being able to determine equivalence between Boolean functions efficiently is useful in cryptography. We present an encoding of affine and extended affine equivalence into SAT. We experiment with different encodings and demonstrate how implicit constraints affect performance. In addition, we draw parallels between known algorithms and these encodings.

 Infos

Added by :
Daniel Le Berre

Updated on :
July 4, 2020, 11:55 a.m.

Duration :
00:23:15

Number of view :
2 (Show details views)

Type :
Other

Main language :
English

 Downloads
 Embed/Share (Draft Mode)
Please note that your video is in draft mode.
The following links contain a key allowing access. Anyone with this links can access it.
Check the box to autoplay the video.
Check the box to loop the video.
Check the box to indicate the beginning of playing desired.
qrcode