8 citations · 18 across the 5 of their papers we have counts for
5 papers
Isogeny-based Group Signatures and Accountable Ring Signatures in QROM
Kai-Min Chung, Yao-Ching Hsieh, Mi-Ying Huang +3
We present the first provably secure isogeny-based group signature (GS) and accountable ring signature (ARS) in the quantum random oracle model (QROM). We do so via introducing and…
A physical study of the LLL algorithm
Jintai Ding, Seungki Kim, Tsuyoshi Takagi +2
This paper presents a study of the LLL algorithm from the perspective of statistical physics. Based on our experimental and theoretical results, we suggest that interpreting LLL as…
Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform
Ming-Shing Chen, Chen-Mou Cheng, Po-Chun Kuo +2
We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a nat…
Frobenius Additive Fast Fourier Transform
Wen-Ding Li, Ming-Shing Chen, Po-Chun Kuo +2
In ISSAC 2017, van der Hoeven and Larrieu showed that evaluating a polynomial P in GF(q)[x] of degree <n at all n-th roots of unity in GF() can essentially be computed d-time…
Faster Multiplication for Long Binary Polynomials
Ming-Shing Chen, Chen-Mou Cheng, Po-Chun Kuo +2
We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform…