6 citations · 6 across the 2 of their papers we have counts for
4 papers
Fair Byzantine Agreements for Blockchains
Tzu-Wei Chao, Hao Chung, Po-Chun Kuo
Byzantine general problem is the core problem of the consensus algorithm, and many protocols are proposed recently to improve the decentralization level, the performance and the se…
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…