Armknecht, F., Brandeis, J. and Ilinykh, E. (2006). Experimental Results on Algebraic Attacks on Stream Ciphers.
In , Sicherheit 2006 : Haupttagung “Sicherheit – Schutz und Zuverlässigkeit”; Workshop “Qualifizierte elektronische Signaturen in Theorie und Praxis” (QSIG 2006); Otto-von-Guericke-Universität Magdeburg, 20. – 22. Februar 2006 (S. 279–282). GI-Edition : Lecture Notes in Informatics. Proceedings,
Ges. für Informatik: Bonn.
Armknecht, F., Carlet, C., Gaborit, P., Künzli, S., Meier, W. and Ruatta, O. (2006). Efficient computation of algebraic immunity for algebraic and fast algebraic attacks.
In , Advances in cryptology – EUROCRYPT 2006 : 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 – June 1, 2006; proceedings (S. 147–164). Lecture Notes in Computer Science,
Springer: Berlin [u.a.].
Armknecht, F., Girão, J., Stoecklin, M. and Westhoff, D. (2006). Re-visited: Denial of service resilient access control for wireless sensor networks.
In , Security and privacy in ad-hoc and sensor networks : third European workshop, ESAS 2006, Hamburg, Germany, September 20 – 21, 2006 ; revised selected papers (S. 18–31). Lecture Notes in Computer Science,
Springer: Berlin [u.a.].
Armknecht, F. and Krause, M. (2006). Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity.
In , Automata, languages and programming : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10 – 14, 2006; proceedings (S. 180–191). Automata, languages and programming : 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10 – 14, 2006; proceedings,
Springer: Berlin [u.a.].
Krause, M., van Melkebeek, D., Pudlák, P. and Reischuk, R. (2006). Executive Summary of the Dagstuhl Seminar 06111 “Complexity of Boolean Functions”.
In , Complexity of Boolean functions : Dagstuhl Seminar 06111, 12.03 – 17.03.2006 (S. 1–5). Dagstuhl Seminar Proceedings,
Internationales Begegnungs- und Forschungszentrum für Informatik: Wadern.
Krause, M., Pudlák, P., Reischuk, R. and van Melkebeek, D. (2006). Abstracts collection – Complexity of Boolean functions.
In , Complexity of Boolean functions : Dagstuhl Seminar 06111, 12.03. – 17.03.2006 (S. 1). Dagstuhl Seminar Proceedings,
Internationales Begegnungs- und Forschungszentrum für Informatik: Wadern.
Krause, M. and Stegemann, D. (2006). Reducing the Space Complexity of BDD-based Attacks on Keystream Generators.
In , Fast software encryption : 13th International Workshop, FSE 2006; Graz, Austria, March 15 – 17, 2006; revised selected papers (S. 163–178). Fast Software Encryption : 13th International Workshop, FSE 2006; Graz, Austria, March 15 – 17, 2006; revised selected papers,
Springer: Berlin [u.a.].
In order to improve performance and enhance the user experience for the visitors to our website, we use cookies and store anonymous usage data. For more information please read our privacy policy.