Abstract:
몽고메리 역원알고리즘을 위한 크기 비교와 차이가 동시에 연산되는 뺄셈 연산 장치 및 그 방법을 개시한다. 일 실시예에 따른 몽고메리 역원알고리즘을 위한 뺄셈 장치는 몽고메리 역원 알고리즘에 사용되는 변수 U 및 변수 V에 대한 차이(U-V) 및 2 n 의 합에 대한 기준값인 2 n +(U-V) 으로부터 U 및 V 의 크기를 비교하는 연산을 수행하는 비교 연산부, 및 상기 비교 연산부에서의 비교 결과를 기반으로 상기 변수 U 및 상기 변수 V 에 대한 비트값의 보수로부터 덧셈 연산을 수행하여 상기 변수 U 및 상기 변수 V의 차이값을 연산하는 뺄셈 연산부를 포함한다.
Abstract:
PURPOSE: A subtraction operation device for a Montgomery inverse algorithm and a method thereof are provided to perform a complementary operation and an add operation based on two variables, thereby comparing and operating sizes at the same time. CONSTITUTION: A comparison operation unit (110) compares the sizes of variable U and variable V. A subtraction operation unit (120) operates a difference value of the variable U and the variable V by performing an add operation with the complement of the bit values for the variable U and the variable V. The comparison operation unit compares the sizes of the variable U and the variable V by considering the most significant bit value of a reference value. When the most significant bit value is 1, the comparison operation unit determines that the variable U is bigger than the variable V. [Reference numerals] (110) Comparison operation unit; (120) Subtraction operation unit; (AA) Variable U; (BB) Variable V
Abstract:
PURPOSE: A modular multiplication device for a password and a method are provided to repetitively perform a twice modulus operation and an add modulus operation, thereby implementing an elliptic curve on a finite field. CONSTITUTION: A coefficient selection unit (110) extracts a coefficient for each bit order for a multiplier from two elements. A twice modulus operation unit (120) performs a first twice modulus operation for a multiplication operation result for a most significant n-bit coefficient and a multiplicand. An add modulus operation unit (130) performs a first add modulus operation for a multiplication operation result for a (n-1) bit coefficient and the multiplicand. A control unit (140) repetitively performs the first twice modulus operation and the first add modulus operation for a lower bit coefficient and the multiplicand. [Reference numerals] (110) Coefficient selection unit; (120) Twice modulus operation unit; (130) Add modulus operation unit; (140) Control unit; (AA) Atom B; (BB) Atom A
Abstract:
A key setting method using a bivariate polynomial in a sensor network is provided to solve the security vulnerability when setting up a key, thereby making the efficient communication possible as enhancing the security of the sensor network. For the cluster-based key distribution, a sensor network is divided by a cluster unit and a bivariate polynomial which is previously distributed from a setup server is distributed to a cluster header(S204). The bivariate polynomial generates a polynomial. One or more sensor nodes are arranged in a cluster area(S206). The cluster header selects partial information and random number of the bivariate polynomial, and then distributes the selected result to the sensor nodes within the cluster(S208). When the key distribution is completed, a pairwise key is set up based on the bivariate polynomial(S212).