17 citations · 34 across the 5 of their papers we have counts for
5 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…
DEXON: A Highly Scalable, Decentralized DAG-Based Consensus Algorithm
Tai-Yuan Chen, Wei-Ning Huang, Po-Chun Kuo +2
A blockchain system is a replicated state machine that must be fault tolerant. When designing a blockchain system, there is usually a trade-off between decentralization, scalabilit…
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…