This paper presents the main cryptographic properties of Boolean functions, which play a crucial role in the design of modern cryptographic algorithms. The study includes representations such as truth tables and algebraic normal forms. Special focus is given to analyzing essential properties including balancedness, nonlinearity, correlation immunity, resiliency, and the avalanche e_ect. A detailed case analysis of a sample Boolean function illustrates the impact of these properties on resistance to cryptanalytic attacks. The results highlight the importance of achieving a balance between di_erent properties in the construction of secure Boolean functions.
📖 افتح في inklap 🔗 DOI 📮 اطلب بحثاً