Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chuanda Qi

dblp:81/5415 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3Systems, architecture and hardware · 2Artificial intelligence and machine learning · 1Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › finite field arithmetic
binary field multiplication
0.312017
Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials · IEEE Trans. Computers 2017
Cryptographic primitives and cryptanalysis
finite field arithmetic
0.312017
Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials · IEEE Trans. Computers 2017
Integrated circuit design
digital circuit design
0.112017
Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials · IEEE Trans. Computers 2017
Integrated circuit design › digital circuit design › arithmetic circuit design
parallel multiplier
0.112017
Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials · IEEE Trans. Computers 2017

Methods — techniques the papers use, named apart from their topics

shifted polynomial basis · 0.6mastrovito approach · 0.6karatsuba algorithm · 0.6
YearPublicationVenuePosition
2020 Speech watermarking robust against recapturing and de-synchronization attacks
Zhenghui Liu, Yancong Yang, Chuanda Qi
Multim. Tools Appl.4
2018 Secure fine-grained spatio-temporal Top-k queries in TMWSNs
Xingpo Ma, Junbin Liang, Jianxin Wang 0001, Sheng Wen, Tian Wang 0001, Yin Li 0001, Wenpeng Ma, Chuanda Qi
Future Gener. Comput. Syst.8
2017 A security watermark scheme used for digital speech forensics
Zhenghui Liu, Jiwu Huang, Xingming Sun, Chuanda Qi
Multim. Tools Appl.4
2017 Tamper recovery algorithm for digital speech signal based on DWT and DCT
Zhenghui Liu, Jiwu Huang, Chuanda Qi
Multim. Tools Appl.5
2017 Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials
abstract
We present a new type of bit-parallel non-recursive Karatsuba multiplier over GF(2m) generated by an arbitrary irreducible trinomial. This design effectively exploits Mastrovito approach and shifted polynomial basis (SPB) to reduce the time complexity and Karatsuba algorithm to reduce its space complexity. We show that this type of multiplier is only one TX slower than the fastest bit-parallel multiplier for all trinomials, where TX is the delay of one 2-input XOR gate. Meanwhile, its space complexity is roughly 3/4 of those multipliers. To the best of our knowledge, it is the first time that our scheme has reached such a time delay bound. This result outperforms previously proposed non-recursive Karatsuba multipliers.
Yin Li 0001, Xingpo Ma, Yu Zhang 0031, Chuanda Qi
IEEE Trans. Computers4
2015 An Authentication and Recovery Scheme for Digital Speech Signal Based on DWT
Zhenghui Liu, Chuanda Qi
IWDW4
2009 Analysis on a Non-repudiable Threshold Proxy Signature Scheme with Known Signers
Chuanda Qi
ISNN (2)3