会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 13. 发明授权
    • Machine parts protecting system
    • 机械部件保护系统
    • US4309169A
    • 1982-01-05
    • US219712
    • 1980-12-24
    • John Petro
    • John Petro
    • B23K7/00B23Q11/00F16P7/00F24F9/00F27D7/00
    • B23Q11/00
    • A machine parts protecting system for protecting those parts of a machine that may be in close proximity to high temperature flames. This system is for a machine used for processing workpieces and has a plurality of workpiece holding members which are indexed in a stop-and-go fashion through a number of operating stations. The protecting system includes a photo-detector to detect that a workpiece is not being held by one of the workpiece holding members and to send a first signal to a memory circuit which retains that information until a predetermined time when the empty workpiece holding member arrives at an operating station with high temperature flames. At that time the memory circuit initiates a second signal opening a solenoid valve, thereby permitting an air jet to blow the high temperature flames away from the empty workpiece holding member.
    • 机器部件保护系统,用于保护机器的可能接近高温火焰的部件。 该系统是用于加工工件的机器,具有多个工件保持部件,该工件保持部件通过多个操作台以一种停止的方式进行分度。 保护系统包括光检测器,用于检测工件不被其中一个工件保持构件保持,并且向保存该信息的存储电路发送第一信号,直到空工件保持构件到达的预定时间为止 具有高温火焰的操作台。 此时,存储电路启动打开电磁阀的第二信号,从而允许空气喷射将高温火焰吹离空工件保持构件。
    • 14. 发明授权
    • Method of passing a cryptographic key that allows third party access to the key
    • 传递允许第三方访问密钥的加密密钥的方法
    • US06724893B1
    • 2004-04-20
    • US08722385
    • 1996-10-11
    • John Petro
    • John Petro
    • H04K100
    • H04L9/0894H04L9/088H04L9/3252
    • A method of passing a cryptographic key that allows recovery of the key by a third party by generating a first random number by a first user; generating “key1” by the first user; generating a second random number “k2a” by the first user; computing “y1” by the first user; computing “y2” by the first user; computing “r1” by the first user; computing “z” by the first user; computing “s” by the first user; computing “G” by the first user; passing (G,z,r1,s) from the first user to the second user; receiving “Y” by the second user; computing “T” by the second user; computing “y1” by the second user; computing “k1a” by the second user; computing “key1” by the second user; intercepting, by a third party, (G,z,r1,s) transmitted from the first user to the second user; presenting “G” and “z,” by the third party, to a key-escrow agent; computing “y2” by the key-escrow agent; computing “key2” by the key-escrow agent, where key2=key1; returning “key” from the key-escrow agent to the third party if the third party is authorized to receive “key2”; and using “key2” by the authorized third party, to decrypt an encrypted message sent between the first user and the second user which was encrypted using “key1.”
    • 一种传递加密密钥的方法,该密码密钥允许第三方通过由第一用户生成第一随机数来恢复密钥; 由第一用户生成“key1”; 由第一用户生成第二随机数“k2a”; 由第一用户计算“y1”; 由第一用户计算“y2”; 由第一用户计算“r1”; 由第一用户计算“z”; 由第一个用户计算“s” 由第一用户计算“G”; (G,z,r1,s)从第一用户传递到第二用户; 由第二用户接收“Y”; 由第二用户计算“T” 由第二用户计算“y1”; 由第二用户计算“k1a”; 由第二用户计算“key1”; 由第三方拦截从第一用户发送到第二用户的(G,z,r1,s); 由第三方提交“G”和“z”到密钥托管代理; 由密钥托管代理计算“y2”; 通过密钥托管代理计算“key2”,其中key2 = key1; 如果第三方被授权接收“key2”,则从密钥托管代理返回“密钥”到第三方; 并且由授权的第三方使用“key2”来解密使用“key1”加密的在第一用户和第二用户之间发送的加密消息。
    • 15. 发明授权
    • Device for and method of preforming an N-bit modular multiplication in
approximately N/2 steps
    • 以大约N / 2步进进行N位模乘的装置和方法
    • US5349551A
    • 1994-09-20
    • US99490
    • 1993-07-30
    • John Petro
    • John Petro
    • G06F7/72G06F7/38G06F7/52
    • G06F7/722
    • The present invention relates to a device for and a method of performing an n-bit modular multiplication of A.times.B modulo C in approximately n/2 steps, where A denotes a binary multiplier, B denotes a binary multiplicand, and C denotes a binary modulus. A, B, and -C are stored in registers. All variables needed to perform the A.times.B modulo C are generated. A partial product register is initialized. The multiplier A is scanned two bits at a time. The value of these two bits determines the multiple of B added to the partial product register. The values 4C, 2C, and C are subtracted from the partial product. If any of these subtractions result in a negative number the result of that subtraction is discarded. The partial product is then shifted two significant positions and stored in the partial product register. These steps are repeated until every bit of A has been scanned. The partial product is then converted to non-redundant form. The value C is then subtracted from the partial product. If the result of this subtraction is positive the result is transmitted as A.times.B modulo C. Otherwise the result of this last subtraction is discarded and the partial product existing just prior to this last subtraction is transmitted as A.times.B modulo C.
    • 本发明涉及一种用于执行大约n / 2个步骤中的AxB模C的n位模乘的装置和方法,其中A表示二进制乘法器,B表示二进制被乘数,C表示二进制模数。 A,B和-C存储在寄存器中。 产生执行AxB模C所需的所有变量。 部分产品寄存器被初始化。 乘法器A一次扫描两位。 这两个位的值决定了添加到部分积寄存器中的B的倍数。 从部分乘积中减去值4C,2C和C。 如果这些减法中的任何一个导致负数,则该减法的结果被丢弃。 然后将部分乘积移位两个有效位置并存储在部分积寄存器中。 重复这些步骤,直到扫描A的每一位。 然后将部分产品转换为非冗余形式。 然后从部分乘积中减去值C. 如果该减法的结果为正,则结果以AxB模C方式传输。否则,最后减法的结果将被丢弃,而在最后一次减法之前存在的部分积被发送为AxB模C。