-
公开(公告)号:KR1020020079264A
公开(公告)日:2002-10-19
申请号:KR1020010020052
申请日:2001-04-14
Applicant: 한국전자통신연구원
IPC: H04L9/00
Abstract: PURPOSE: A method for generating a key of an asynchronous mobile communication system is provided to generate the key by using parameters and typeid of the 3GPP(3rd Generation Partnership Project) standard in a process for performing an authentication and key agreement mechanism. CONSTITUTION: A Rand as random number data of 128bits is stored in byte units(100). The first byte, Rand(0) is added to Typeid. The Rand is divided into an upper R1(120) of 64bits and a lower R2(130) of 64bits. T1 of 64bits is obtained by using the R2(130) and an XOR operation value for the R1(120) and a user secret key of 128bits(140) as input values. O1 of 64bits is obtained by using an input sentence as an XOR operation value for the T1 of 64bits and the R1(120) and a key value as the R2(130) and the user secret key of 128bits(150). R1'(160) and R2'(170) are generated from the upper R1(120) of 64bits and the lower R2(130) of 64bits. T2 of 64bits is obtained by using the R2'(170) and an XOR operation value for the R1'(160) and the user secret key of 128bits as input values(180). O2 of 64bits is obtained by using an input sentence as an XOR operation value for the T2 of 64bits and the R1'(160) and a key value as the R2'(170) and the user secret key of 128bits(190). A final output, O is obtained by using the O1 and the O2.
Abstract translation: 目的:提供一种用于生成异步移动通信系统的密钥的方法,用于在用于执行认证和密钥协商机制的过程中使用3GPP(第三代合作伙伴计划)标准的参数和类型来生成密钥。 构成:将Rand作为128位的随机数数据以字节为单位存储(100)。 第一个字节,Rand(0)被添加到Typeid。 兰德被划分为64位的上部R1(120)和64位的较低的R2(130)。 通过使用R2(130)和R1(120)的XOR运算值和128位(140)的用户密钥作为输入值来获得64位的T1。 通过使用输入句子作为64位的T1和R1(120)的XOR运算值和作为R2(130)的键值和128位(150)的用户密钥的输入句子来获得64位的O1。 从64位的上部R1(120)和64位的下部R2(130)生成R1'(160)和R2'(170)。 通过使用R2'(170)和R1'(160)的XOR运算值和128位的用户密钥作为输入值(180)获得64位的T2。 通过使用输入句子作为64位的T2和R1'(160)的XOR运算值以及作为R2'(170)的键值和128位(190)的用户密钥的输入句子来获得64位的O2。 通过使用O1和O2获得最终输出。
-
公开(公告)号:KR1020040055550A
公开(公告)日:2004-06-26
申请号:KR1020030013788
申请日:2003-03-05
Applicant: 한국전자통신연구원
IPC: G06F7/52
Abstract: PURPOSE: A serial-parallel multiplier finding out the multiplication of two elements on a finite field is provided to quickly find out the multiplication of two elements on finite field by performing the modular subtraction for each operation result again after respectively multiplying the divided two multipliers to a multiplicand. CONSTITUTION: A multiplexer(11) alternatively outputs the first and the second multiplier data depending on a selection signal by receiving the multiplier data in parallel. A half multiplier(12) outputs the first operation value by multiplying the first multiplier to the multiplicand data and performing the modular operation, and outputs the second operation value by multiplying the second multiplier to the multiplicand data and performing the modular operation. A storage(13) stores the first operation value at the first cycle and outputs the stored value at the second cycle depending on a clock doubled to the selection signal. A modular subtracter(14) performs the modular subtraction for subtracting the received first operation value from the second operation value.
Abstract translation: 目的:提供一个串行和并行乘法器,找出有限域上的两个元素的乘法,以便通过在将分割的两个乘法器分别乘以后,再次对每个运算结果执行模式减法,快速找出有限域上的两个元素的乘法 被乘数 构成:多路复用器(11)通过并行地接收乘法器数据来交替地输出取决于选择信号的第一和第二乘法器数据。 半乘法器(12)通过将第一乘法器与被乘数数据相乘并执行模数运算来输出第一运算值,并且通过将第二乘法器乘以乘法数据并执行模数运算来输出第二运算值。 存储器(13)在第一周期存储第一操作值,并且根据与选择信号相加的时钟在第二周期输出存储的值。 模块减法器(14)执行模式减法,以从第二操作值减去接收到的第一操作值。
-
公开(公告)号:KR100388059B1
公开(公告)日:2003-06-18
申请号:KR1020000080993
申请日:2000-12-23
Applicant: 한국전자통신연구원
IPC: H04L9/18
Abstract: PURPOSE: A data encryption system using an asymmetric encryption algorithm and a method thereof are provided, which provides a data secret and a data robustness by encrypting a large quantity of messages in a high speed without additional shared encryption key exchange step. CONSTITUTION: According to the data encryption system, an AONT(All-Or-Nothing) conversion part(105) converts input data into a pseudo message using an All-or-nothing method based on a hash function(103). An OAE(Optimal Asymmetric Encryption) part(111) encrypts a part of the pseudo message converted by the above AONT conversion part using the hash function and an asymmetric encryption algorithm. The above AONT conversion part includes a unit calculating an intermediate byproduct K using a divided input message X and N of n-bit nonce(Random Number) after dividing the input message X, and a unit calculating the pseudo message from the above K.
Abstract translation: 目的:提供了一种使用非对称加密算法的数据加密系统及其方法,该系统通过高速加密大量消息而无需额外的共享加密密钥交换步骤来提供数据秘密和数据鲁棒性。 组成:根据数据加密系统,AONT(全或无)转换部分(105)使用基于散列函数的全有或全无方法将输入数据转换为伪消息(103)。 OAE(最佳非对称加密)部分(111)使用散列函数和非对称加密算法对由上述AONT转换部分转换的伪消息的一部分进行加密。 上述AONT转换部分包括一个单元,该单元使用划分输入消息X之后的n比特乱数(随机数)的分割输入消息X和N来计算中间副产品K,以及从上述K计算伪消息的单元。
-
公开(公告)号:KR1019990053174A
公开(公告)日:1999-07-15
申请号:KR1019970072765
申请日:1997-12-23
Applicant: 한국전자통신연구원
IPC: H04L9/18
Abstract: 본 발명은 해쉬함수를 이용한 정보의 무결성 확인방법에 관한 것으로, 특히 정보 보호 분야에서 빈번하게 사용되는 중요한 암호 기술 중의 하나인 해쉬함수를 이용한 정보의 무결성 확인방법에 관한 것이다.
해쉬 함수는 임의의 길이 메시지를 고정된 짧은 길이로 사상시키는 함수로 중요정보의 무결성 확인과 메시지 인증코드의 구성, 디지털 서명의 효율성 증대를 위한 목적으로 사용된다. 알고리즘이 수행 속도면에서 효율적이어야 한다. 실제 암호적으로 안전하고 효율적인 해쉬 함수의 구성은 매우 어려운 문제이다. 따라서, 본 발명은 입력 메시지 워드로부터 추가로 8개의 메시지 워드를 생성하는 메시지 확장을 사용하고, 암호적으로 강한 성질들을 만족하는 부울 함수와 각 단계 연산에서 사용되는 로테이션 연산을 입력 메시지에 의존하는 가변적인 메시지-의존 로테이션(Message-dependent Rotation)을 사용하여 암호적으로 안전하고 효율적인 해쉬함수를 구성한다. 그 결과 정보의 전송시 그 정보에 대한 해쉬 값을 함께 전송함으로써 전송도중에 발생할 수 있는 제 3 자에 의한 정보의 수정 및 삽입 등의 문제에 대해 정보의 무결성을 확인할 수 있고, 데이터 파일의 저장시에 파일에 대한 해쉬 값을 계산해 둠으로서 중요 데이터에 대한 무결성을 확인할 수 있다.-
公开(公告)号:KR100450766B1
公开(公告)日:2004-10-01
申请号:KR1020020062076
申请日:2002-10-11
Applicant: 한국전자통신연구원
IPC: H04L9/00
Abstract: PURPOSE: An encrypting and decrypting method using cellular automata and an apparatus for the same are provided to encrypt and decrypt input data by using structural merits of multi-dimensional cellular automata. CONSTITUTION: A multi-dimensional space is formed by using a plurality of triangular cells(201). Binary digits having predetermined bits are assigned to the triangular cells, respectively(202). Each value of the triangular cells is updated according to the flow of discrete time and a binary random progression is formed by using each value of the triangular cells(207). An encryption process is performed by executing a logical operation for the binary random progression and a plain text binary progression(208).
Abstract translation: 目的:提供一种使用元胞自动机的加密和解密方法及其装置,以利用多维元胞自动机的结构优点对输入数据进行加密和解密。 构成:通过使用多个三角形单元(201)形成多维空间。 具有预定比特的二进制数字分别被分配给三角形单元(202)。 根据离散时间的流程更新三角形单元的每个值,并且通过使用三角形单元的每个值形成二进制随机级数(207)。 通过对二进制随机进展和纯文本二进制进程执行逻辑运算来执行加密过程(208)。
-
6.
公开(公告)号:KR1020030059500A
公开(公告)日:2003-07-10
申请号:KR1020010088363
申请日:2001-12-29
Applicant: 한국전자통신연구원
IPC: H04L9/06
CPC classification number: H04L9/0631 , H04L9/0625 , H04L9/0662
Abstract: PURPOSE: A pseudo-random generator using a block password having an SPN structure and a method thereof are provided to improve a stability side by changing a key value through an update algorithm each time a random is generated. CONSTITUTION: A reseeding module(102) collects a noise suited to each platform. The reseeding module(102) generates a key value based on noise information. The key value is used as an input of a random function. A pseudo-random generating module(104) includes two random function value converters. The pseudo-random generating module(104) uses the key value and a state value as inputs of the first random function value converter to generate the first random function value. The pseudo-random generating module(104) uses the first random function value and the key value as inputs of the second random function value converter to generate the first random function value to generate the second random function value. The pseudo-random generating module(104) outputs the second random function value as a pseudo-random value.
Abstract translation: 目的:提供一种使用具有SPN结构的块密码及其方法的伪随机生成器,以通过每当产生随机时通过更新算法改变键值来改善稳定性侧。 构成:再接种模块(102)收集适合于每个平台的噪声。 重新进给模块(102)基于噪声信息生成键值。 键值用作随机函数的输入。 伪随机生成模块(104)包括两个随机函数值转换器。 伪随机生成模块(104)使用键值和状态值作为第一随机函数值转换器的输入来生成第一随机函数值。 伪随机生成模块(104)使用第一随机函数值和键值作为第二随机函数值转换器的输入来生成第一随机函数值以生成第二随机函数值。 伪随机生成模块(104)将第二随机函数值作为伪随机值输出。
-
公开(公告)号:KR1020020081885A
公开(公告)日:2002-10-30
申请号:KR1020010021336
申请日:2001-04-20
Applicant: 한국전자통신연구원
IPC: G06F7/58
Abstract: PURPOSE: A nonlinear random number series generation device is provided to receive different number series from an FCSR(Feedback with Carry Shift Register), and to search for a corresponding random number series in an S-BOX(Substitution Box), a table of a random number having a good SAC(Strict Avalanch Criterion) characteristic so that it can be applied at a digital signature or an identification check in an electronic document transaction system. CONSTITUTION: The device comprises a plurality of FCSRs(210), a S-BOX(220), and a logic operator(230). The FCRSs(210) generate 8 bit nonlinear random number series, and transmit the 8 bit nonlinear random series to the logical operator(230). The logical operator(230) searches for a nonlinear random series in the S-BOX(220) corresponding to the transmitted 8 bit nonlinear random series. For example, in a case that a 8 bit binary value of the 8 bit nonlinear random number series is "abcdefgh", the logical operator(230) selects a row in the S-BOX(220) corresponding to the former 4 bit("abcd") and a column in the S-BOX(220) corresponding to the latter 4 bit("efgh"). Then, the logical operator(230) generates a 8 bit random number at a point where the column and the row cross in the S-BOX(220).
Abstract translation: 目的:提供一种非线性随机数序列生成装置,用于从FCSR(带进位移位寄存器的反馈)接收不同的数字序列,并在S-BOX(Substitution Box)中搜索相应的随机数字序列, 具有良好的SAC(严格雪崩准则)特征的随机数,使得其可以在电子文档交易系统中的数字签名或识别检查中应用。 构成:该装置包括多个FCSR(210),S-BOX(220)和逻辑运算器(230)。 FCRS(210)生成8位非线性随机数序列,并将8位非线性随机序列发送到逻辑运算符(230)。 逻辑运算符(230)在对应于所发送的8位非线性随机序列的S-BOX(220)中搜索非线性随机序列。 例如,在8位非线性随机数序列的8位二进制值为“abcdefgh”的情况下,逻辑运算符(230)选择与前4位对应的S-BOX(220)中的行(“ abcd“)和对应于后4位(”efgh“)的S-BOX(220)中的列。 然后,逻辑运算器(230)在S-BOX(220)中列和行交叉的点处产生8位随机数。
-
公开(公告)号:KR100457177B1
公开(公告)日:2004-11-16
申请号:KR1020030013788
申请日:2003-03-05
Applicant: 한국전자통신연구원
IPC: G06F7/52
Abstract: PURPOSE: A serial-parallel multiplier finding out the multiplication of two elements on a finite field is provided to quickly find out the multiplication of two elements on finite field by performing the modular subtraction for each operation result again after respectively multiplying the divided two multipliers to a multiplicand. CONSTITUTION: A multiplexer(11) alternatively outputs the first and the second multiplier data depending on a selection signal by receiving the multiplier data in parallel. A half multiplier(12) outputs the first operation value by multiplying the first multiplier to the multiplicand data and performing the modular operation, and outputs the second operation value by multiplying the second multiplier to the multiplicand data and performing the modular operation. A storage(13) stores the first operation value at the first cycle and outputs the stored value at the second cycle depending on a clock doubled to the selection signal. A modular subtracter(14) performs the modular subtraction for subtracting the received first operation value from the second operation value.
Abstract translation: 目的:通过在分开的两个乘法器分别乘以各个运算结果之后再次对每个运算结果进行模减法,提供一个求出有限域上两个元素相乘的串行 - 并行乘法器,以快速找出两个元素在有限域上的乘法 被乘数。 构成:复用器(11)通过并行接收乘法器数据,根据选择信号交替地输出第一和第二乘法器数据。 半乘法器(12)通过将第一乘数与乘数数据相乘并执行模运算来输出第一运算值,并且通过将第二乘数与乘数数据相乘并执行模运算来输出第二运算值。 存储器(13)在第一周期存储第一操作值,并根据加倍到选择信号的时钟在第二周期输出存储的值。 模块减法器(14)执行模减法以从第二操作值中减去接收到的第一操作值。
-
公开(公告)号:KR1020040033158A
公开(公告)日:2004-04-21
申请号:KR1020020062076
申请日:2002-10-11
Applicant: 한국전자통신연구원
IPC: H04L9/00
CPC classification number: H04L9/0662 , G06F7/582 , H04L9/001 , H04W12/08
Abstract: PURPOSE: An encrypting and decrypting method using cellular automata and an apparatus for the same are provided to encrypt and decrypt input data by using structural merits of multi-dimensional cellular automata. CONSTITUTION: A multi-dimensional space is formed by using a plurality of triangular cells(201). Binary digits having predetermined bits are assigned to the triangular cells, respectively(202). Each value of the triangular cells is updated according to the flow of discrete time and a binary random progression is formed by using each value of the triangular cells(207). An encryption process is performed by executing a logical operation for the binary random progression and a plain text binary progression(208).
Abstract translation: 目的:提供使用细胞自动机的加密和解密方法及其装置,通过使用多维细胞自动机的结构优点对输入数据进行加密和解密。 构成:通过使用多个三角形单元(201)形成多维空间。 具有预定位的二进制数字分别被分配给三角形单元(202)。 根据离散时间的流程更新三角形单元的每个值,并且通过使用三角形单元格的每个值(207)形成二进制随机进度。 通过执行二进制随机进程和纯文本二进制进程的逻辑运算来执行加密处理(208)。
-
公开(公告)号:KR1020020051597A
公开(公告)日:2002-06-29
申请号:KR1020000080993
申请日:2000-12-23
Applicant: 한국전자통신연구원
IPC: H04L9/18
CPC classification number: H04L9/302
Abstract: PURPOSE: A data encryption system using an asymmetric encryption algorithm and a method thereof are provided, which provides a data secret and a data robustness by encrypting a large quantity of messages in a high speed without additional shared encryption key exchange step. CONSTITUTION: According to the data encryption system, an AONT(All-Or-Nothing) conversion part(105) converts input data into a pseudo message using an All-or-nothing method based on a hash function(103). An OAE(Optimal Asymmetric Encryption) part(111) encrypts a part of the pseudo message converted by the above AONT conversion part using the hash function and an asymmetric encryption algorithm. The above AONT conversion part includes a unit calculating an intermediate byproduct K using a divided input message X and N of n-bit nonce(Random Number) after dividing the input message X, and a unit calculating the pseudo message from the above K.
Abstract translation: 目的:提供一种使用非对称加密算法及其方法的数据加密系统,其通过在没有额外的共享加密密钥交换步骤的情况下高速加密大量消息来提供数据秘密和数据鲁棒性。 构成:根据数据加密系统,AONT(All-Or-Nothing)转换部分(105)使用基于散列函数(103)的全无变换方法将输入数据转换为伪消息。 OAE(最优非对称加密)部分(111)使用散列函数和非对称加密算法加密由上述AONT转换部分转换的伪消息的一部分。 上述AONT转换部分包括在划分输入消息X之后使用分割输入消息X和n位随机数(随机数)N计算中间副产品K的单元,以及从上述K计算伪消息的单元。
-
-
-
-
-
-
-
-
-