A generic optimization method of multivariate systems on graphic processing units

Liao, Guohong; Gong, Zheng; Huang, Zheng; Qiu, Weidong

doi:10.1007/s00500-018-3507-0

Cited by 2 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They have also been classified as NP-complete [49], and are thus regarded to be quantum-resistant. However, key sizes of multivariate signature schemes are still large [19], [23], and they may not be const-friendly for practical applications [64]. Nevertheless, some multivariate systems have been optimized for uses in blockchain technologies [23], and methods for generic multivariate systems on graphic processing units that optimizes computation cost for post-quantum systems have been proposed [64].…”

Section: ) Multivariate Systemsmentioning

confidence: 99%

Quantum and post-quantum cryptography and cybersecurity: A systematic mapping

Markaida¹,

Larrucea²,

Romay³

2021

Colección Jornadas Y Congresos

View full text Add to dashboard Cite

show abstract

Section: ) Multivariate Systemsmentioning

confidence: 99%

Quantum and post-quantum cryptography and cybersecurity: A systematic mapping

Markaida¹,

Larrucea²,

Romay³

2021

Colección Jornadas Y Congresos

View full text Add to dashboard Cite

show abstract

“…In recent years, GPUs are widely used in cloud computing and blockchain, which faces huge security challenges to guarantee data security and user privacy [12][13][14]. Several GPU acceleration schemes for multivariate systems are proposed to make it suitable for security of cloud computing and blockchain in the quantum world [15,16]. In 2014, Tanaka et al [15] proposed two efficient parallelization algorithms and a GPU-based multivariable quadratic polynomial system.…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, they proposed several effective parallel implementations of QUAD on GPU to accelerate the computing of quadratic polynomials. In 2018, Liao et al [16] proposed a GPU acceleration framework for high-order multivariate cryptography systems, where the GPU acceleration schemes made multivariate cryptosystems feasible for cloud computing and blockchain.…”

Section: Introductionmentioning

confidence: 99%

Fuzzy Matching Template Attacks on Multivariate Cryptography: A Case Study

Huang

Zhao

et al. 2020

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

Multivariate cryptography is one of the most promising candidates for post-quantum cryptography. Applying machine learning techniques in this paper, we experimentally investigate the side-channel security of the multivariate cryptosystems, which seriously threatens the hardware implementations of cryptographic systems. Generally, registers are required to store values of monomials and polynomials during the encryption of multivariate cryptosystems. Based on maximum-likelihood and fuzzy matching techniques, we propose a template-based least-square technique to efficiently exploit the side-channel leakage of registers. Using QUAD for a case study, which is a typical multivariate cryptosystem with provable security, we perform our attack against both serial and parallel QUAD implementations on field programmable gate array (FPGA). Experimental results show that our attacks on both serial and parallel implementations require only about 30 and 150 power traces, respectively, to successfully reveal the secret key with a success rate close to 100%. Finally, efficient and low-cost strategies are proposed to resist side-channel attacks.

show abstract

A generic optimization method of multivariate systems on graphic processing units

Cited by 2 publications

References 26 publications

Quantum and post-quantum cryptography and cybersecurity: A systematic mapping

Quantum and post-quantum cryptography and cybersecurity: A systematic mapping

Fuzzy Matching Template Attacks on Multivariate Cryptography: A Case Study

Contact Info

Product

Resources

About