会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Scheme for carrying out modular calculations based on redundant binary calculation
    • 基于冗余二进制计算的模块化计算方案
    • US06175850B1
    • 2001-01-16
    • US09017520
    • 1998-02-02
    • Shinji IshiiKiyoto TanakaKatsuichi Oyama
    • Shinji IshiiKiyoto TanakaKatsuichi Oyama
    • G06F738
    • G06F7/723G06F7/72G06F2207/7223
    • A scheme for carrying out modular calculations which is capable of carrying out modular calculations using redundant binary calculation even when a number of bits of the mantissa (dividend) is larger than a number of bits of the modulus (divisor). In this scheme, the divisor c in the divisor register is left shifted by (i−j) digits when a number of digits j of the divisor c is less than a number of digits i that can be stored in the divisor register, and the modular reduction a mod c is calculated up to (i−j)-th decimal place using the dividend a and the left shifted divisor c. Alternatively, the divisor c given in h-ary notation in the divisor register is left shifted by (i−j) digits when a number of digits j of the divisor c is less than a number of digits i that can be stored in the divisor register, while the dividend a given in h-ary notation in the dividend register is left shifted by (k−l) digits when a number of digits l of the dividend a is less than a number of digits k that can be stored in the dividend register, where k≧i. Then, the modular reduction a mod c is calculated up to a digit of [(k−l)−(i−j)]-th power of h using the left shifted dividend a and the left shifted divisor c to obtain a remainder, and this remainder is right shifted by (k−l) digits.
    • 即使当尾数(余数)的位数大于模数(除数)的比特数时,也可以进行使用冗余二进制计算的模块化计算的模块化计算的方案。 在该方案中,当除数c的数字j小于可存储在除数寄存器中的数字i的数量时,除数寄存器中的除数c被移位(ij),并且模块化减少 使用派息a和左偏移除数c,计算出高达(ij)小数位的mod c。 或者,当除数c的数字j小于可以存储在除数寄存器中的数字i的数量i时,除数寄存器中用h-ary符号给出的除数c由(ij)位移动, 而当股息a的数字l的数字小于可以存储在股息登记册中的数字k数量时,在红利寄存器中以h-ary符号给出的红利被移位(kl)位,其中 k> = i。 然后,使用左偏移除数a和左移位除数c计算出模数减少模mod至高达[(kl) - (ij)]次幂的数字,以获得余数,该余数为 右移(kl)位数。
    • 2. 发明授权
    • System and scheme of cipher communication
    • 密码通信系统和方案
    • US5604807A
    • 1997-02-18
    • US425904
    • 1995-04-20
    • Toshikazu YamaguchiKiyoto Tanaka
    • Toshikazu YamaguchiKiyoto Tanaka
    • H04L9/08H04L9/10H04L9/12
    • H04L9/12H04L9/083H04L9/0838
    • A cipher communication system and scheme capable of realizing the cipher communication without affecting the already existing application programs and hardware, and establishing a synchronization at the start and end of the cipher communication. In the cipher communication, the session key generated by the key distribution center are obtained and shared at the first and second terminals at a timing of a request for establishing a cipher communication session between the first and second terminals, and then the cipher communication between the first and second terminals is carried out by using the shared session key. The synchronization at the start and end of the cipher communication is established by the matching of the synchronization data transmitted from the first terminal to second terminal or its enciphered form with the return data from the second terminal to the first terminal which is either the synchronization data as received at the second terminal, or its enciphered form depending on the communication state of the second terminal.
    • 一种能够实现密码通信而不影响现有应用程序和硬件的密码通信系统和方案,并且在密码通信的开始和结束时建立同步。 在密码通信中,在请求建立第一和第二终端之间的密码通信会话的定时,在密钥分发中心生成的会话密钥在第一和第二终端获得和共享,然后在 通过使用共享会话密钥来执行第一和第二终端。 通过从第一终端发送到第二终端或其加密形式的同步数据与从第二终端到作为同步数据的第一终端的返回数据的匹配来建立密文通信开始和结束时的同步 如在第二终端处接收到的,或者其加密形式,取决于第二终端的通信状态。