Practical approach in evaluating the resistance of stream ciphers against algebraic attacks

Stream ciphers are the oldest technique in cryptography subject and still applicable in the modern era as it provides better speed and accuracy during encryption decryption process. It is also easy to be abuse and breakable if the algorithm is not designed properly because its key generator was cons...

Full description

Saved in:

Bibliographic Details
Main Author:	Jantan, Mohd. Faidzal
Format:	Thesis
Language:	English
Published:	2010
Subjects:	QA75 Electronic computers Computer science
Online Access:	http://eprints.utm.my/id/eprint/12068/1/MohdFaidzalJantanMFSKSM2010.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.12068
record_format	uketd_dc
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA75 Electronic computers Computer science
spellingShingle	QA75 Electronic computers Computer science Jantan, Mohd. Faidzal Practical approach in evaluating the resistance of stream ciphers against algebraic attacks
description	Stream ciphers are the oldest technique in cryptography subject and still applicable in the modern era as it provides better speed and accuracy during encryption decryption process. It is also easy to be abuse and breakable if the algorithm is not designed properly because its key generator was constructed based on Boolean function which normally using Line Feedback Shift Register technique. Together with secret key, it will generate key stream bit that will be used to encrypt the plaintext into cipher text. Far from that, Algebraic Attacks and Fast Algebraic Attack has become popular among cryptographers as the nature of the attack was to recover the secret key by solving or decomposing the Boolean function that constructed the cryptosystems. This study mainly is to provide a practical way or approach on how to evaluate the resistance of stream ciphers against these two types of attack. As all of us know that cryptography always involve complex discrete arithmetic by nature. As a result, we as non-mathematician computer scientist or information systems practitioner practically leave any cryptographic problems to the mathematician to evaluate and observe the cryptosystems they want to implement. Hence, this case study has also presented some practical method on how to construct an evaluation capability from mathematical formulas designed by mathematician cryptographers. The prototype solution was built using Microsoft Visual Studio VB.Net 2008 and the simulation testing was successfully done and shows similar result when we compare with cryptanalysis report produced by cryptographers.
format	Thesis
qualification_level	Master's degree
author	Jantan, Mohd. Faidzal
author_facet	Jantan, Mohd. Faidzal
author_sort	Jantan, Mohd. Faidzal
title	Practical approach in evaluating the resistance of stream ciphers against algebraic attacks
title_short	Practical approach in evaluating the resistance of stream ciphers against algebraic attacks
title_full	Practical approach in evaluating the resistance of stream ciphers against algebraic attacks
title_fullStr	Practical approach in evaluating the resistance of stream ciphers against algebraic attacks
title_full_unstemmed	Practical approach in evaluating the resistance of stream ciphers against algebraic attacks
title_sort	practical approach in evaluating the resistance of stream ciphers against algebraic attacks
granting_institution	Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems
granting_department	Faculty of Computer Science and Information System
publishDate	2010
url	http://eprints.utm.my/id/eprint/12068/1/MohdFaidzalJantanMFSKSM2010.pdf
_version_	1747814892988006400
spelling	my-utm-ep.120682018-05-30T04:27:15Z Practical approach in evaluating the resistance of stream ciphers against algebraic attacks 2010-04 Jantan, Mohd. Faidzal QA75 Electronic computers. Computer science Stream ciphers are the oldest technique in cryptography subject and still applicable in the modern era as it provides better speed and accuracy during encryption decryption process. It is also easy to be abuse and breakable if the algorithm is not designed properly because its key generator was constructed based on Boolean function which normally using Line Feedback Shift Register technique. Together with secret key, it will generate key stream bit that will be used to encrypt the plaintext into cipher text. Far from that, Algebraic Attacks and Fast Algebraic Attack has become popular among cryptographers as the nature of the attack was to recover the secret key by solving or decomposing the Boolean function that constructed the cryptosystems. This study mainly is to provide a practical way or approach on how to evaluate the resistance of stream ciphers against these two types of attack. As all of us know that cryptography always involve complex discrete arithmetic by nature. As a result, we as non-mathematician computer scientist or information systems practitioner practically leave any cryptographic problems to the mathematician to evaluate and observe the cryptosystems they want to implement. Hence, this case study has also presented some practical method on how to construct an evaluation capability from mathematical formulas designed by mathematician cryptographers. The prototype solution was built using Microsoft Visual Studio VB.Net 2008 and the simulation testing was successfully done and shows similar result when we compare with cryptanalysis report produced by cryptographers. 2010-04 Thesis http://eprints.utm.my/id/eprint/12068/ http://eprints.utm.my/id/eprint/12068/1/MohdFaidzalJantanMFSKSM2010.pdf application/pdf en public masters Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems Faculty of Computer Science and Information System 1. F. Armknect. Algebraic Attacks on Stream Ciphers. European Congress on Computational Methods in Applied Sciences and Engineering. 24-28th July 2004. 2. Braeken, J. Lano, B. Preneel. Evaluating the Resistance of Stream Ciphers. ACISP 2006, Lecture Notes in Computer Science 4058, page 40-51, 2006. 3. Maximov. Some words on Cryptanalysis of Stream Ciphers. PhD Thesis, Lund University, June 2006. 4. J. Lano. Cryptanalysis and Design of Synchronous Stream Ciphers. PhD Thesis, Khatolieke Universitiet Leuven, June 2006. 5. Deepak Kumar Dalai. On some necessary Conditions of Boolean Functions to Resist Algebraic Attacks. PhD Thesis, Indian Statistical Institute. August 2006. 6. Willi Meier, Enes Pasalic, and Claude Carlet. Algebraic Attacks and Decomposition of Boolean Functions. C. Cachin and J. Camenisch (Eds.): EUROCRYPT 2004, LNCS 3027, pp. 474–491. 7. Frederik Armknecht, Claude Carlet, Philippe Gaborit, Simon Kunzli, Willi Meier, and Olivier Ruatta. E cient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks. 8. V. Strassen. Gaussian Elimination is not Optimal. Numerical Mathematics, Vol. 13 (1969), pp. 354-356. 9. P. Hawkes and G. Rose. Rewriting variables: The complexity of fast algebraic attacks on stream ciphers. In M. Franklin, editor, Crypto 2004, volume 3152 of Lecture Notes in Computer Science, pages 390–406. Springer-Verlag, 2004. 10. N. Courtois and W. Meier. Algebraic attacks on stream ciphers with linear feedback. In Advances in Cryptology—EUROCRYPT 2003, volume LNCS 2656, pages 346–359. Springer-Verlag, 2003. Also available at http://www.cryptosystem.net/stream/, 2003. 11. eSTREAM Project details is available at http://www.ecrypt.eu.org/stream 12. Y. Nawaz and G. Gong. The WG stream cipher. eSTREAM, ECRYPT Stream Cipher Project, Report 2005/033, 2005. http://www.ecrypt.eu.org/stream. 13. M. R Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Bell Telephone Laboratories Inc. 1979. 6-7. 14. Y. Nawaz, G. Gong and K. C. Gupta. Upper Bounds on Algebraic Immunity of Boolean Power Functions. M.J.B. Robshaw (Ed.): FSE 2006, LNCS 4047, pp. 375–389, 2006.

Practical approach in evaluating the resistance of stream ciphers against algebraic attacks

Similar Items