2007 · 83 citations · 8 references
ComputingComputer EngineeringComputer ScienceComputer SecurityCryptographySecurity ProtocolsAuthenticated EncryptionClassical CryptographyCode-based CryptographyCryptographic Protocol DesignDigital SignaturesPublic Key AuthenticationCode SigningLightweight Cryptographic ProtocolsLightweight CryptographyLightweight Encryption ProtocolsRsa CryptosystemSignature Scheme ConstructionsSignature SchemesSignature Size Optimization
We revisit the code-based identification protocol proposed by Stern at Crypto'93, and give evidence that the size of public keys can be dramatically reduced while preserving a high and well-understood level of security. More precisely, the public keys can be made even shorter than RSA ones (typically 347 bits), while their size is around 150 Kbits in the original scheme. This is achieved by using matrices which are double circulant, rather than purely random. On the whole, this provides a very practical identification (and possibly signature) scheme which is mostly attractive for light-weight cryptography.
8
Some results on quasi-cyclic codes
C.L. Chen, W. W. Peterson, Edward Weldon · Information and Control · 1969 · 159 citations