14 citations · 34 across the 6 of their papers we have counts for
6 papers
Proof-of-work consensus by quantum sampling
Deepesh Singh, Gopikrishnan Muraleedharan, Boxiang Fu +4
Since its advent in 2011, boson sampling has been a preferred candidate for demonstrating quantum advantage because of its simplicity and near-term requirements compared to other q…
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…
PMI-based MIMO OFDM PHY Integrated Key Exchange (P-MOPI) Scheme
Pang-Chang Lan, Chih-Yao Wu, Chia-Han Lee +2
In the literature, J.-P. Cheng et al. have proposed the MIMO-OFDM PHY integrated (MOPI) scheme for achieving physical-layer security in practice without using any cryptographic cip…