Abstract
Classic convolutional codes are defined as the convolution of a message and a transfer function over \(\mathbb {Z}\). In this paper, we study time-varying convolutional codes over a finite group G of the form \({\mathbb {Z}}/N{\mathbb {Z}} \rtimes {\mathbb {Z}}/M{\mathbb {Z}}\). The goal of this study is to design codes with cryptographic properties. To define a message u of length k over the group G, we choose a subset E of G that changes at each encoding, and we put \(u = \sum _i u_iE(i)\). These subsets E are generated chaotically by a dynamical system, walking from a starting point (x, y) on a space paved by rectangles, each rectangle representing an element of G. So each iteration of the dynamical system gives an element of the group which is saved on the current E. The encoding is done by a convolution product with a fixed transfer function. We have found a criterion to check whether an element in the group algebra can be used as a transfer function. The decoding process is realized by syndrome decoding. We have computed the minimum distance for the group \(G=\mathbb {Z}/7\mathbb {Z} \rtimes \mathbb {Z}/3\mathbb {Z}\). We found that it is slightly smaller than those of the best linear block codes. Nevertheless, our codes induce a symmetric cryptosystem whose key is the starting point (x, y) of the dynamical system. Consequently, these codes are a compromise between error correction and security.
Similar content being viewed by others
Notes
It is an additive law therefore it would be logical to denote it +, but as the + sign is used to represent the elements of the group algebra, we prefer to use \(\cdot \) to note the group law.
To compute \(\tau ^{-1}\), we compute the inverse Fourier transform of the vector composed by all the \((\widehat{\tau }(R_i))^{-1}\).
References
Devaney R.L.: An Introduction to Chaotic Dynamical Systems, 2nd edn. Addison-Wesley, Redwood City (1989).
Elias P.: Coding for two noisy channels. In: Information Theory, the 3rd London Symposium, pp. 61–76. Buttersworth’s Scientific Publications, London (1955).
Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http://www.codetables.de (2007). Accessed 21 July 2014.
Hatcher A.: Algebraic Topology. Cambridge University Press, Cambridge (2002).
Katz J., Lindell Y.: Introduction to Modern Cryptography. Chapman & Hall/CRC Cryptography and Network Security. Chapman & Hall/CRC, Boca Raton (2008).
Marazin M., Gautier R., Burel G.: Blind recovery of k/n rate convolutional encoders in a noisy environment. EURASIP J. Wirel. Commun. Netw. 2011, 168 (2011).
Moon T.K.: Convolutional codes. In: Error Correction Coding: Mathematical Methods and Algorithms, chap. 12, pp. 452–580. Wiley-Interscience, Hoboken (2005).
Neubauer A.: Convolutional codes. In: Coding Theory: Algorithms, Architectures and Applications, chap. 3, pp. 112–177. Wiley-Interscience, Hoboken (2007).
Terras A.: Fourier Analysis on Finite Groups and Applications. London Mathematical Society Student Texts 43. Cambridge University Press, Cambridge (1999).
Acknowledgments
The authors would like to thank the Region Bretagne (France) for its financial support.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by A. Winterhof.
Rights and permissions
About this article
Cite this article
Candau, M., Gautier, R. & Huisman, J. Convolutional block codes with cryptographic properties over the semi-direct product \({\mathbb {Z}}/N{\mathbb {Z}} \rtimes {\mathbb {Z}}/M{\mathbb {Z}}\) . Des. Codes Cryptogr. 80, 395–407 (2016). https://doi.org/10.1007/s10623-015-0101-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-015-0101-7