会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Prime number generation method, prime number generation apparatus, and cryptographic system
    • 素数生成方法,素数生成装置和加密系统
    • US07043018B1
    • 2006-05-09
    • US09448728
    • 1999-11-24
    • Masao KasaharaYoshizo SatoYasuyuki Murakami
    • Masao KasaharaYoshizo SatoYasuyuki Murakami
    • H04L9/08
    • G06F17/10H04L9/3033H04L2209/08
    • A prime number generation method for efficiently generating prime numbers that are highly resistant to the P−1 and P+1 methods. These prime numbers are used in a cryptosystem. Prime candidates are first generated, and the generated prime candidates are subjected to prime number judgment by either a probabilistic primality testing method or a deterministic primality testing method. A prime candidate P′ is generated using odd random numbers, a judgment is made as to whether or not that prime candidate P′ satisfies the expression P′≡0, ±1 (mod pi) (where 3≦i≦n) for prime numbers from p3 to pn (where pn is the n'th prime). When that expression is satisfied, that prime candidate P′ is excluded. Only those prime candidates P′ that do not satisfy that condition are subjected to the prime number judgment.
    • 一种用于有效产生对P-1和P + 1方法具有高度抵抗力的素数的素数生成方法。 这些素数在密码系统中使用。 首先生成初始候选,并且通过概率原语测试方法或确定性原语测试方法对所生成的素数候选进行素数判定。 使用奇数随机数产生主要候选者P',判断素数候补P'是否满足表达式P'≡0,±1(mod p 3 <= i <= n)对于从p <3>到p 的质数(其中p N是第n个素数)。 当满足该表达式时,该主要候选者P'被排除。 只有不满足该条件的主要候选者P'才进行素数判定。
    • 7. 发明授权
    • Cryptographic communication method, encryption method, and cryptographic communication system
    • 加密通信方式,加密方式和加密通信系统
    • US06788788B1
    • 2004-09-07
    • US09397983
    • 1999-09-16
    • Masao KasaharaYasuyuki Murakami
    • Masao KasaharaYasuyuki Murakami
    • H04L900
    • H04L9/0847H04L9/083
    • A novel cryptographic communication system including ID-NIKS system with high security. Secret key generation functions and key sharing functions are not separable. Key sharing is also probabilistically possible. A center uses entity-specific random numbers and entity-specific public keys based on ID information for each entity to generate two types of secret key (vectors s and t) in which two numbers serve as the moduli, respectively. The center then sends these secret keys to each entity, and each entity uses these two types of its own entity-specific secret key sent from the center and disclosed public key of another entity (the entity who receives a ciphertext or sends a ciphertext) to generate a common key that is shared by two entities for use in the encrypting of a plaintext into a ciphertext and in the decrypting of a ciphertext into a plaintext.
    • 一种具有高安全性的ID-NIKS系统的新型加密通信系统。 秘密密钥生成功能和密钥共享功能是不可分离的。 密钥共享也是概率可能的。 中心根据每个实体的ID信息使用实体特定的随机数和实体特定的公钥来生成两种类型的秘密密钥(向量s和t),其中两个数字分别用作模数。 中心然后将这些秘密密钥发送给每个实体,每个实体使用这两种类型的自身实体特定的密钥从中心发送并公开另一个实体(接收密文或发送密文的实体)的公开密钥 生成由两个实体共享的共同密钥,用于将明文加密成密文,以及将密文解密为明文。