Small Private Key PKS on an Embedded Microprocessor

Multivariate quadratic ( ) cryptography requires the use of long public and private keys to ensure a sufficient security level, but this is not favorable to embedded systems, which have limited system resources. Recently, various approaches to cryptography using reduced public keys have been studied. As a result of this, at CHES2011 (Cryptographic Hardware and Embedded Systems, 2011), a small public key scheme, was proposed, and its feasible implementation on an embedded microprocessor was reported at CHES2012. However, the implementation of a small private key scheme was not reported. For efficient implementation, random number generators can contribute to reduce the key size, but the cost of using a random number generator is much more complex than computing on modern microprocessors. Therefore, no feasible results have been reported on embedded microprocessors. In this paper, we propose a feasible implementation on embedded microprocessors for a small private key scheme using a pseudo-random number generator and hash function based on a block-cipher exploiting a hardware Advanced Encryption Standard (AES) accelerator. To speed up the performance, we apply various implementation methods, including parallel computation, on-the-fly computation, optimized logarithm representation, vinegar monomials and assembly programming. The proposed method reduces the private key size by about 99.9% and boosts signature generation and verification by 5.78% and 12.19% than previous results in CHES2012.

[1]  Christof Paar,et al.  A Survey of Lightweight-Cryptography Implementations , 2007, IEEE Design & Test of Computers.

[2]  Dag Arne Osvik Fast Embedded Software Hashing , 2012, IACR Cryptol. ePrint Arch..

[3]  N. Koblitz Elliptic curve cryptosystems , 1987 .

[4]  Chen-Mou Cheng,et al.  Implementing Minimized Multivariate PKC on Low-Resource Embedded Systems , 2006, SPC.

[5]  Albrecht Petzoldt,et al.  Small private keys for systems of multivariate quadratic equations using symmetric cryptography , 2012 .

[6]  Deian Stefan,et al.  Fast Software AES Encryption , 2010, FSE.

[7]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[8]  Jintai Ding,et al.  Secure Electronic Voting , 2006, Advances in Information Security.

[9]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[10]  Ricardo Dahab,et al.  TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks , 2008, 2008 5th International Conference on Networked Sensing Systems.

[11]  Joos Vandewalle,et al.  Hash Functions Based on Block Ciphers: A Synthetic Approach , 1993, CRYPTO.

[12]  François Le Gall,et al.  Dihedral Hidden Subgroup Problem: A Survey , 2005 .

[13]  Toby Prescott Random Number Generation Using AES , 2011 .

[14]  Stefan Heyse,et al.  Efficient Implementations of MQPKS on Constrained Devices , 2012, CHES.

[15]  Tim Güneysu,et al.  Embedded Syndrome-Based Hashing , 2012, INDOCRYPT.

[16]  Stanislav Bulygin,et al.  Small Public Keys and Fast Verification for $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic Public Key Systems , 2011, CHES.

[17]  Bart Preneel,et al.  A Study of the Security of Unbalanced Oil and Vinegar Signature Schemes , 2005, CT-RSA.

[18]  Tibor Juhas The use of elliptic curves in cryptography , 2007 .

[19]  Louis Goubin,et al.  Unbalanced Oil and Vinegar Signature Schemes , 1999, EUROCRYPT.

[20]  Bo-Yin Yang,et al.  TTS: High-Speed Signatures on a Low-Cost Smart Card , 2004, CHES.

[21]  Thomas Eisenbarth,et al.  Evaluation of SHA-3 Candidates for 8-bit Embedded Processors , 2010 .