Skip to main content
SpringerLink
Log in

Cryptanalysis of Simplified-AES Using Intelligent Agent

  • Conference paper
  • First Online:
Hybrid Artificial Intelligent Systems (HAIS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9121))

Included in the following conference series:

  • 2084 Accesses

Abstract

Software agent technology is a rapidly developing area of research. In this paper, we introduce a new application of an agent system, called cryptanalytic-agent system whose behaviour will be intelligent enough to attack Simplified Advance Encryption Standard (S-AES) block cipher. Our results confirm the versatility of our proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The type of agent, that we focus on, is the autonomous, pro-active behaviour of a single agent, that is situated in a particular environment.

  2. 2.

    This form is used widely for describing SAT and MAXSAT problems.

  3. 3.

    These action rules give a new strategy for known plaintext attack of S-AES.

  4. 4.

    A mental state condition determines the states in which \(Act\) may be executed.

  5. 5.

    The bold components in column effect are the components that effected by the applied rule.

  6. 6.

    The symbol ? denotes that the key vector \(KV\) is undetermined.

  7. 7.

    The bold components in column fact base are the components that effected by the fired rule.

  8. 8.

    The function ‘Check-key’ used to check the key from an assign A with k in a model M2 to derive the model M2 is valid or not.

References

  1. Musa, M.A., Schaefer, E.R., Wedig, S.: A simplified AES algorithm and its linear and differential cryptanalyses. Cryptologia 27(2), 148–177 (2003)

    Article  Google Scholar 

  2. Daemen, J., Rijmen, V.: The Design of Rijndael: AES The Advanced Encryption Standard. Springer, Heidelberg (2002)

    Book  Google Scholar 

  3. Wooldridge, M.: An Introduction to MultiAgent Systems. 1 edn. John Wiley & Sons, Chichester (2002)

    Google Scholar 

  4. Wooldridge, M., jennings, N.R.: Intelligent agents: theory and practice. Knowl. Eng. Rev. 10(2), 115–152 (1995)

    Article  Google Scholar 

  5. Russel, S., Norving, P.: Artificial Intelligence-A Modern Approach, 2nd ED. Prentice Hall, Upper saddle river (2003)

    Google Scholar 

  6. Mansoori, S.D., Bizaki, H.K.: On the vulnerability of simplified aes algorithm against linear cryptanalysis. Int. J. Comp. Sci. Netw. Secur. 7(7), 257–263 (2007)

    Google Scholar 

  7. Simmons, S.: Algebraic cryptanalysis of simplified AES. Cryptologia 33(4), 305–314 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. Valarmathi, M.L., Vimalathithan, R.: Cryptanalysis of simplified-aes using particle swarm optimisation. Defence Sci. J. 62(2), 117–121 (2012)

    Article  Google Scholar 

  9. Forouzan, B.A.: Cryptography and Network Security. McGraw-Hill Company, Boston (2007)

    Google Scholar 

  10. Paar, C.: A new architecture for a parallel finite field multiplier with low complexity based on composite fields. IEEE Trans. Comput. 45(7), 856–861 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  11. Tseitin, G.S.: On the complexity of derivation in the propositional calculus. In Slisenko, A.O., (ed.) Studies in Constructive Mathematics and Mathematical Logic, Part II, pp. 115–125. Springer, New York (1970)

    Google Scholar 

  12. Christof, P., Fleischmann, P., Roelse, P.: Efficient multiplier architectures for galois fields. IEEE Trans. Comput. 47, 70–162 (1998)

    Google Scholar 

  13. Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the Third Annual ACM Symposium on the Theory of Computing, pp. 151–158. ACM (1971)

    Google Scholar 

  14. Biere, A., Heule, M., Van Maaren, H., Walsh, T.: Handbook of Satisfiability. IOS Press, Amsterdam (2009)

    MATH  Google Scholar 

  15. Hill, E.F.: Jess in Action: Java Rule-Based Systems. Manning Publications Co., Greenwich (2003)

    Google Scholar 

  16. Argelich, J., Li, C.-M., Manyà F., Planes, J.: The first and second Max-SAT evaluations. Journal on Satisfiability, Boolean Modeling and Computation 4, 251–278 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Subdivision, Faculty of Science, Ain Shams University, Cairo, Egypt

    Rania Saeed & Ashraf Bhery

Authors
  1. Rania Saeed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashraf Bhery
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rania Saeed .

Editor information

Editors and Affiliations

  1. University of Deusto, Bilbao, Spain

    Enrique Onieva

  2. University of Deusto, Bilbao, Spain

    Igor Santos

  3. University of Deusto, Bilbao, Spain

    Eneko Osaba

  4. Universidad de Salamanca, Salamanca, Spain

    Héctor Quintián

  5. Universidad de Salamanca, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Saeed, R., Bhery, A. (2015). Cryptanalysis of Simplified-AES Using Intelligent Agent. In: Onieva, E., Santos, I., Osaba, E., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2015. Lecture Notes in Computer Science(), vol 9121. Springer, Cham. https://doi.org/10.1007/978-3-319-19644-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19644-2_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19643-5

  • Online ISBN: 978-3-319-19644-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation