×

Complementary dual codes for counter-measures to side-channel attacks. (English) Zbl 1398.94209

Pinto, Raquel (ed.) et al., Coding theory and applications. 4th international castle meeting, ICMCTA, Palmela Castle, Portugal, September 15–18, 2014. Cham: Springer (ISBN 978-3-319-17295-8/hbk; 978-3-319-17296-5/ebook). CIM Series in Mathematical Sciences 3, 97-105 (2015).
Summary: We recall why linear codes with complementary duals (LCD codes) play a role in counter-measures to passive and active side-channel analyses on embedded cryptosystems. The rate and the minimum distance of such LCD codes must be as large as possible. We investigate constructions.
For the entire collection see [Zbl 1325.94010].

MSC:

94B05 Linear codes (general theory)
94B15 Cyclic codes
94A60 Cryptography
Full Text: DOI

References:

[1] Augot, D.; Sendrier, N., Idempotents and the BCH bound, IEEE Trans. Inf. Theory, 40, 1, 204-207 (1994) · Zbl 0802.94019 · doi:10.1109/18.272483
[2] Bhasin, S., Danger, J.-L., Guilley, S., Najm, Z.: A low-entropy first-degree secure provable masking scheme for resource-constrained devices. In: Proceedings of the Workshop on Embedded Systems Security, WESS’13, New York, 29 Sept 2013, pp. 7:1-7:10. ACM, Montreal. doi:10.1145/2527317.2527324
[3] Bringer, J., Carlet, C., Chabanne, H., Guilley, S., Maghrebi, H.: Orthogonal direct sum masking – a smartcard friendly computation paradigm in a code, with builtin protection against side-channel and fault attacks. In: WISTP, Heraklion, June 2014. Volume 8501 of LNCS, pp. 40-56. Springer (2014)
[4] Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257-397. Cambridge University Press, Cambridge (2010). Preliminary version available at: http://www.math.univ-paris13.fr/ carlet/chap-fcts-Bool-corr.pdf · Zbl 1209.94035
[5] Carlet, C.: Correlation-immune boolean functions for leakage squeezing and rotating s-box masking against side channel attacks. In: Gierlichs, B., Guilley, S., Mukhopadhyay, D. (eds.) SPACE, Kharagpur, 19th - 23rd October 2013 Volume 8204 of Lecture Notes in Computer Science, pp. 70-74. Springer (2013) · Zbl 1355.94050
[6] Chen, B.; Dinh, H. Q.; Liu, H., Repeated-root constacyclic codes of length 2ℓ^mp^n, Finite Fields and Their Applications Volume, 33, 137-159 (2015) · Zbl 1368.11133 · doi:10.1016/j.ffa.2014.11.006
[7] Etesami, J., Hu, F., Henkel, W.: LCD codes and iterative decoding by projections, a first step towards an intuitive description of iterative decoding. In: GLOBECOM, Houston, pp. 1-4. IEEE (2011)
[8] Grosso, V., Standaert, F.-X., Prouff, E.: low entropy masking schemes, revisited. In: Francillon, A., Rohatgi, P. (eds.) CARDIS, Berlin. Volume 8419 of LNCS, pp. 33-43. Springer (2013)
[9] MacWilliams, F. J.; Sloane, N. J.A., The Theory of Error-Correcting Codes (1977), Amsterdam: Elsevier, Amsterdam · Zbl 0369.94008
[10] Massey., J.L.: Linear codes with complementary duals. Discret. Math. 106-107, 337-342 (1992) · Zbl 0754.94009
[11] Sendrier, N., Linear codes with complementary duals meet the Gilbert-Varshamov bound, Discret. Math., 285, 345-347 (2004) · Zbl 1048.94017 · doi:10.1016/j.disc.2004.05.005
[12] van Lint, J. H.; MacWilliams, F. J., Generalized quadratic residue codes, IEEE Trans. Inf. Theory, 24, 6, 730-737 (1978) · Zbl 0395.94025 · doi:10.1109/TIT.1978.1055965
[13] Vasantha Kandasamy, W.B., Smarandache, F., Sujatha, R., Raja Durai, R.S.: Erasure Techniques in MRD Codes. 28 Apr 2012. ISBN-10:1599731770, ISBN-13:978-1599731773 · Zbl 1253.94003
[14] Ward, H. N.; Pless, V. S.; Huffman, W. C., Quadratic residue codes and divisibility, Handbook of Coding Theory, 827-870 (1998), Amsterdam/New York: Elsevier Science, Amsterdam/New York · Zbl 0922.94012
[15] Yang, X.; Massey, J. L., The condition for a cyclic code to have a complementary dual, Discret. Math., 126, 1, 391-393 (1994) · Zbl 0790.94022 · doi:10.1016/0012-365X(94)90283-6
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.