Abstract:
Disclosed are an attack detecting apparatus and method for detecting an attack in a network system by changing the size of a window. The attack detecting apparatus may comprise a window size changing section for changing the size of the window to be applied to traffic; and an abnormal situation detector for applying the window with the changed size to the traffic and detecting the abnormal situation of the traffic.
Abstract:
본 발명은 타원 곡선 암호 방식(ECC: Elliptic Curve Cryptography)에서 공개키를 생성하는 방법 및 상기 방법을 수행하는 시스템에 관한 것이다. 본 발명에 따른 타원 곡선 암호 방식(ECC: Elliptic Curve Cryptography)에서 공개키를 생성하는 방법은, 비밀키(k)를 부호가 있는 삼진수에 대한 타우-애딕(τ-adic) 형태로 변환하는 단계, 타원 곡선, 프로베니우스 맵핑(Frobenius mapping) 및 특성 방정식을 이용하여 상기 타우-애딕 형태로 변환된 비밀키의 시퀀스 길이를 감소시키는 단계 및 상기 시퀀스 길이가 감소된 비밀키에 상기 타원 곡선의 한 점(P)을 결합하여 공개키(kP)를 계산하는 단계를 포함한다. 타원 곡선 암호 방식(ECC: Elliptic Curve Cryptography), 프로베니우스 맵핑(Frobenius mapping), 코블리츠 방법(Koblitz method), 타우-애딕(τ-adic), 스플리팅 알고리즘(splitting algorithm), 공개키 암호 시스템
Abstract:
PURPOSE: A computer system and method are provided to monitor operation that one process dynamically connects an executable code library to the other process and to block the operation. CONSTITUTION: A computer system(100) a monitoring unit(120) and a blocking unit(130). The monitoring unit monitors operation that one process dynamically connects an executable code library to the other process. In case the operation occurs, the blocking unit blocks the connection of the executable code library. The monitoring unit comprises a call monitoring unit and a connection confirmation unit.
Abstract:
A tag authentication method using the rotation and a tag and a reader for executing the method are provided to completely synchronize the leader and the tag by using the rotation factor and the rotation function. A tag authentication method using the rotation is as follows. A reader produces the first random number as the challenge(S301). A tag produces the second random number as the blinding factor(S302). The first random number is transmitted to the tag by the reader(S303). The tag produces the rotation factor by using the first random number and the first secrete value(S304). The tag calculates the first verification value based on the second random number, the second secrete value, and the rotation factor(S305). The tag transmits the first verification value and the second random number generated as the blinding factor to the reader(S306). The reader produces the rotation factor by using the second random number and the first secrete value(S307). The reader calculates the second verification value based on the first random number, the second secrete value, and the rotation factor(S308). The first verification value and the second verification value are compared by the reader(S309).
Abstract:
A method for generating a public key in an elliptic curve cryptography and a system for executing the same are provided to generate an optimized public key by applying a splitting algorithm to a public key calculated through a private key where sequence length is reduced. A method for generating a public key in an elliptic curve cryptography includes the steps of: transforming a private key in a tau-adic pattern for a triple number having a sign(S401); reducing the sequence length of the private key transformed in the tau-adic pattern by using an elliptic curve, Frobenius mapping, and a characteristic equation(S402); and calculating a public key by joining one point to the private key having the reduced sequence length(S403).