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

Shicheng Ma

dblp:279/0572 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0000-9668-5419ORCID · reported

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1Systems, 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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 62% Integrated circuit design · 38%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
1.012026
KD-Finder: A Karatsuba Decomposition Optimization Finder for NTT-Friendly Montgomery Modular Multiplication · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Cryptographic primitives and cryptanalysis › public-key cryptography
modular multiplication
1.012026
KD-Finder: A Karatsuba Decomposition Optimization Finder for NTT-Friendly Montgomery Modular Multiplication · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Cryptographic primitives and cryptanalysis › public-key cryptography › modular multiplication
montgomery multiplication
1.012026
KD-Finder: A Karatsuba Decomposition Optimization Finder for NTT-Friendly Montgomery Modular Multiplication · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Hardware accelerators and domain-specific architectures
cryptographic accelerator
1.012026
KD-Finder: A Karatsuba Decomposition Optimization Finder for NTT-Friendly Montgomery Modular Multiplication · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Integrated circuit design › digital circuit design
arithmetic circuit design
0.312026
KD-Finder: A Karatsuba Decomposition Optimization Finder for NTT-Friendly Montgomery Modular Multiplication · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Integrated circuit design
digital circuit design
0.312026
KD-Finder: A Karatsuba Decomposition Optimization Finder for NTT-Friendly Montgomery Modular Multiplication · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026

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

karatsuba decomposition · 2.0greedy search · 2.0NTT-friendly modulus · 2.0
YearPublicationVenuePosition
2026 KD-Finder: A Karatsuba Decomposition Optimization Finder for NTT-Friendly Montgomery Modular Multiplication
abstract
Fully homomorphic encryption (FHE) allows operations to be performed directly on encrypted data, and has attracted massive attention in data security scenarios. Numerous resource efficient FHE acceleration methods have been proposed, including many on the optimization of modular multiplication (MM), a fundamental operation in FHE, by leveraging Karatsuba multiplication and NTT-friendly moduli for Montgomery MM (MMM). However, FHE is not yet practical due to its significant resource overheads. In this paper, we report an automated Karatsuba decomposition search strategy that drastically improves the efficiency of MM implementation. Our key idea is to integrate NTT-friendly moduli into Karatsuba decomposition within parallel MMM, and incorporate optimization features such as truncated multiplication ⌊AB/R⌋ and modular multiplicationABmodR. After a careful analysis on the optimization space, we propose an automated Karatsuba decomposition optimization search algorithm based on a greedy strategy to enhance efficiency and effectiveness. Theoretical analysis shows that, under the mainstream NTT-friendly modulus conditions, the optimized 2, 3, 4-term Karatsuba decomposition schemes achieve an average area reduction of 18% for MMM over the basic Karatsuba method and 57% over the classical Schoolbook method. Furthermore, hardware implementations on FPGA demonstrate 29% to 79% improvement, with an average of 59%, in Area/Throughput compared to the state-of-the-art implementations.
Shicheng Ma, Song Bian 0001, Meng Li 0004, Gang Qu 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2025 PrePSL: A Pre-training Method for Protein Subcellular Localization Using Graph Auto-encoder and Protein Language Model
Shicheng Ma, Weiyang Liang, Xuehua Bi
ISBRA (2)1
2025 MFCADTI: improving drug-target interaction prediction by integrating multiple feature through cross attention mechanism
abstract
Accurately identifying potential drug-target interactions (DTIs) is a critical step in drug discovery. Multiple heterogeneous biological data provide abundant features for DTI prediction. Many computational methods have been proposed based on these data. However, most of these methods either extract features from sequences or from networks, utilizing only one aspect of the characteristics of drugs and targets, neglecting the complementary information between these two types of features. In fact, integrating different types of features will provide more valuable information for DTI prediction. In this article, we propose a novel method to improve the predictive capability for DTIs, named MFCADTI, by integrating multi-source feature through cross-attention mechanisms. The method extracts network topological features from the heterogeneous network and attribute features from sequences of drugs and targets. Considering the complementarity and heterogeneity between network and attribute features, cross-attention mechanisms are used to integrate the network and attribute features of drugs and targets. To capture the correlations between drugs and targets, cross-attention is used to learn the interaction features of each drug-target pair. We evaluate MFCADTI on two datasets and experimental results demonstrate a significant improvement in the performance of MFCADTI compared to state-of-the-art methods. Finally, case studies illustrate that MFCADTI is an effective DTI prediction way that provides valuable guidance for drug development. The data and source code used in this study are available at: https://github.com/Dejavun/MFCADTI .
Na Quan, Shicheng Ma, Xuehua Bi
BMC Bioinform.2
2020 A Literature Review of Recent Graph Embedding Techniques for Biomedical Data
Yankai Chen 0001, Yaozu Wu, Shicheng Ma, Irwin King
ICONIP (5)3