Skip to main content
SpringerLink
Log in

Fast substitution-box evaluation algorithm and its efficient masking scheme for block ciphers

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Conclusion

The computing-complexity (in terms of XOR, non-linear multiplication over GF(2n), and LUT access) is reduced by approximately 62.5% compared with the existing schemes. Therefore, the proposed scheme has the lowest complexity compared to existing higher-order masking schemes. Furthermore, the proposed algorithm is a general method to evaluate the inverse over GF(2n), and thus it is suitable for every block cipher constructed with inverse functions and affine transformations, e.g., SM4 and Camellia.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Kocher P, Jaffe J, Jun B. Differential power analysis. In: Proceedings of Annual International Cryptology Conference, 1999. 388–397

  2. Carlet C, Prouff E. Polynomial evaluation and side channel analysis. In: The New Codebreakers. Berlin: Springer 2016. 315–341

    Chapter  Google Scholar 

  3. Childs L N. Part II congruence classes and rings. In: A Concrete Introduction to Higher Algebra. 3rd ed. Berlin: Springer, 2009. 93–123

    Chapter  Google Scholar 

  4. Ishai Y, Sahai A, Wagner D. Private circuits, securing hardware against probing attacks. In: Proceedings of the 23rd Annual International Cryptology Conference, 2003. 463–481

  5. Huang H, Liu L L, Huang Q H et al. Low area-overhead low-entropy masking scheme (LEMS) against correlation power analysis attack. IEEE Trans Comput-Aided Des Integr Circ Syst, 2019, 38: 208–219

    Article  Google Scholar 

  6. Grosso V, Prouff E, Standaert F-X. Efficient masked s-boxes processing a step forward. In: Proceedings of the 7th International Conference on Cryptology in Africa, 2014. 251–266

  7. Rivain M, Prouff E. Provably secure higher-order masking of AES. In: Proceedings of Workshop Cryptographic Hardware and Embedded Systems (CHES’10), 2010. 413–427

  8. Carlet C, Goubin L, Prouff E, et al. Higher-order masking schemes for S-Boxes. In: Proceedings of Workshop Fast Software Encryption (FSE’12), 2012. 366–384

  9. Coron J-S, Kizhvatov I, Roy A, et al. Analysis and improvement of the generic higher-order masking scheme of FSE 2012. In: Proceedings of Workshop Cryptographic Hardware and Embedded Systems (CHES’13), 2013. 417–434

Download references

Acknowledgements

This work was supported by Optoelectronics and Microelectronic Devices and Integration of National Key R&D Program of China (Grant No. 2018YFB2202100) and Heilongjiang Provincial Natural Science Foundation of China (Grant No. YQ2019F010).

Author information

Authors and Affiliations

  1. Institute of Microelectronics, Tsinghua University, Beijing, 100084, China

    Hai Huang, Leibo Liu, Min Zhu, Shouyi Yin & Shaojun Wei

  2. Harbin University of Science and Technology, Harbin, 150080, China

    Hai Huang

Authors
  1. Hai Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leibo Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Min Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shouyi Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shaojun Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leibo Liu.

Supplementary File

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, H., Liu, L., Zhu, M. et al. Fast substitution-box evaluation algorithm and its efficient masking scheme for block ciphers. Sci. China Inf. Sci. 64, 189402 (2021). https://doi.org/10.1007/s11432-020-3089-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-020-3089-9

Search

Navigation