Abstract
A new family of so called reducible rank codes, which are a generalization of rank product codes [8], is introduced. A McEliece type [1] public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler ‘mixes’ columns of a generator matrix of a code. It makes the system more resistant to structural attacks such as Gibson’s attacks [5, 6]. Possible attacks are studied. The possibility of using the system for combined error protection is investigated. The system is found to be secure against known attacks for public keys of about 10 kbits
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
R. J. McEliece, “A Public Key Cryptosystem Based on Algebraic Coding Theory,” JPL DSN Progress Rep. 42–44
E. M. Gabidulin, “Theory of Codes with Maximum Rank distance,” Probi. Inform. Transm., vol. 21 (1), pp. 1–12, July 1985.
E. M. Gabidulin, A.V. Paramonov, O.V. Tretjakov, “Ideals over a non-commutative ring and their application in cryptology,” advances in Cryptology, Proc. EUROCRYPT’ 91, LNCS 547, D. W. Davies, Ed. Springer-Verlag, 1991, pp. 482–489
E. M. Gabidulin, A. V. Ourivski, “Improved GPT public key cryptosystems,” Coding, Communications and Broadcasting, P. Farrell, M. Darnell, B. Honary, Eds., Research Studies Press, 2000, pp. 73–102.
J. K. Gibson, “Severely denting the Gabidulin version of McEliece public key cryptosystem,” Designs, Codes and Cryptography, vol. 6 (1), pp. 37–45, 1995
J. K. Gibson, “Algebraic coded cryptosystems, ” PhD. Thesis, University of London, Royal Holloway and Bedford New College, 1995.
F. Chabaud, J. Stern, “The cryptographic security of the syndrome decoding problem for rank distance codes,” Advances in Cryptology, Proc. ASL4CRYPT’96, LNCS, K. Kim, T. Matsumoto, Eds., Springer-Verlag, 1996, pp. 368–381.
E. M. Gabidulin, P. Loidreau, “Subfield subcodes of rank codes and applications,” Proc. 7-th Im. Workshop on Algebraic and Combinatorial Coding Theory ACCT’ 2000, June 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gabidulin, E.M., Ourivski, A., Ammar, B., Honary, B. (2002). Reducible Rank Codes and Applications to Cryptography. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds) Information, Coding and Mathematics. The Springer International Series in Engineering and Computer Science, vol 687. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3585-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3585-7_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5289-9
Online ISBN: 978-1-4757-3585-7
eBook Packages: Springer Book Archive