作者: Sung-Ming Yen , Dongryeol Kim , SangJae Moon
DOI: 10.1007/11889700_5
关键词: Cryptography 、 Computation 、 Chinese remainder theorem 、 Speedup 、 Cryptanalysis 、 Modulus 、 Factorization 、 Theoretical computer science 、 Cryptosystem 、 Computer science 、 Residue number system 、 Computer engineering 、 Fault (power engineering) 、 Fault tolerance
摘要: The technique of RSA private computation speedup by using Chinese Remainder Theorem (CRT) is well known and has already been widely employed in almost all implementations. A recent CRT-based factorization attack exploiting hardware fault received growing attention because its potential vulnerability on most existing In this any single erroneous will make the system be vulnerable to factorizing public modulus. Recently, two immune protocols for CRT were reported based concept infective computation. special property these that they do not assume existence totally free tamper comparison operation within machine order enhance reliability. However, it shown paper are still a computational an auxiliary process was considered usual attack.