Progress in cryptology

Více o knize

This work covers a range of topics in cryptography, including invited talks on Abelian varieties and their applications. It discusses sequences and presents a proof related to the joint linear complexity profile of multisequences. The period of the stream cipher Edon80 is analyzed alongside Boolean functions and S-boxes, focusing on the algebraic immunity of symmetric Boolean functions and the properties of highly nonlinear S-boxes against DPA attacks. The construction of universal one-way hash functions and optimal double-length hash functions is explored, alongside design principles for algorithms solving differential equations and combiners with memory. Cryptanalysis is addressed through various methods, including attacks on the quadratic generator and the F-FCSRs, as well as the cryptanalysis of the Barni watermarking scheme and vulnerabilities in Oleshchuk’s public key cryptosystem. New constructions are introduced, such as an optimal subset cover for broadcast encryption and a novel NTRU-based cryptosystem. The work also revisits the security of identity-based encryption schemes and presents short undeniable signatures without random oracles. Applications include attacks on asynchronous multi-party contract signing protocols and discussions on e-cash, featuring a universally composable scheme. Finally, implementations are examined, focusing on energy-privacy trade-offs in VLSI computations and efficient scalar multipli