A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation

@article{Pasalic2011ADO,
  title={A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation},
  author={Enes Pasalic},
  journal={Cryptography and Communications},
  year={2011},
  volume={4},
  pages={25-45}
}
In this paper the possibilities of an iterative concatenation method towards construction of Boolean functions resistant to algebraic cryptanalysis are investigated. The notion of $\mathcal{AAR}$ (Algebraic Attack Resistant) function is introduced as a unified measure of protection against classical algebraic attacks as well as fast algebraic attacks. Then, it is shown that functions that posses the highest resistance to fast algebraic attacks are necessarily of maximum algebraic immunity, thus… CONTINUE READING
4 Citations
33 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Cryptographic properties of Boolean functions and S-boxes

  • A. Braeken
  • Ph.D. thesis, Katholieke Universiteit Leuven…
  • 2006
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…