prošireni sažetak izlaganja sa skupa
Since their introduction by Rothaus in 1976, bent functions played an important role in the security of cryptographic systems. As functions which have a maximum Hamming distance from the set of affine functions, they are extensively used to achieve nonlinearity of S-boxes for block and stream ciphers. While the theory behind bent functions is substantially developed, their enumeration is difficult even for a small number of variables (listed for n ≤ 6). Bent functions are rare and they are found by sieving on a large number of prospective Boolean functions or constructed by various methods, such as the iterative Maiorana- McFarland method. This work observes the use of the novel sieving technique based on the Binary Decision Diagram (BDD) representation of Boolean functions.
Bent functions; Binary Decision Diagrams; Cryptography
Razvojem virtualizacijskih tehnologija raste kompleksnost IT sustava, dok korisnici istovremeno zahtijevaju brži pristup resursima, napredne integracije i jednostavnost korištenja. Jedno od ključnih rješenja za ove izazove primjena je…
Ovaj rad istražuje i uspoređuje mogućnosti prosljeđivanja grafičkih kartica na Hyper-V i KVM hipervizorima prema virtualnim strojevima, detaljno opisujući metode, postupke i razlike u arhitekturi koje utječu na…
The ever-growing usage and adaptation of HTTP/3 in web traffic leverages Quick UDP Internet Connections (QUIC) as a transport protocol. QUIC is widely recognized for reduced latency, enhanced…
