Cryptology ePrint Archive: Report 2017/236

A new rank metric codes based encryption scheme

Pierre Loidreau

Abstract: We design a new McEliece-like rank metric based encryption scheme from Gabidulin codes. We explain why it is not affected by the invariant subspace attacks also known as Overbeck's attacks. The idea of the design mixes two existing approaches designing rank metric based encryption schemes. For a given security our public-keys are more compact than for the same security in the Hamming metric based settings.

Category / Keywords: public-key cryptography / McEliece encryption scheme, code based cryptography

Date: received 9 Mar 2017

Contact author: Pierre Loidreau at m4x org

Available format(s): PDF | BibTeX Citation

Version: 20170311:144514 (All versions of this report)

Short URL: ia.cr/2017/236

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]