专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

81. 发明公开

KR1020120028432A 타원곡선암호를 위한 연산 장치 및 방법 有权
标题翻译：计算装置和方法用于ELLIPTIC CURVE CRYPTOGRAPHY
公开(公告)号：KR1020120028432A
公开(公告)日：2012-03-23
申请号：KR1020100090249
申请日：2010-09-15
申请人： 고려대학교 산학협력단
发明人： 홍석희 , 서석충 , 조성민 , 권희택
IPC分类号： G06F17/10
CPC分类号： H04L9/3066 , G06F17/10
摘要： PURPOSE: An operation apparatus and a method thereof for ECC(Elliptic Curve Cryptography) are provided to reduce the number of operations and increase performance speed based on converted scalar multiplication. CONSTITUTION: Scalar multiplication about a point on an elliptic curve is set up through a first coordinate axis(310). The preset scalar multiplication is converted into a square form(320). The scalar multiplication of a square form is transformed into the form of a projective coordinate(330). The coordinate value about the first coordinate axis is calculated by using the scalar multiplication(340).
摘要翻译：目的：提供一种用于ECC（椭圆曲线密码学）的操作装置及其方法，以减少操作次数并且基于转换的标量乘法来提高性能速度。构成：通过第一坐标轴（310）设置关于椭圆曲线上的点的标量相乘。预设的标量乘法被转换为正方形（320）。正方形的标量乘法被转换为投影坐标的形式（330）。通过使用标量乘法（340）来计算关于第一坐标轴的坐标值。

82. 发明授权

KR101089121B1 빠른 집합 검증 방법 및 그 장치 有权
标题翻译：快速批量验证方法和设备
公开(公告)号：KR101089121B1
公开(公告)日：2011-12-02
申请号：KR1020050027278
申请日：2005-03-31
申请人： 재단법인서울대학교산학협력재단
发明人： 천정희
IPC分类号： G06F17/10
CPC分类号： H04L9/3066 , G06F7/723 , G06F7/724 , G06F7/725 , H04L9/3252 , H04L2209/56
摘要： 빠른 집합 검증 방법 및 그 장치가 개시된다. 본 발명의 집합 검증 방법은 다수의 멱법(exponentiation)들에 대한 집합 검증 방법으로, (a) 소정의 비트수(t)를 1 이상의 정수로 설정하는 단계; (b) 최대 해밍 웨이트(k)를 0보다는 크거나 같고, 상기 소정의 t 보다는 작거나 같은 정수( )로 설정하는 단계; (c) 검증 멱수 집합(S)으로부터 임의로 다수(n, n은 1 보다 큰 정수)의 검증 멱수들(s
i , 1≤i≤n, i는 정수)을 선택하는 단계-상기 검증 멱수 집합(S)은 그 비트수가 상기 소정의 비트수(t) 이하이고, 그 해밍 웨이트는 상기 최대 해밍 웨이트(k)보다 작거나 같은 원소들을 포함하는 집합임-; (d) 소정의 검증식을 이용하여 검증 결과 값을 산출하는 단계; 및 (e) 상기 검증 결과값이 상기 소정의 패스 조건을 만족하면 상기 다수의 서명들에 대한 검증이 패스되는 것으로 판단하는 단계를 포함한다. 본 발명에 의하면, 검증 오류 확률의 증가 없이, 계산량, 특히 곱셈 연산량이 현저히 줄어든다. 따라서, 다수의 서명에 대한 검증 속도가 상당히 개선되는 효과가 있다.

83. 发明公开

KR1020100121048A ＲＦＩＤ 태그와 리더기의 보안강화 시스템 有权
标题翻译： RFID标签和读取器的保护增强系统
公开(公告)号：KR1020100121048A
公开(公告)日：2010-11-17
申请号：KR1020090040002
申请日：2009-05-08
申请人： 인천대학교 산학협력단
发明人： 이병수 , 이귀봉 , 이민순 , 김준환
IPC分类号： G06K17/00 , H04L9/18
CPC分类号： H04L9/3066 , G06K19/073 , H01Q1/2225
摘要： PURPOSE: A reinforcing security system of an RFID tag and a reader are provided to supply safe identification information, thereby protecting the personal privacy. CONSTITUTION: A reinforcing security system of an RFID(Radio Frequency Identification System) tag and a reader includes an antenna, a transceiver and a transponder. The antenna transmits a receive signal. The decoder which transceiver encodes a signal is included. In order to have single identification information, the transponder of a frequency tag type is electrically programmed. The pattern analysis of the reinforcing security system is based on a public key. The improved mntgomery algorithm is applied to an ECC(Elliptic Curve Cryptography) algorithm based on a discrete logarithm problem.
摘要翻译：目的：提供RFID标签和阅读器的加强安全系统，提供安全识别信息，从而保护个人隐私。规定：RFID（射频识别系统）标签和读取器的加强安全系统包括天线，收发器和应答器。天线发送接收信号。包含收发器编码信号的解码器。为了具有单个识别信息，频率标签类型的应答器被电编程。加强安全系统的模式分析基于公钥。改进的mntgomery算法被应用于基于离散对数问题的ECC（椭圆曲线加密）算法。

84. 发明公开

KR1020100026358A 센서 모트에서의 블록 인덱싱 기반의 타원 곡선 암호 연산 방법, 그 장치 및 이를 기록한 기록 매체 失效
标题翻译：基于传感器动块和记录介质的块索引的ELLIPTIC CURVE CRYPTOGRAPHIC操作的方法和装置
公开(公告)号：KR1020100026358A
公开(公告)日：2010-03-10
申请号：KR1020080085332
申请日：2008-08-29
申请人： 고려대학교 산학협력단
发明人： 홍석희 , 서석충 , 김태현 , 한동국
IPC分类号： H04L9/14 , H04L9/28 , G06F7/64 , H04L12/28
CPC分类号： H04L9/3066 , H04L9/06
摘要： PURPOSE: A method and an apparatus for operating an elliptic curve cryptograph based on block indexing in a sensor mote, and a recording medium are provided to improve operation efficiency by reducing the number of left shifts of a middle result value. CONSTITUTION: A division word is generated(S410). A plurality of blocks is generated by dividing the division window into four bit window size(S420). A first region and a second region are formed through a block indexing(S430). An intermediate result value of a finite field multiplication is generated. The intermediate result value of the finite field multiplication is updated(S440). The intermediate result value of the finite field multiplication is stored in an address increasing according to the number of block indexing(S450). The result value of the finite field multiplication of all words corresponding to the first region is shifted left with four bits(S460).
摘要翻译：目的：提供一种基于传感器微尘中的块索引来操作椭圆曲线密码术的方法和装置，以及记录介质，以通过减少中间结果值的左移位数来提高操作效率。构成：生成分词（S410）。通过将分割窗口划分为四位窗口大小来生成多个块（S420）。通过块索引形成第一区域和第二区域（S430）。生成有限域乘法的中间结果值。更新有限域乘法的中间结果值（S440）。有限域乘法的中间结果值存储在根据块索引数量增加的地址（S450）中。对应于第一区域的所有字的有限域乘法的结果值向左移位四位（S460）。

85. 发明公开

KR1020090006465A 타원 곡선 암호 시스템에 대한 부채널 공격에 대응하는방법 有权
标题翻译：在线性曲线CRYPTOSYSTEM中计算侧面通道攻击的方法
公开(公告)号：KR1020090006465A
公开(公告)日：2009-01-15
申请号：KR1020070069831
申请日：2007-07-11
申请人： 삼성전자주식회사
发明人： 백유진 , 바실조프이고르
IPC分类号： H04L9/14 , H04L12/22
CPC分类号： G06F7/725 , G06F2207/7271 , H04L9/003 , H04L9/004 , H04L9/3066
摘要： A method for countering side-channel attacks to elliptic curve cryptosystem is provided to minimize the computational overhead by performing the validity of the point about the fault attack in the sub ring of the enlargement ring. A defined region of the elliptic curve cryptosystem is extended from the first area to the extension ring(S100). The provisional cipher text is generated from the extension ring. The process for confronting the sub channel attack on the elliptic curve cryptosystem is performed(S200). The process of shielding the electricity analysis attack on the elliptic curve cryptosystem is performed(S220). The process of checking the error injection attack on the elliptic curve cryptosystem is performed(S240). The error injection attack on the elliptic curve cryptosystem is checked(S300). In the state that the sub channel attack on the elliptic curve cryptosystem is not checked, the final cipher text about the first area is generated(S400).
摘要翻译：提供了一种针对椭圆曲线密码系统的侧向信道攻击的方法，通过执行放大环子环中的故障攻击点的有效性来最小化计算开销。椭圆曲线密码系统的限定区域从第一区域延伸到延伸环（S100）。临时密文从扩展环生成。执行对椭圆曲线密码系统的子信道攻击的处理（S200）。执行屏蔽电力分析攻击椭圆曲线密码系统的过程（S220）。执行对椭圆曲线密码系统的错误注入攻击的检查处理（S240）。检查椭圆曲线密码系统的错误注入攻击（S300）。在没有检查子通道攻击椭圆曲线密码系统的状态下，生成关于第一区域的最终密文（S400）。

86. 发明公开

KR1020080019642A 타원 곡선 점 곱셈 有权
标题翻译： ELLIPTIC曲线点多项式
公开(公告)号：KR1020080019642A
公开(公告)日：2008-03-04
申请号：KR1020077030378
申请日：2006-06-29
申请人： 마이크로소프트 코포레이션
发明人： 주,빈 , 펭,민 , 리,시펭
IPC分类号： H04K1/00 , H04L9/30
CPC分类号： G06F7/725 , H04L9/003 , H04L9/3066 , H04L2209/08
摘要： Systems and methods configured for recoding an odd integer and elliptic curve point multiplication are disclosed, having general utility and also specific application to elliptic curve point multiplication and cryptosystems. In one implementation, the recoding is performed by converting an odd integer k into a binary representation. The binary representation could be, for example, coefficients for powers of two representing the odd integer. The binary representation is then configured as comb bit-columns, wherein every bit-column is a signed odd integer. Another implementation applies this recoding method and discloses a variation of comb methods that computes elliptic curve point multiplication more efficiently and with less saved points than known comb methods. The disclosed point multiplication methods are then modified to be Simple Power Analysis (SPA)-resistant. ® KIPO & WIPO 2008
摘要翻译：公开了用于重新编码奇整数和椭圆曲线点乘法的系统和方法，其具有一般实用性，并且还具体应用于椭圆曲线点乘法和密码系统。在一个实现中，通过将奇数整数k转换成二进制表示来执行重新编码。二进制表示可以是例如表示奇整数的两个幂的系数。然后将二进制表示配置为梳状位列，其中每个位列是带符号的奇整数。另一种实现方式应用这种重新编码方法，并且公开了一种梳理方法的变体，它们比已知的梳理方法更有效地计算椭圆曲线点乘积并且具有较少的保存点。然后将所公开的点乘法方法修改为抗电阻简单功率分析（SPA）。 ®KIPO＆WIPO 2008

87. 发明公开

KR1020080012633A 고속 몽고메리 전력 래더 알고리즘에서 사용되는 폴트 검출동작을 구현하기 위한 소수 유한 영역에서의 포인트 덧셈방법 및 덧셈 연산 장치 无效
标题翻译：用于实现快速蒙特卡洛功率梯形图算法中故障检测操作的原始有限域中的添加点的方法和装置
公开(公告)号：KR1020080012633A
公开(公告)日：2008-02-12
申请号：KR1020060073774
申请日：2006-08-04
申请人： 삼성전자주식회사
发明人： 바실조프이고르
IPC分类号： G06F7/50 , G06F7/575 , G06F7/485 , G06F15/00
CPC分类号： G06F7/725 , G06F2207/7261 , G06F2207/7271 , H04L9/3066
摘要： A method and a device for performing point addition and calculating addition in a prime finite field for implementing fault detecting operation used in a fast Montgomery power ladder algorithm are provided to detect fault without error in an encryption system using the fast Montgomery power ladder algorithm. A first coordinate calculator(C11) calculates a first coordinate value of an addition result by performing the addition for first and second points, which are set by using a basic point of an elliptic curve, in the prime finite field. A second coordinate calculator(C12) calculates a second coordinate value of the addition result by performing the addition for the first and second points in the prime finite field. The first and second coordinate calculators calculate the first and second coordinate values by reflecting a difference between the second coordinate values of the first and second points. The fault detection operation used in the fast Montgomery power ladder algorithm is applied to an elliptic curve encryption system.
摘要翻译：提供了一种用于在用于实现在快速蒙哥马利电梯梯形图算法中使用的故障检测操作的主要有限域中执行点加法和计算加法的方法和装置，用于使用快速蒙哥马利电梯梯形图算法在加密系统中检测故障。第一坐标计算器（C11）通过在主有限域中执行通过使用椭圆曲线的基本点设置的第一和第二点的相加来计算加法结果的第一坐标值。第二坐标计算器（C12）通过对主要有限域中的第一和第二点执行相加来计算相加结果的第二坐标值。第一和第二坐标计算器通过反映第一和第二点的第二坐标值之间的差来计算第一和第二坐标值。快速蒙哥马利电梯梯形图算法中使用的故障检测操作被应用于椭圆曲线加密系统。

88. 发明公开

KR1020070100712A 송신기와 적어도 하나의 수신기 사이에 메시지를 전송하는방법 및 시스템 有权
标题翻译：代理人加密的方法和系统
公开(公告)号：KR1020070100712A
公开(公告)日：2007-10-11
申请号：KR1020077013145
申请日：2005-12-08
申请人： 나그라 프랑스 에스에이에스
发明人： 니모어,아드벨크림 , 바비어,이브-마리 , 브레디,니콜라스
IPC分类号： H04L9/00 , H04K1/00 , H04L9/30
CPC分类号： H04N7/1675 , H04L9/3013 , H04L9/3066 , H04L2209/76 , H04N21/2343 , H04N21/2347 , H04N21/4405
摘要： The invention concerns a method for transmitting messages between a transmitter and at least one receiver, comprising the following steps: encrypting the message (m) to be transmitted using a key (a) associated with said transmitter; sending the encrypted message in a conversion module comprising a conversion key ('a->b) and a conversion function; converting the encrypted message received in the conversion module into an encrypted message capable of being decrypted by a key (b) specific to said receiver, said conversion being carried out without the initial message appearing in plain text in the conversion module; sending the converted message to said receiver; decrypting said transformed message received by said receiver using the specific key (b). The invention is characterized in that the conversion key ('a-> b) of the conversion module depends on a non-trivial value exponentiated to the value of the key (a) related to the transmitter and the key (b) related to the receiver. The invention also concerns a system for transmitting messages between a transmitter and at least one receiver, said system being configured to implement the inventive method.
摘要翻译：本发明涉及一种用于在发射机和至少一个接收机之间传输消息的方法，包括以下步骤：使用与所述发射机相关联的密钥（a）对要发射的消息（m）进行加密; 在包括转换密钥（'a-> b）和转换功能的转换模块中发送加密消息; 将所述转换模块中接收到的加密消息转换为能够被所述接收者特定的密钥（b）解密的加密消息，所述转换是在转换模块中没有以纯文本形式出现的初始消息的情况下进行的; 将转换的消息发送到所述接收器; 使用特定密钥（b）对由所述接收机接收的所述变换消息进行解密。本发明的特征在于，转换模块的转换密钥（'a-> b）取决于与发送机有关的密钥（a）的值的非平凡值，以及与接收器。本发明还涉及用于在发射机和至少一个接收机之间传输消息的系统，所述系统被配置为实现本发明的方法。

89. 发明公开

KR1020070057882A 암호 처리 연산 방법, 및 암호 처리 장치, 및 컴퓨터프로그램 无效
标题翻译：加密计算方法，加密设备和计算机程序
公开(公告)号：KR1020070057882A
公开(公告)日：2007-06-07
申请号：KR1020077007172
申请日：2005-09-26
申请人： 소니 주식회사
发明人： 기따무라,이즈루 , 가따기,마사노부 , 다까기,쯔요시
IPC分类号： H04L9/06 , H04L9/28
CPC分类号： G06F7/725 , H04L9/3066
摘要： A device and method realizing safe, high-speed computation of hyperelliptic encryption. The speed of scalar multiplication of a factor D of hyperelliptic curve encryption is increased by executing computation including 1/2 multiplication. For example, scalar computation including 1/2 multiplication of a factor D of a hyperelliptic encryption curve having parameters h(x)=x2+x+h0 and f4=0 with a genus of 2 and a characteristic of 2, or parameters h(x)= x2+h1x+h0 and f4=0, or a parameter h(x)=x is executed. According to the [1/2iD] computation value of a fixed factor D, a table where which of k1, k1', and (k0, k0') is right is recorded is applied and inverse element operation is reduced, thereby, reducing the amount of computation and increasing the computation speed.
摘要翻译：一种实现安全，高速计算超椭圆加密的设备和方法。通过执行包括1/2乘法的计算，增加超椭圆曲线加密因子D的标量乘法速度。例如，标量计算包括具有参数h（x）= x2 + x + h0和f4 = 0的具有2的属性和2的特征的超椭圆加密曲线的因子D的1/2倍，或者参数h（ x）= x2 + h1x + h0和f4 = 0，或执行参数h（x）= x。根据固定因子D的[1 / 2iD]计算值，应用记录k1，k1'和（k0，k0'）哪一个的表，并减少反元素操作，从而减少计算量增加计算速度。

90. 发明授权

KR100720910B1 장치 인증 有权
标题翻译：设备认证
公开(公告)号：KR100720910B1
公开(公告)日：2007-05-25
申请号：KR1020050036429
申请日：2005-04-29
申请人： 블랙베리 리미티드
发明人： 브라운마이클케이 , 리틀허버트에이 , 데이비스디나엘엠
IPC分类号： H04L9/32 , H04L9/30
CPC分类号： H04L9/321 , H04L9/3066 , H04L9/3273
摘要： 제 3 장치와 통신하는 2개의 장치들의 인증이 달성되며, 상기 제 1 및 제 2 장치들 각각은 공유된 비밀값을 소유한다. 인증은 제 3 장치를 사용하여 제 1 장치로부터 제 2 장치로의 인증 값들의 통신을 포함한다. 유사하게, 제 3 장치를 사용하여 제 2 장치로부터 제 1 장치로의 통신이 존재한다. 제 3 장치는 통신된 값들을 보유한다 그 값들은 제 3 장치가 공유된 비밀값을 수신하지 않으면서 제 1 및 제 2 장치들을 인증하는 것을 허용하도록 계산된다. 그 인증은 제 1 장치 및 제 2 장치 간의 통신 채널을 설정하는 데 사용될 수 있다.
인증, 보안성, 통신 채널, 공개키

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式