Abstract
In the past many coding schemes have been proposed to render arithmetic and logic units fault tolerant. However, most schemes are suited for safety rather than for security applications, i.e. they were not designed to protect against malicious fault injections. Even articles considering an adversary as the source of faults restrict the error-detection discussion to partial fault models.
In this article, we investigate the possibilities of an adversary to inject an undetected fault in different coding schemes. In contrast to other works, we analyze the interaction of erroneous operands and operations. Such an analysis yields quite different results than traditional evaluations. These new results show that each of the schemes has serious weaknesses and neither of them can guarantee a universal protection. Thus, a hybrid approach is favorable to counteract fault attacks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boneh, D., DeMillo, R.A., Lipton, R.J.: On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract). In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 37–51. Springer, Heidelberg (1997)
Oh, N., Shirvani, P.P., McCluskey, E.J.: Control-flow checking by software signatures. IEEE Transactions on Reliability 51, 111–122 (2002)
Kim, C.H., Quisquater, J.J.: Fault Attacks for CRT Based RSA: New Attacks, New Results, and New Countermeasures. In: Sauveron, D., Markantonakis, K., Bilas, A., Quisquater, J.-J. (eds.) WISTP 2007. LNCS, vol. 4462, pp. 215–228. Springer, Heidelberg (2007)
Dottax, E., Giraud, C., Rivain, M., Sierra, Y.: On Second-Order Fault Analysis Resistance for CRT-RSA Implementations. Cryptology ePrint Archive, Report 2009/024 (2009) The final version of this paper will be published in the proceedings of WISTP (2009)
Karri, R., Wu, K., Mishra, P., Kim, Y.: Concurrent Error Detection of Fault-Based Side-Channel Cryptanalysis of 128-Bit Symmetric Block Ciphers. In: Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, pp. 579–585. ACM, New York (2001)
Lenstra, A.K.: Memo on RSA Signature Generation in the Presence of Faults (1996), http://cm.bell-labs.com/who/akl/
Hamming, R.W.: Error Detecting and Error Correcting Codes. Bell System Technical Journal 29, 147–160 (1950)
Elliott, I., Sayers, I.: Implementation of 32-bit RISC processor incorporating hardware concurrent error detection and correction. In: Computers and Digital Techniques, IEE Proceedings E., vol. 137, pp. 88–102 (1990)
Nicolaidis, M.: Carry checking/parity prediction adders and ALUs. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 11, 121–128 (2003)
Berger, J.M.: A Note on Error Detection Codes for Asymmetric Channels. Information and Control 4, 68–73 (1961)
Lo, J.C., Thanawastien, S., Rao, T.R.N.: Concurrent error detection in arithmetic and logical operationsusing Berger codes. In: Proceedings of 9th Symposium on Computer Arithmetic (1989)
Kim, J., Rao, T., Feng, G., Lo, J.C.: The efficient design of a strongly fault-secure ALU using a reduced Berger code for WSI processor arrays. In: Proceedings of Fifth Annual IEEE International Conference on Wafer Scale Integration, pp. 163–172 (1993)
Russell, G., Maamar, A.: Check bit prediction scheme using Dong’s code for concurrent error detection in VLSI processors. In: IEE Proceedings of Computers and Digital Techniques, vol. 147, pp. 467–471 (2000)
Massey, J.L.: Survey of residue coding for arithmetic errors. ICC Bulletin 3, 195–209 (1964)
Mandelbaum, D.: Arithmetic codes with large distance. IEEE Transactions on Information Theory 13, 237–242 (1967)
Proudler, I.K.: Idempotent AN codes. In: IEE Colloquium on Signal Processing Applications of Finite Field Mathematics, London, UK, pp. 8/1–8/5. IEEE, Los Alamitos (1989)
Gaubatz, G., Sunar, B.: Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography. In: Breveglieri, L., Koren, I., Naccache, D., Seifert, J.-P. (eds.) FDTC 2006. LNCS, vol. 4236, pp. 196–210. Springer, Heidelberg (2006)
Rao, T.: Biresidue Error-Correcting Codes for Computer Arithmetic. IEEE Transactions on Computers C-19, 398–402 (1970)
Rao, T., Garcia, O.: Cyclic and multiresidue codes for arithmetic operations. IEEE Transactions on Information Theory 17, 85–91 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Medwed, M., Schmidt, JM. (2009). Coding Schemes for Arithmetic and Logic Operations - How Robust Are They?. In: Youm, H.Y., Yung, M. (eds) Information Security Applications. WISA 2009. Lecture Notes in Computer Science, vol 5932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10838-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-10838-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10837-2
Online ISBN: 978-3-642-10838-9
eBook Packages: Computer ScienceComputer Science (R0)