本文著重分析了RSA 算法的核心－模冪運(yùn)算，提出了有利于硬件實(shí)現(xiàn)的改進(jìn)算法，并利用中國(guó)剩余定理加快了RSA 的解密及數(shù)字簽名的運(yùn)算速度。在此基礎(chǔ)上，最終提出并設(shè)計(jì)了一種結(jié)構(gòu)簡(jiǎn)單，運(yùn)算速度較快的加密核。通過(guò)Verilog HDL 模型的仿真驗(yàn)證了此加密
核設(shè)計(jì)的正確性及可行性。
關(guān)鍵詞：RSA 算法，Montgomery 算法，中國(guó)剩余定理，加法器
Design of a new kind of encryption kernel based on RSA algorithm Shi Xiang-dong， Dong Ping (Information Engineering School，University of Science and Technology Beijing，
Beijing 100083，China) Abstract：This paper mainly analyzes the core operation of RSA algorithm－modular power operation, proposes an ameliorative algorithm which makes for hardware realization, and improves the operation speed of RSA decryption and Digital Signature with the Chinese remainder theorem. Based on these, a new kind of encryption kernel has been proposed and designed with relative simple structure and fast operation speed. Furthermore, simulation with Verilog HDL model validates the feasibility of the new encryption kernel.
Keywords：RSA algorithm, Montgomery algorithm, Chinese Remainder Theorem, adder