Demo Data from EDBT 2026 / reviewers in the wild / expert
Xinyuan Cui
dblp:270/1294
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021
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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Integrated circuit design · 100% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Integrated circuit design › digital circuit design
arithmetic circuit design |
0.6 | 1 | 2022 | An Efficient CRT-Based Bit-Parallel Multiplier for Special Pentanomials · IEEE Trans. Computers 2022 |
Integrated circuit design › finite field arithmetic
finite field multiplier |
0.6 | 1 | 2022 | An Efficient CRT-Based Bit-Parallel Multiplier for Special Pentanomials · IEEE Trans. Computers 2022 |
Integrated circuit design › digital circuit design › arithmetic circuit design
parallel multiplier |
0.6 | 1 | 2022 | An Efficient CRT-Based Bit-Parallel Multiplier for Special Pentanomials · IEEE Trans. Computers 2022 |
Cryptographic primitives and cryptanalysis
finite field arithmetic |
0.2 | 1 | 2022 | An Efficient CRT-Based Bit-Parallel Multiplier for Special Pentanomials · IEEE Trans. Computers 2022 |
Methods — techniques the papers use, named apart from their topics
chinese remainder theorem · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | An Efficient CRT-Based Bit-Parallel Multiplier for Special PentanomialsabstractThe Chinese remainder theorem (CRT)-based multiplier is a new type of hybrid bit-parallel multiplier, which can achieve nearly the same time complexity compared with the fastest multiplier known to date with reduced space complexity. However, the current CRT-based multipliers are only applicable to trinomials. In this article, we propose an efficient CRT-based bit-parallel multiplier for a special type of pentanomial$x^m+x^{m-k}+x^{m-2k}+x^{m-3k}+1, 5k+1 Yin Li 0001, Xinyuan Cui, Yu Zhang 0031 |
IEEE Trans. Computers | 2 |