Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 1997: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp 321–328Cite as

Some results on regular mappings

  • Conference paper
  • First Online:

  • 135 Accesses

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

Abstract

Several results about regular mappings are presented in connection with the associated substitution S-box. A characterization of regular mappings is given and an upper bound for the ∈-robustness of the S-box against differential cryptanalysis is provided.

The authors would like to thank the referees for their suggestions which greatly improved the presentation of this paper.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beth, T., and Ding, C. On permutations against differential cryptanalysis. In Advances in Cryptology — EUROCRYPT'93, Springer-Verlag, New York (1993).

    Google Scholar 

  2. Biham, E., and Shamir, A. Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, New York (1993).

    Google Scholar 

  3. Biham, E., and Shamir, A. Differential Cryptanalysis of DES-like cryptosystems. Journal of Cryptology Vol. 4, No. 1 (1993) 3–72.

    Google Scholar 

  4. Detombe, J. and Tavares, S. Constructing large cryptographically strong S-boxes. Advances in Cryptology — AUSCRYPT'92, Springer-Verlag, New York (1993).

    Google Scholar 

  5. Lidl, R., and Niederreiter, H. Finite Fiels, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, (1983).

    Google Scholar 

  6. Matsui, M. Linear cryptanalysis method for DES cipher. Abstracts of EUROCRYP-T'93, May (1993).

    Google Scholar 

  7. Seberry, J., Zhang, X. M., and Zheng, Y. Systematic generation of cryptographically robust S-boxes. In Proceedings of the firts ACM Conference on Computer and Communications Security, The Association for Computing Machinery, New York (1993) 172–182.

    Google Scholar 

  8. Seberry, J., Zhang, X. M., and Zheng, Y. Pitfalls in Designing Sustitution Boxes. Preprint (1994).

    Google Scholar 

  9. Seberry, J., Zhang, X. M., and Zheng, Y. Relationships among nonlinearity criteria. Submitted to EUROCRYPT'94, (1994).

    Google Scholar 

  10. Seberry, J., Zhang, X. M., and Zheng, Y. Remarks on S-boxes based on permutation polynomials. In Advances in Cryptology — Crypto'94 (1994).

    Google Scholar 

  11. Webster, A. F., and Tavares, S. E. On the designs of S-boxes. In Advances in Cryptology — Crypto'85, vol. 219, Lecture Notes in Computer Science, Springer-Verlag, New York, (1986) 523–534.

    Google Scholar 

  12. Zhang, X. M., and Zheng, Y. Relationships Between Differential and Other Cryptographic Characteristics of an S-box, Preprint, May (1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas, Universidad Autönoma Metropolitana-I, 09340, Mexico D.F., Mexico

    H. Tapia-Recillas

  2. Direcciön General de Servicios de Cómputo Académico, Universidad Nacional Autönoma de México, 20059, México D.F., Mexico

    G. Vega & E. Daltabuit

Authors
  1. H. Tapia-Recillas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Vega
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. Daltabuit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Teo Mora Harold Mattson

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tapia-Recillas, H., Vega, G., Daltabuit, E. (1997). Some results on regular mappings. In: Mora, T., Mattson, H. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1997. Lecture Notes in Computer Science, vol 1255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63163-1_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-63163-1_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63163-7

  • Online ISBN: 978-3-540-69193-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation