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

11. 发明授权

US5345506A Mutual authentication/cipher key distribution system 失效
标题翻译：相互认证/密钥分发系统
公开(公告)号：US5345506A
公开(公告)日：1994-09-06
申请号：US70730
申请日：1993-06-02
申请人： Hideki Tsubakiyama , Masayoshi Oohashi , Keiichiro Koga
发明人： Hideki Tsubakiyama , Masayoshi Oohashi , Keiichiro Koga
IPC分类号： G09C1/00 , H04L9/06 , H04L9/08 , H04L9/14 , H04L9/32 , H04K1/00
CPC分类号： H04L9/0847 , H04L9/3273 , H04L2209/80
摘要： A communication network and its user i has a device for implementing a common key cryptosystem, an identifier of the user i represented by ID.sub.i which is made public in the network, an authentication key of a user i represented by S.sub.i is known only to the network and the user i and these identifiers and authentication keys of all the users are stored in a database of the network. Data for authentication and encrypted data of a cipher key for the subsequent privacy communication are sent from the network to the user, the user presents his identifier (ID) to the network, after which up to three interactions take place between the network and the user to perform the required authentications and distribution of the cipher key.
摘要翻译：通信网络及其用户i具有用于实现公共密钥密码系统的设备，由网络中公开的IDi表示的用户i的标识符，由Si表示的用户i的认证密钥仅对网络是已知的并且所有用户的用户i和这些标识符和认证密钥存储在网络的数据库中。用于后续隐私通信的密码密钥的认证数据和加密数据从网络发送给用户，用户向网络呈现他的标识符（ID），之后在网络和用户之间进行三次交互执行密码密钥的所需认证和分发。

12. 发明授权

US4797887A Sequential decoding method and apparatus 失效
标题翻译：顺序解码方法及装置
公开(公告)号：US4797887A
公开(公告)日：1989-01-10
申请号：US921517
申请日：1986-10-22
申请人： Norikazu Yamasaki , Keiichiro Koga
发明人： Norikazu Yamasaki , Keiichiro Koga
IPC分类号： G06F11/10 , H03M13/00 , H03M13/39
CPC分类号： H03M13/39
摘要： A sequential decoding of a convolutionally encoded sequence has been proposed. Decoding is carried out by extending paths along the branches of code-tree over plural tree levels at a time and calculating likelihood (metric) of the extended paths referring to the received sequence. Decoding is terminated when it proceeds to a node belonging to the last tree level of a data block. Then, one of the extended sequences associated with a node located at the last tree level which has the largest metric is output as a decoded sequence.
摘要翻译：已经提出了卷积编码序列的顺序解码。一次通过在多个树级上沿着码树的分支延伸路径进行解码，并且根据接收的序列计算扩展路径的可能性（度量）。当进行到属于数据块的最后一个树级的节点时，解码被终止。然后，将与位于具有最大度量的最后树级的节点相关联的扩展序列之一作为解码序列输出。

13. 发明授权

US4468769A Error correcting system for correcting two or three simultaneous errors in a code 失效
标题翻译：错误纠正系统，用于纠正代码中的两个或三个同时发生的错误
公开(公告)号：US4468769A
公开(公告)日：1984-08-28
申请号：US349319
申请日：1982-02-16
申请人： Keiichiro Koga
发明人： Keiichiro Koga
IPC分类号： H03M13/15 , G06F11/10
CPC分类号： H03M13/15
摘要： An improved two or three error correcting system for BCH code (Bose, Chaudhuri, Hocquenghem code) has been found. In case of a two error correction system, a first syndrome A.sub.1 and a second syndrome A.sub.2 are obtained from a reception code C'=(a.sub.1 ', a.sub.2 ', . . . , a.sub.n '): ##EQU1## Then, S.sub.1 =A.sub.1 +.alpha..sup.n-t, and S.sub.2 =A.sub.2 +.alpha..sup.3(n-t) are obtained, for every value of t, where n is a code length, t is an integer equal to or less than n, and .alpha. is a primitive element of a Galois field. When A.sub.1 .noteq.0, a t'th bit a.sub.t ' is corrected by inverting the same on the condition that the t'th bit of S.sub.2 is equal to the t'th bit of S.sub.1.sup.3. When A.sub.1 =0, it is clear that no error exists, and no correction is performed. In case of a three error correction system, a third syndrome ##EQU2## and S.sub.3 =A.sub.3 +.alpha..sup.5(n-t) are obtained further for every value of t, and a correction is performed by inverting the t'th bit according to the value of EL(t)=S.sub.1.sup.6 +S.sub.2.sup.2 +S.sub.1.sup.3 S.sub.2 +S.sub.1 S.sub.3 when A.sub.1.sup.3 +A.sub.2 .noteq.0, or the value of S.sub.1 when A.sub.1.sup.3 +A.sub.2 =0. The structure of the present system is simple since said values S.sub.2, S.sub.3 and EL(t) are obtained merely by a ROM table and an exclusive-OR circuit.
摘要翻译：已经发现了用于BCH码（Bose，Chaudhuri，Hocquenghem码）的改进的两个或三个纠错系统。在两个纠错系统的情况下，从接收码C'=（a1'，a2'，...，an'）获得第一综合征A1和第二综合征A2：然后，S1 = A1 + 对于t的每个值，获得αnt，并且S2 = A2 +α3（nt），其中n是码长，t是等于或小于n的整数，并且α是伽罗瓦域的原始元素。当A1 NOTEQUAL 0时，在第t个第s位等于S13的第t位的条件下，通过将其反相来校正't'的第t位。当A1 = 0时，显然没有错误，不进行校正。在三个错误校正系统的情况下，对于t的每个值进一步获得第三综合征和S3 = A3 +α5（nt），并且通过根据t的值反转第t位来执行校正当A13 + A2为等于0时，EL（t）= S16 + S22 + S13S2 + S1S3，或者A13 + A2 = 0时的S1的值。由于所述值S2，S3和EL（t）仅由ROM表和异或电路获得，所以本系统的结构是简单的。

14. 发明授权

US4320511A Method and device for conversion between a cyclic and a general code sequence by the use of dummy zero bit series 失效
标题翻译：通过使用虚拟零比特序列在循环和一般代码序列之间进行转换的方法和装置
公开(公告)号：US4320511A
公开(公告)日：1982-03-16
申请号：US129486
申请日：1980-03-11
申请人： Keiichiro Koga , Yutaka Yasuda , Ryokichi Saga , Yukio Takimoto
发明人： Keiichiro Koga , Yutaka Yasuda , Ryokichi Saga , Yukio Takimoto
IPC分类号： H04L1/00 , G06F11/10
CPC分类号： H04L1/004
摘要： The invention converts between a cyclic and a general code sequence, each sequence having a succession of normal code blocks and an additional or shorter code block. A zero bit series is hypothetically assumed before the additional code block. In an encoder for producing a cyclic code sequence, the zero bit series is placed before the additional code block by cooperation of a timing control circuit and a divider. In a decoder, a counter times an additional cyclic code block and starts counting while another counter is still counting to time a period, which is the period next preceding a normal cyclic code block, whereby the zero bit series is assumed.
摘要翻译：本发明在循环代码序列和一般代码序列之间转换，每个序列具有连续的正常代码块和附加的或较短的代码块。在附加代码块之前假设假定零位序列。在用于产生循环码序列的编码器中，通过定时控制电路和分频器的配合，将零比特序列置于附加码块之前。在解码器中，计数器乘以附加的循环码块并开始计数，而另一个计数器仍然计数到时间周期，即周期在正常的循环码块之前的周期，从而假设零比特序列。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式