Skip to main content
SpringerLink
Log in

On MARS’s s-boxes Strength against Linear Cryptanalysis

  • Conference paper
  • First Online:
Computational Science and Its Applications — ICCSA 2003 (ICCSA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2669))

Included in the following conference series:

  • 1468 Accesses

Abstract

MARS’s s-boxes were generated using a new algorithm developed by the IBM team, which was supposedly able of producing secure s-boxes against both differential and linear cryptanalysis. In this paper we show this is not the case, because their strength against linear cryptanalysis is not better (in fact, it seems to be worse) that what could be expected if generated randomly.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burwick, C., Coppersmith, D., D’Avignon, E., Gennaro, R., Halevi, S., Jutla, C., Matyas, S., O’ Connor, L., Peyravian, M., Safford, D., Zunic, N.: MARS-a candidate cipher for AES. Proceedings of the First AES Conference (1999). Revised September 22, 1999

    Google Scholar 

  2. Burnett, L., Carter, G., Dawson, E., Millan, W.: Efficient Methods for generating MARS like S-boxes. Proceedings of the Fast Software Encryption 2000 (FSE’2000

    Google Scholar 

  3. Robshaw, M., Yin, Y.L.: Potential flaws in the conjectured resistance of MARS to linear cryptanalysis: Proceedings of the 3rd AES Conference

    Google Scholar 

  4. Knudsen, L., Raddum, H.: Linear Approximation to the MARS S-box. NESSIE Deliverable, April 2000

    Google Scholar 

  5. Aoki, K.: The Complete Distribution of Linear Probabilites of MARS’s s-box. Cryptology e-print no 33, June 30, 2000

    Google Scholar 

  6. Millan, W., Clark, A., Dawson, E.: Boolean Function Desing using Hill-Climbing Methods. Proceedings of the Symposium on Applied Cryptography (SAC’97). LNCS 1587

    Google Scholar 

  7. Millan, W., Burnett, G., Carter, G., Clark, A., Dawson, E.: Evolutionary Heuristics for finding Cryptographically strong s-boxes. Proceedings of the Information and Communication Security, Second International Conference, ICICS’99, Sydney, Australia, November 9-11, 1999. Lecture Notes in Computer Science 1726

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Servicio Informático de Gestión, Complutense University, Madrid, Spain

    Carlos Javier Hernández Castro

  2. Departamento de Sistemas Informáticos y Programación, Facultad de Informática, Complutense University, Madrid, Spain

    Luis Javier García Villalba

  3. Computer Security Group, Computer Science Department, Carlos III University, 28911, Leganés, Madrid, Spain

    Julio César Hernández Castro & José María Sierra Cámara

Authors
  1. Carlos Javier Hernández Castro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis Javier García Villalba
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Julio César Hernández Castro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. José María Sierra Cámara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Army High Performance Computing Research Center, USA University of Minessota Department of Computer Science and Engineering, MN, 55455, USA

    Vipin Kumar

  2. Department of Computer Science, University of Calgary, Calgary, AB, T2N1N4, Canada

    Marina L. Gavrilova

  3. Heuchera Technologies Inc., 122 9251-8Yonge Street, Richmond Hill, ON, Canada, L4C 9T3

    Chih Jeng Kenneth Tan

  4. School of Computer Science, The Queen’s University of Belfast, Belfast, BT7 1NN, Northern Ireland UK

    Chih Jeng Kenneth Tan

  5. Département d’informatique et de recherche opérationelle Montréal, Université de Montréal, Québec, H3C 3J7, Canada

    Pierre L’Ecuyer

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castro, C.J.H., Villalba, L.J.G., Castro, J.C.H., Cámara, J.M.S. (2003). On MARS’s s-boxes Strength against Linear Cryptanalysis. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-44842-X_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40156-8

  • Online ISBN: 978-3-540-44842-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation