http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Improved Shamir’s CRT-RSA Algorithm: Revisit with the Modulus Chaining Method
이승광,최두호,최용제 한국전자통신연구원 2014 ETRI Journal Vol.36 No.3
RSA signature algorithms using the Chinese remaindertheorem (CRT-RSA) are approximately four-times fasterthan straightforward implementations of an RSAcryptosystem. However, the CRT-RSA is known to bevulnerable to fault attacks; even one execution of thealgorithm is sufficient to reveal the secret keys. Over thepast few years, several countermeasures against CRT-RSAfault attacks have tended to involve additionalexponentiations or inversions, and in most cases, they arealso vulnerable to new variants of fault attacks. In thispaper, we review how Shamir’s countermeasure can bebroken by fault attacks and improve the countermeasureto prevent future fault attacks, with the added benefit oflow additional costs. In our experiment, we use the sidechannelanalysis resistance framework system, a faultinjection testing and verification system, which enables usto inject a fault into the right position, even to within 1 μs. We also explain how to find the exact timing of the targetoperation using an Atmega128 software board.
金甲洙,李承光 嶺南大學校 環境問題硏究所 1991 環境硏究 Vol.10 No.2
The purpose of this paper is to study on the effect of the soundproof barrier against road traffic noise. The major results of this paper may be summarized as follows : (1) According to the effect of the soundproof barrier, within 35m on the effect of the soundproof barrier is high, but out side 35m is low. Because there is the difference of the height and length of the soundproof barriers. (2) Comparing the aluminum soundproof barrier with the concrete soundproof barrier, the effect of two materials of turned out similarly using Leg and ??. (3) The traffic soundproof barriers on the road will have to be established at the schools and the inhabitant regions which are above the average degree about circumstance.
Conditional Re-encoding Method for Cryptanalysis-Resistant White-Box AES
이승광,최용제,최두호 한국전자통신연구원 2015 ETRI Journal Vol.37 No.5
Conventional cryptographic algorithms are not sufficient to protect secret keys and data in white-box environments, where an attacker has full visibility and control over an executing software code. For this reason, cryptographic algorithms have been redesigned to be resistant to white-box attacks. The first white-box AES (WB-AES) implementation was thought to provide reliable security in that all brute force attacks are infeasible even in white-box environments; however, this proved not to be the case. In particular, Billet and others presented a cryptanalysis of WB-AES with 230 time complexity, and Michiels and others generalized it for all substitution-linear transformation ciphers. Recently, a collision-based cryptanalysis was also reported. In this paper, we revisit Chow and others’s first WB-AES implementation and present a conditional re-encoding method for cryptanalysis protection. The experimental results show that there is approximately a 57% increase in the memory requirement and a 20% increase in execution speed.