• 정보보호학회논문지
• /
• 제23권5호
• /
• pp.859-865
• /
• 2013

스마트카드, 전자여권 등과 같은 내장형 장치(embedded system) 환경이 늘어나고, 민감한 데이터의 보안에 대한 수요가 증가함에 따라 다양한 부채널 공격에 대한 암호시스템의 안전한 구현이 중요시 되고 있다. 특히, 오류 주입공격은 암호 시스템 구현에 큰 위협 중 하나이며, 하나의 평문-암호문 쌍에 의해 전체 시스템의 안전성이 위협을 받을수 있기 때문에 암호시스템 구현자에 의해 심각하게 고려되어야 한다. 오류 주입 공격을 방지하는 몇몇 기술은 다양한 암호시스템을 위해 도입되었지만 여전히 classical RSA 암호시스템에 적용되는 실질적인 오류 주입 공격 대응책으로는 부족하다. 본 논문은 classical RSA 암호시스템을 위한 효율적인 오류 주입 공격 대응법을 제안한다. 제안하는 대응방법은 페르마의 정리를 사용하며 추가 연산이 적다는 이점이 있다.

• Journal of Mechanical Science and Technology
• /
• 제18권9호
• /
• pp.1512-1518
• /
• 2004

Rescaled Simulated Annealing (RSA) has been adapted to solve combinatorial optimization problems in which the available computational resources are limited. Simulated Annealing (SA) is one of the most popular combinatorial optimization algorithms because of its convenience of use and because of the good asymptotic results of convergence to optimal solutions. However, SA is too slow to converge in many problems. RSA was introduced by extending the Metropolis procedure in SA. The extension rescales the state's energy candidate for a transition before applying the Metropolis criterion. The rescaling process accelerates convergence to the optimal solutions by reducing transitions from high energy local minima. In this paper, structural optimization examples using RSA are provided. Truss structures of which design variables are discrete or continuous are optimized with stress and displacement constraints. The optimization results by RSA are compared with the results from classical SA. The comparison shows that the numbers of optimization iterations can be effectively reduced using RSA.

• 한국전산구조공학회논문집
• /
• 제18권1호
• /
• pp.71-78
• /
• 2005

수정 시뮬레이티드어닐링은 Simulated Annealing(SA)가 확률 탐색 방법을 사용하기 때문에 수렴시간이 오래 걸리는 단점를 개선한 방법이다. 따라서 본 논문에서는 RSA와 SA을 트러스구조물과 인공위성구조물의 최적화에 적용하여 서로 비교하여 보았다. 최적화 예제로 10부재 트러스, 실제 응용예제로 인공위성구조물은 위성 상단 플랫폼과 추진모듈의 최적화를 수행하였다. 인공위성구조물의 최적화에서 응력과 고유진동수, 전단응력 등을 제한조건으로 고려하여 최적화를 수행하였다. 인공위성구조물의 최적화를 수행한 결과 RSA을 이용하여 다양한 인공위성 구조물의 최적화에 적용될 수 있음을 확인하였으며, 인공위성 구조물의 최적화에서 RSA가 SA보다 수렴속도가 향상되었음을 확인하였다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 추계학술대회
• /
• pp.522-527
• /
• 2004

Resealed Simulated Annealing (RSA) has been devised for improving the disadvantage of Simulated Annealing (SA) which require tremendous amount of computation time. RSA and SA have been for optimization of satellite structures and for comparison of results from two algorithms. As a practical application, a satellite structure is optimized by the two algorithms. Weights of satellite upper platform and propulsion module are minimized. MSC/NASTRAN is used for the static and dynamic analysis. The optimization results of the RSA are compared with results of the classical SA. The numbers of optimization iterations could be effectively reduced by the RSA.

• International Journal of Computer Science & Network Security
• /
• 제23권1호
• /
• pp.164-168
• /
• 2023

As our community has become increasingly dependent on technology, security has become a bigger concern, which makes it more important and challenging than ever. security can be enhanced with encryption as described in this paper by combining RC6 symmetric cryptographic algorithms with RSA asymmetric algorithms, as well as the Vigenère cipher, to help manage weaknesses of RC6 algorithms by utilizing the speed, security, and effectiveness of asymmetric algorithms with the effectiveness of symmetric algorithm items as well as introducing classical algorithms, which add additional confusion to the decryption process. An analysis of the proposed encryption speed and throughput has been conducted in comparison to a variety of well-known algorithms to demonstrate the effectiveness of each algorithm.

• 디지털산업정보학회논문지
• /
• 제9권4호
• /
• pp.103-110
• /
• 2013

In Information Technology era, various amazing IT technologies, for example Big Data, are appearing and are available as the amount of information increase. The number of counselling for violation of personal data protection is also increasing every year that it amounts to over 160,000 in 2012. According to Korean Privacy Act, in the case of treating unique personal identification information, appropriate measures like encipherment should be taken. The technologies of encipherment are the most basic countermeasures for personal data invasion and the base elements in information technology. So various cryptography algorithms exist and are used for encipherment technology. Therefore studies on safer new cryptography algorithms are executed. Cryptography algorithms started from classical replacement enciphering and developed to computationally secure code to increase complexity. Nowadays, various mathematic theories such as 'factorization into prime factor', 'extracting square root', 'discrete lognormal distribution', 'elliptical interaction curve' are adapted to cryptography algorithms. RSA public key cryptography algorithm which was based on 'factorization into prime factor' is the most representative one. This paper suggests algorithm utilizing telescoping series as a safer cryptography algorithm which can maximize the complexity. Telescoping series is a type of infinite series which can generate various types of function for given value-the plain text. Among these generated functions, one can be selected as a original equation. Some part of this equation can be defined as a key. And then the original equation can be transformed into final equation by improving the complexity of original equation through the command of "FullSimplify" of "Mathematica" software.

• Archives of Pharmacal Research
• /
• 제22권5호
• /
• pp.485-490
• /
• 1999

The mechanism of action of fish oil (FO), currently used in different chronic inflammatory conditions such as rheumatoid arthritis (RA), is not completely understood, although it is thought that it could alter the metabolism of endogenous autacoids. In addition, we hypothesized that the known capability of fatty acids (FA) of stabilizing serum albumin and perhaps other proteins, may be of pharmacological relevance considering that it is shared by other anti-rheumatic agents (e.g. nonsteroidal antiinflammatory drugs). Thus, we studied the effect of oral administration of FO and corn oil (CO), a vegetable oil with a different composition, on the stability of rat serum proteins, evaluated buy a classical in vitro method based on heat-induced protein denaturation. FO, and, to a lower extent, CO inhibited heat-induced denaturation of rat serum (RS): based on the inhibitory activity (EC50) of the major fatty acids against heat-induced denaturation of RS in vitro, it was possible to speculate the in vivo effects of palmitic acid (C16:0) and eicosapentaenoic acid (EPA, C20:5, n-3) may be more relevant than that of linolenic acid (C18:2). To better investigate this phenomenon, we extracted albumin from the serum of animals treated or not with FO with a one-step affinity chromatography technique, obtaining high purity rat serum albumin preparations (RSA-CTRL and RSA-FO), as judged by SDS-PAGE with Coomassie blue staining. When these RSA preparations were heated at $70^{\circ}C$ for 30 min, it was noted that RSA-FO was much more stable than RSA-CTRL, presumably due to higher number of long chain fatty acids (FA) such as palmitic acid or EPA. In conclusion, we provided evidences that oral administration of FO in the rat stabilizes serum albumin, due to an increase in the number of protein bound long chain fatty acids (e.g. palitic acid and EPA). We speculate that the stabilization of serum albumin and perhaps other proteins could prevent changes of antigenicity due to protein denaturation and glycosylation, which may trigger pathological autoimmune responses, suggesting that this action may be involved in the mode of action of FO in RA and other chronic inflammatory diseases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3911-3924
• /
• 2016

Compared to the classical cryptography, lattice-based cryptography is more secure, flexible and simple, and it is believed to be secure against quantum computers. In this paper, an efficient signature scheme is proposed from the ring learning with errors (R-LWE), which avoids sampling from discrete Gaussians and has the characteristics of the much simpler description etc. Then, the scheme is implemented in C/C++ and makes a comparison with the RSA signature scheme in detail. Additionally, a linearly homomorphic signature scheme without trapdoor is proposed from the R-LWE assumption. The security of the above two schemes are reducible to the worst-case hardness of shortest vectors on ideal lattices. The security analyses indicate the proposed schemes are unforgeable under chosen message attack model, and the efficiency analyses also show that the above schemes are much more efficient than other correlative signature schemes.

• 정보보호학회논문지
• /
• 제12권1호
• /
• pp.43-54
• /
• 2002

McEliece introduced a public-key cryptosystem based on Algebraic codes, specially binary classical Goppa which have a good decoding algorithm and vast number of inequivalent codes with given parameters. And the advantage of this system low cost of their encryption and decryption procedures compared with other public-key systems specially RSA, ECC based on DLP(discrete logarithm problem). But in [1], they resent new attack based on probabilistic algorithm to find minimum weight codeword, so for a sufficient security level, much larger parameter size [2048, 1608,81]is required. Then the big size of public key make McEliece PKC more inefficient. So in this paper, we will propose New Type PKC using q-ary Hyperelliptic code so that with smaller parameter(1 over 3) but still work factor as hi인 as McEliece PKC and faster encryption, decryption can be maintained.

• International Journal of Internet, Broadcasting and Communication
• /
• 제16권1호
• /
• pp.17-28
• /
• 2024

As listed as one of the most important requirements for Post-Quantum Cryptography standardization process by National Institute of Standards and Technology, the resistance to various side-channel attacks is considered very critical in deploying cryptosystems in practice. In fact, cryptosystems can easily be broken by side-channel attacks, even though they are considered to be secure in the mathematical point of view. The timing attack(TA) and the simple power analysis attack(SPA) are such side-channel attack methods which can reveal sensitive information by analyzing the timing behavior or the power consumption pattern of cryptographic operations. Thus, appropriate measures against such attacks must carefully be considered in the early stage of cryptosystem's implementation process. The Montgomery multiplier is a commonly used and classical gadget in implementing big-number-based cryptosystems including RSA and ECC. And, as recently proposed as an alternative of building blocks for implementing post quantum cryptography such as lattice-based cryptography, the big-number multiplier including the Montgomery multiplier still plays a role in modern cryptography. However, in spite of its effectiveness and wide-adoption, the multiplier is known to be vulnerable to TA and SPA. And this paper proposes a new countermeasure for the Montgomery multiplier against TA and SPA. Briefly speaking, the new measure first represents a multiplication operand without 0 digits, so the resulting multiplication operation behaves in a very regular manner. Also, the new algorithm removes the extra final reduction (which is intrinsic to the modular multiplication) to make the resulting multiplier more timing-independent. Consequently, the resulting multiplier operates in constant time so that it totally removes any TA and SPA vulnerabilities. Since the proposed method can process multi bits at a time, implementers can also trade-off the performance with the resource usage to get desirable implementation characteristics.