Implementing Minimized Multivariate PKC on Low-Resource Embedded Systems

Yang, Bo‐Yin; Cheng, Chen-Mou; Chen, Bor-Rong; Chen, Jiun-Ming

doi:10.1007/11734666_7

Cited by 34 publications

(20 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The works in [5,6,[26][27][28][29] are believed to be the latest RSA, ECC, and multivariate public key cryptographic systems on hardware, respectively. We compare our design with these systems, which is depicted in Table 4.…”

Section: Comparisons With Other Implementationsmentioning

confidence: 99%

“…During the past thirty years, various multivariate cryptographic schemes have been proposed, like Unbalanced Oil-Vinegar Signature (UOV) [18], Rainbow [19,20], Tame Transformation Signature (TTS) [21,22], and others [23][24][25]. Their implementations have been one of the subjects of a lot of researches and continue to be a topic of interest in many areas, for example, efficient multivariate systems on Field Programmable Gate Arrays (FPGAs) [26], small multivariate processors on FPGAs [27], high speed Rainbow on FPGAs [28], and minimized multivariate PKC on Application Specific Integrated Circuits (ASICs) [29].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Under Quantum Computer Attack: Is Rainbow a Replacement of RSA and Elliptic Curves on Hardware?

2018

Security and Communication Networks

View full text Add to dashboard Cite

Among cryptographic systems, multivariate signature is one of the most popular candidates since it has the potential to resist quantum computer attacks. Rainbow belongs to the multivariate signature, which can be viewed as a multilayer unbalanced OilVinegar system. In this paper, we present techniques to exploit Rainbow signature on hardware meeting the requirements of efficient high-performance applications. We propose a general architecture for efficient hardware implementations of Rainbow and enhance our design in three directions. First, we present a fast inversion based on binary trees. Second, we present an efficient multiplication based on compact construction in composite fields. Third, we present a parallel solving system of linear equations based on GaussJordan elimination. Via further other minor optimizations and by integrating the major improvement above, we implement our design in composite fields on standard cell CMOS Application Specific Integrated Circuits (ASICs). The experimental results show that our implementation takes 4.9 us and 242 clock cycles to generate a Rainbow signature with the frequency of 50 MHz. Comparison results show that our design is more efficient than the RSA and ECC implementations.

show abstract

Section: Comparisons With Other Implementationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Under Quantum Computer Attack: Is Rainbow a Replacement of RSA and Elliptic Curves on Hardware?

2018

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Multivariate signatures are claimed to be one of the fastest signatures, in particular, Rainbow [4] and TTS [5]. Multiple methodologies for accelerating the implementation of multivariate cryptography have been proposed due to its applicability in the area of engineering [6][7][8][9][10][11][12][13][14]. Among these methodologies, optimization of finite field multiplication is playing a crucial role since it is the most fundamental arithmetic in multivariate cryptography.…”

Section: Introductionmentioning

confidence: 99%

Fast Three-Input Multipliers over Small Composite Fields for Multivariate Public Key Cryptography

Yi¹,

Li²

2015

IJSIA

View full text Add to dashboard Cite

show abstract

“…Furthermore, experience indicates that this problem is hard even in the average case; thus multivariate cryptosystems at least have a chance of being difficult to break. Secondly, multivariate cryptosystems are often very efficient, see [2][3][4]. Finally, such cryptosystems can be very amenable to the user demands, with multiple parameters hidden within the system which can be altered by the user to achieve different performance goals.…”

Section: Introductionmentioning

confidence: 99%

An Asymptotically Optimal Structural Attack on the ABC Multivariate Encryption Scheme

Moody

Perlner

Smith-Tone

2014

Post-Quantum Cryptography

View full text Add to dashboard Cite

Abstract. Historically, multivariate public key cryptography has been less than successful at offering encryption schemes which are both secure and efficient. At PQCRYPTO '13 in Limoges, Tao, Diene, Tang, and Ding introduced a promising new multivariate encryption algorithm based on a fundamentally new idea: hiding the structure of a large matrix algebra over a finite field. We present an attack based on subspace differential invariants inherent to this methodology. The attack is is a structural key recovery attack which is asymptotically optimal among all known attacks (including algebraic attacks) on the original scheme and its generalizations.

show abstract

Implementing Minimized Multivariate PKC on Low-Resource Embedded Systems

Cited by 34 publications

References 28 publications

Under Quantum Computer Attack: Is Rainbow a Replacement of RSA and Elliptic Curves on Hardware?

Under Quantum Computer Attack: Is Rainbow a Replacement of RSA and Elliptic Curves on Hardware?

Fast Three-Input Multipliers over Small Composite Fields for Multivariate Public Key Cryptography

An Asymptotically Optimal Structural Attack on the ABC Multivariate Encryption Scheme

Contact Info

Product

Resources

About