http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Yang Junru,Song Chuanjuan,Wang Minglan,Zhang Yuekan,Sun Jing 대한기계학회 2016 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.30 No.1
The interface crack propagation problem in the cermet cladding material structure was studied. A comparative propagation propertyparameter (CP) suitable to judge the propagation direction of the interface crack in the cermet cladding material structure was proposed. The interface crack propagation criterion was established. Theoretical models of the CPs for the crack normal to and dwelling on theinterface deflecting separately into the clad, the interface and the substrate were built, and the relations between the CPs and the loadaction angle, the clad thickness ratio and the load were investigated with an example. The research results show that, under the researchconditions, the interface crack will more easily propagate into the clad layer than into the substrate.
The Novel Efficient Dual-field FIPS Modular Multiplication
( Tingting Zhang ),( Junru Zhu ),( Yang Liu ),( Fulong Chen ) 한국인터넷정보학회 2020 KSII Transactions on Internet and Information Syst Vol.14 No.2
The modular multiplication is the key module of public-key cryptosystems such as RSA (Rivest-Shamir-Adleman) and ECC (Elliptic Curve Cryptography). However, the efficiency of the modular multiplication, especially the modular square, is very low. In order to reduce their operation cycles and power consumption, and improve the efficiency of the public-key cryptosystems, a dual-field efficient FIPS (Finely Integrated Product Scanning) modular multiplication algorithm is proposed. The algorithm makes a full use of the correlation of the data in the case of equal operands so as to avoid some redundant operations. The experimental results show that the operation speed of the modular square is increased by 23.8% compared to the traditional algorithm after the multiplication and addition operations are reduced about (s<sup>2</sup>-s)/2, and the read operations are reduced about s<sup>2</sup>-s, where s=n/32 for n-bit operands. In addition, since the algorithm supports the length scalable and dual-field modular multiplication, distinct applications focused on performance or cost could be satisfied by adjusting the relevant parameters.