Technical Program

Paper Detail

Paper IDP.2.1
Paper Title Rank Preserving Code-based Signature
Authors Terry Shue Chien Lau, Chik How Tan, National University of Singapore, Singapore
Session P.2: Cryptography
Presentation Lecture
Track Cryptography, Security and Privacy
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract We propose a rank metric code-based signature scheme constructed via the Schnorr approach. We define a new problem in rank metric coding theory, namely the Rank Vector Decomposition problem and analyze its solving complexity. The hardness of our signature scheme is based on the Rank Syndrome Decoding problem, Rank Support Basis Decomposition problem and Rank Vector Decomposition problem. We also give detailed analysis for the structural security of our signature scheme. Then, we provide parameters for our constructed signature scheme and compare our scheme with other existing secure rank metric signature schemes. Our signature scheme requires only public key size of 510 bytes and signature size of 3.10 kilobytes for 128-bit security level.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!