会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • 신용정보보호를 위한 전자지불방법 및 그 방법을 기록한컴퓨터로 읽을 수 있는 기록매체
    • 用于保护信任信息的电子支付方法和记录方法的计算机可读介质
    • KR100323138B1
    • 2002-02-04
    • KR1019990066755
    • 1999-12-30
    • 문상재유형소이정엽코렉주식회사
    • 문상재최승혁이정엽유형소
    • G06Q20/40
    • 본발명은신용정보보호를위한전자지불방법에관한것이다. 그방법은쇼핑몰에서쇼핑몰의 MSEQ를생성하여 CertM, CertT와함께고객으로전송하는단계; 고객은 CertM 및 CertT에에러가있는지를검사하여에러가있으면에러발생을표시하고지불과정을종료하는단계; 고객이신용기관의공개키를이용하여고객비밀정보(SEC), IDS, MSEQ, PI, H(OI)를암호화한값(PT) 및그 해쉬코드인 HS를생성하는단계; 고객이임시키 K1을생성하고, 쇼핑몰의공개키를이용하여 (P{IDS, MSEQ, PI, OI, PT, K1})을생성하여쇼핑몰로전송하는단계; 쇼핑몰에서 P{IDS, MSEQ, PI, OI, PT, K1}을복호화하고, 고객으로전송한 MSEQ와복호화한 MSEQ가동일한지와 PI와 OI의내용이맞는지를검사하여에러유무를판단하는단계; 에러가없다고판단되면쇼핑몰에서임시키 K2를생성하고, 신용기관의공개키를이용하여 P{IDS, MSEQ, PI, H(OI), PT, K2}를생성하여신용기관으로전송하는단계; 신용기관에서 P{IDS, MSEQ, PI, H(OI), PT, K2}를복호화한후, PT를복호화하여 CARD, VAL, PSWD, CID, MID, TID, MSEQ, PI, H(OI)를구하는단계; (h)신용기관에서, 쇼핑몰에서전송된 MID, MSEQ, PI, H(OI) 각각과고객에서전송된 MID, MSEQ, PI, H(OI) 각각이모두서로같은지, 또는 CID, CARD, VAL, PSWD이유효한지를검사하여, 같거나유효하면지불을승인하고, 신용기관의지불승인번호(APPN)과 HT(HS 및 APPN의해쉬코드)를생성하여쇼핑몰로전송하는단계; 쇼핑몰은 APPN과 HT를수신하여이를고객으로전송하고, 고객은 HS와 APPN을이용하여자신이생성한 HT와수신한 HT가동일한경우지불과정을정상적으로종료하는단계를포함함을특징으로한다. 본발명에따르면, SSL을이용하지않고공개키암호화를이용하여고객의신용정보를신용기관만이복호화할수 있도록함으로써전자지불시고객정보유출에대해안전하다.
    • 2. 发明公开
    • SSL기반의 신용정보보호를 위한 전자지불방법 및 그방법을 기록한 컴퓨터로 읽을 수 있는 기록매체
    • 基于安全的基于层次的电子支付方法,用于信用信息安全和记录媒体,可以通过记录方法的计算机进行阅读
    • KR1020000017947A
    • 2000-04-06
    • KR1019990066751
    • 1999-12-30
    • 문상재유형소이정엽코렉주식회사
    • 문상재최승혁이정엽유형소
    • G06Q20/40
    • PURPOSE: A secure socket layer based electronic payment method for credit information security and the recording media which can be read through the computer recording the method are provided in the electronic commerce. CONSTITUTION: The secure socket layer based electronic payment method for credit information security comprises: a step(a) that generates MSEQ in shopping mall computer and transmits to a client computer; a step(b) that generates PT and HS; a step(c) that compares and checks PI and OI in shopping mall computer; a step(d) that transmits MSEQ, PI, H(OI) and PT to the computer of credit institute; a step(e) that gets SEC, IDS, MSEQ, PI and H(OI), and generates the relevant error signal if there is an error; a step(f) that generates and transmits APPN and HT to the shopping mall computer, and transmits the relevant error signal to shopping mall if there is an error; and a step(g) that finalizes the payment process.
    • 目的:在电子商务中提供了一种用于信用信息安全的基于安全套接字层的电子支付方法和可以通过记录该方法的计算机读取的记录媒体。 构成:用于信用信息安全的基于安全套接字层的电子支付方法包括:(a)在购物中心计算机中生成MSEQ并发送给客户端计算机; 产生PT和HS的步骤(b); 步骤(c)比较和检查购物中心电脑中的PI和OI; 向信用研究所的计算机发送MSEQ,PI,H(OI)和PT的步骤(d); 获得SEC,IDS,MSEQ,PI和H(OI)的步骤(e),并且如果存在错误则产生相关的误差信号; 步骤(f),生成并将APPN和HT发送到商场计算机,并且如果存在错误则将相关的错误信号发送到商场; 以及完成支付流程的步骤(g)。
    • 5. 发明授权
    • 공통 피승수 모듈라 곱셈을 이용한 고속 멱승 방법
    • 使用通用多模式多路复用的高速指导方法
    • KR100257124B1
    • 2000-05-15
    • KR1019970019018
    • 1997-05-16
    • 하재철문상재
    • 하재철문상재
    • G06F7/44
    • PURPOSE: A high-speed power multiplication method using a common multiplicand modular multiplication is provided to calculate a common calculation part of an identical multiplicand in case of a modular multiplication. CONSTITUTION: An exponent E is k bits. If a Hamming weight is k/2, about 3k/2 number of modular multiplication is needed. Every time an ei is '1', a common multiplicand multiplication is performed. Therefore, in case of a binary power multiplication system, the average k/2 number of the common multiplicand modular multiplication and the k/2 number of a general modular multiplication are needed.
    • 目的:提供一种使用公共乘法乘法的高速幂乘法,用于在乘法运算的情况下计算相同被乘数的公共计算部分。 构成:指数E为k位。 如果汉明重量是k / 2,则需要大约3k / 2个模数乘法。 每次ei为'1'时,执行公共乘法乘法。 因此,在二进制功率乘法系统的情况下,需要公共乘法器乘法的平均k / 2个数和一般乘法的k / 2个数。
    • 8. 发明公开
    • CRT에 기초한 RSA 공개키 암호화 방식을 이용한디지털 서명방법 및 그 장치
    • 使用基于CRT的RSA公钥编码方法进行数字签名的方法与装置
    • KR1020030070733A
    • 2003-09-02
    • KR1020020010256
    • 2002-02-26
    • 주홍정보통신주식회사하재철문상재
    • 신영건하재철문상재김승주임선간안숭명
    • H04L9/30
    • H04L9/004G06F7/723H04L9/302H04L9/3249
    • PURPOSE: A method and an apparatus for digital signature using a CRT(Chinese Remainder Theorem)-based RSA(Rivest, Shamir, and Adleman) public key encoding method are provided to reduce the amount of calculation by using a compatible structure with an existing system without adding new parameters. CONSTITUTION: A value of Sp is obtained from a mathematical expression of Sp=M¬dp mod p(104). A value of Sq is obtained from the mathematical expression of Sq=M¬dq mod q(105). A value of T as an authentication value is obtained from the mathematical expression of T=T1+T2(108). A value of S1 is obtained from the mathematical expression of S1=((q+T)q¬-1 mode p)Sp(109). A value of S2 is obtained from the mathematical expression of S2=((p+T)p¬-1 mode q)Sq(110). A value of S as a signature value is obtained from the mathematical expression of S=S1+S2 mode n(111).
    • 目的:提供使用基于CRT(中国剩余定理)的RSA(Rivest,Shamir和Adleman)公钥编码方法进行数字签名的方法和装置,以通过使用与现有系统的兼容结构来减少计算量 而不添加新参数。 构成:Sp的值从Sp = Mdd mod mod(104)的数学表达式获得。 从Sq = Mdq mod q(105)的数学表达式获得Sq的值。 从T = T1 + T2(108)的数学表达式获得T作为认证值的值。 从S1 =((q + T)q1--1模式p)Sp(109)的数学表达式获得S1的值。 从S2 =((p + T)p-1模式q)Sq(110)的数学表达式获得S2的值。 从S = S1 + S2模式n(111)的数学表达式获得S作为签名值的值。
    • 9. 发明公开
    • 모듈라 곱셈장치
    • 模块化驱动装置
    • KR1020020076600A
    • 2002-10-11
    • KR1020010016579
    • 2001-03-29
    • 문상재하재철주홍정보통신주식회사
    • 문상재하재철신영건
    • G06F7/52
    • PURPOSE: A modular multiplying device is provided to use a carry saved type adder including a proper-sized carry propagation adder for making a carry propagation in one block be permitted for supplying a circuit structure of a high speed modular multiply having a low load hardware and increasing a calculating velocity. CONSTITUTION: In a carry storage-shaped adder using a CPU for a n-bit multiplication, 'n' pieces of full adders are bundled 'b' pieces by 'b' pieces, and divides into "m=n/b" pieces of blocks. Each block is constituted using a CPU, respectively. In a multiplication for embodying a Montgomery algorithm, a size of adders(530,540) which are used in a modular multiplication of n-bit is reduced as one to 'k', and the adders(530,540) and a register(510) are constituted as a size of "n/k=w bit". A multiplication is performed by repetitions of 'k' times.
    • 目的:提供一种模拟乘法装置,使用携带保存型加法器,其包括适当大小的进位传播加法器,用于使得在一个块中的进位传播被允许用于提供具有低负载硬件的高速模块化乘法的电路结构, 增加计算速度。 构成:在使用CPU进行n位乘法的进位存储形状的加法器中,'n'个全加法器通过'b'段捆绑成'b'个部分,并分成“m = n / b” 块。 每个块分别由CPU构成。 在实现蒙哥马利算法的乘法中,在n比特的模乘中使用的加法器(530,540)的大小被减少为一个到'k',并且加法器(530,540)和寄存器(510)被构成 作为“n / k = w位”的大小。 通过重复“k”次执行乘法。
    • 10. 发明公开
    • 모듈러곱셈기
    • 模块化乘法器
    • KR1020000009759A
    • 2000-02-15
    • KR1019980030386
    • 1998-07-28
    • 문상재
    • 문상재오중효강창구
    • G06F7/52
    • PURPOSE: A modular multiplier is provided to be capable of getting multiplicand addition, modulus addition and result of shifted multiplication within 1 clock cycle when montgomery modular multiplication is carried out. CONSTITUTION: The modular multiplier comprises first carry storing adder for adding previous value to multiplication of two numbers, second carry storing adder for adding a output of the first carry storing adder to a modulus according to a last bit value of the output of the first carry storing adder, register for storing a output of the second carry storing adder with the exception of a least significant bit and outputting the stored value, and carry propagation adder for receiving and outputting a output of the second carry storing adder with the exception of a least significant bit.
    • 目的:提供模乘法器,以便在进行montgomery模数乘法时,能够在1个时钟周期内获得被乘数加法,模数相加和移位乘法的结果。 构成:模乘器包括第一进位存储加法器,用于将先前值加到两个数乘法中,第二进位存储加法器,用于将第一进位存储加法器的输出与根据第一进位输出的最后位值相加的模数相加 存储加法器,用于除了最低有效位之外存储第二进位存储加法器的输出的寄存器,并输出存储的值,并且传送加法器用于接收和输出第二进位存储加法器的输出,除了最少 有意义