Kai Song

Kai Song

Auto-generated profile, based on publicly available information

Kai Song

East China Jiao Tong Univ, Sch Informat Engn, Shuanggang Rd, Nanchang 330013, Peoples R China

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 February 2012 in Applied Optics
Verified
Journal Article
Closed access
PDF file
KSKai Song
Kai Song
LYLiping Yan
Liping Yan
On the basis of the symmetric encoding algorithm for the modified signed-digit (MSD), a 7*7 truth table that can be realized with optical methods was developed. And based on the truth table, the optical path structures and circuit implementations of the one-step MSD adder of ternary optical computer (TOC) were designed. Experiments show that the scheme is correct, feasible, and efficient.

1 September 2021 in Optik
Verified
Journal Article
Closed access
KSKai Song
Kai Song
BZBoyang Zhang
Boyang Zhang
WLWen Li
Wen Li
LYLiping Yan
Liping Yan
XWXianchao Wang
Xianchao Wang

6 November 2023 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
KSKai Song
Kai Song
HMHuaqiong Ma
Huaqiong Ma
HZHaiming Zhang
Haiming Zhang
LYLiping Yan
Liping Yan

1 April 2020 in IEEE Access
Verified
Journal Article
Open access
KSKai Song
Kai Song
QJQingqing Jin
Qingqing Jin
GCGong Chen
Gong Chen
LYLiping Yan
Liping Yan
YZYi Zhang
Yi Zhang
XWXianchao Wang
Xianchao Wang
As an important tool in the field of mathematics, higher-order derivation problems are widely used in differentials, quantum mechanics, and engineering applications. However, in the electronic computer (EC), due to the existence of the carry in the calculation, the computational efficiency is low when solving the higher-order derivation problem. In response to this problem, the ternary optical computer (TOC) has the advantages of no carry-in and the characteristics of numerous data bits, reconfigurable processors and parallel computing. Solve the higher-order derivation problems with complex operations by constructing multipliers and adders on the TOC platform, and copying multiple composite operator units (COUs). This article introduces the design of the higher-order derivative algorithm based on TOC in detail, the reconfiguration process of the multiplier and adder, and the number of bits of the multiplier and adder required in the implementation is given. Besides, the hardware resources and clock cycles in the operation are analyzed. The feasibility of the implementation scheme is verified by experiments. Compared with the traditional higher-order derivative, the higher-order derivative based on the TOC is superior in time performance, computational efficiency, and processing of complex operations. Due to the limitation of the research stage, the algorithm is only applicable to the function of polynomials, which lays a foundation for the further research of higher-order derivative algorithms, and has certain application significance.

11 April 2022 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
KSKai Song
Kai Song
WLWen Li
Wen Li
BZBoyang Zhang
Boyang Zhang
LYLiping Yan
Liping Yan
XWXianchao Wang
Xianchao Wang

23 August 2024 in Applied Optics
Verified
Journal Article
Closed access
KSKai Song
Kai Song
HHHuanyu Hu
Huanyu Hu
LYLiping Yan
Liping Yan
XHXinjun Hou
Xinjun Hou
JWJingyang Wei
Jingyang Wei
The RSA algorithm remains one of the most influential and extensively used public-key encryption algorithms in today’s cryptographic domain. However, the traditional RSA encryption algorithm has several drawbacks, including slow computational speed, high computational cost, and substantial space requirements in practical applications. Consequently, this study amalgamates the characteristics of a ternary optical computer (TOC), including high parallelism, multi-digit precision, and low energy consumption, to research and propose a dual-channel transmission encryption strategy and a parallel rapid RSA encryption algorithm. Leveraging the dual-rotary optical structure of TOC and the simplest most significant digit (MSD) encoding, we implement a fundamental encryption strategy based on TOC. Concurrently, we harness the high-parallelism attributes of TOC to design large-number parallel modular exponentiation modules, enabling the generation of large prime numbers and efficient computation of large integer modular exponentiation operations. This innovation surmounts the drawbacks of traditional RSA algorithms and further enhances the efficiency of the encryption algorithm. Through resource and time analysis of the algorithm, as well as validation through experimental cases, it is evident that the TOC-based parallel rapid RSA encryption algorithm exhibits excellent computational efficiency and time performance. This research optimally exploits TOC’s advantages in handling high parallelism and extensive computational tasks.