公开(公告)号：US08245279B2

公开(公告)日：2012-08-14

申请号：US10921161

申请日：2004-08-19

申请人： Marinus Struik

发明人： Marinus Struik

IPC分类号： H04L29/06

CPC分类号： H04L63/123 ,  H04L63/04 ,  H04L63/0428 ,  H04L63/0876 ,  H04L63/105 ,  H04L63/162

摘要： A method of communicating in a secure communication system, comprises the steps of assembling as message at a sender, then determining a security level, and including an indication of the security level in a header of the message. The message is then sent to a recipient.

摘要翻译： 一种在安全通信系统中进行通信的方法包括以下步骤：在发送方处组装为消息，然后确定安全级别，并且包括消息头部中的安全级别的指示。 然后将该消息发送给收件人。

公开(公告)号：US08213605B2

公开(公告)日：2012-07-03

申请号：US12945234

申请日：2010-11-12

申请人： Daniel Richard L. Brown ,  Robert Philip Gallant ,  Scott Alexander Vanstone ,  Marinus Struik

发明人： Daniel Richard L. Brown ,  Robert Philip Gallant ,  Scott Alexander Vanstone ,  Marinus Struik

IPC分类号： H04L9/30

CPC分类号： H04L63/0823 ,  G06F21/64 ,  H04L9/3066 ,  H04L9/3252

摘要： The present invention provides a new trapdoor one-way function. In a general sense, some quadratic algebraic integer z is used. One then finds a curve E and a rational map defining [z] on E. The rational map [z] is the trapdoor one-way function. A judicious selection of z will ensure that [z] can be efficiently computed, that it is difficult to invert, that determination of [z] from the rational functions defined by [z] is difficult, and knowledge of z allows one to invert [z] on a certain set of elliptic curve points. Every rational map is a composition of a translation and an endomorphism. The most secure part of the rational map is the endomorphism as the translation is easy to invert. If the problem of inverting the endomorphism and thus [z] is as hard as the discrete logarithm problem in E, then the size of the cryptographic group can be smaller than the group used for RSA trapdoor one-way functions.

摘要翻译： 本发明提供了一种新的陷门单向功能。 在一般意义上，使用一些二次代数整数z。 然后找到曲线E和在E上定义[z]的有理图。有理图[z]是陷门单向函数。 z的明智选择将确保可以有效地计算[z]，难以反转，[z]定义的[z]的确定是困难的，而z的知识允许反转[ z]在一组椭圆曲线点上。 每一个合理的地图都是一个翻译和一个同化的组合。 理性地图中最安全的部分是翻译易翻译的同化。 如果反转内生的问题，因此[z]与E中的离散对数问题一样困难，则密码组的大小可以小于用于RSA陷门单向函数的组的大小。

公开(公告)号：US08209533B2

公开(公告)日：2012-06-26

申请号：US11961779

申请日：2007-12-20

申请人： Marinus Struik

发明人： Marinus Struik

IPC分类号： H04L9/00

CPC分类号： H04L9/0838 ,  G06F7/725 ,  H04L9/0844

摘要： A key establishment protocol includes the generation of a value of cryptographic function, typically a hash, of a session key and public information. This value is transferred between correspondents together with the information necessary to generate the session key. Provided the session key has not been compromised, the value of the cryptographic function will be the same at each of the correspondents. The value of the cryptographic function cannot be compromised or modified without access to the session key.

摘要翻译： 密钥建立协议包括生成会话密钥和公共信息的加密函数的值，通常是散列值。 该值在通讯者之间传送，以及生成会话密钥所需的信息。 如果会话密钥尚未被泄露，则密码功能的值在每个记者端都是相同的。 加密功能的值不能在不访问会话密钥的情况下被破坏或修改。

公开(公告)号：US20120137133A1

公开(公告)日：2012-05-31

申请号：US13364267

申请日：2012-02-01

申请人： Marinus Struik

发明人： Marinus Struik

IPC分类号： H04L9/32

CPC分类号： H04L9/0838 ,  G06F7/725 ,  H04L9/0844

摘要： A key establishment protocol includes the generation of a value of cryptographic function, typically a hash, of a session key and public information. This value is transferred between correspondents together with the information necessary to generate the session key. Provided the session key has not been compromised, the value of the cryptographic function will be the same at each of the correspondents. The value of the cryptographic function cannot be compromised or modified without access to the session key.

摘要翻译： 密钥建立协议包括生成会话密钥和公共信息的加密函数的值，通常是散列值。 该值在通讯者之间传送，以及生成会话密钥所需的信息。 如果会话密钥尚未被泄露，则密码功能的值在每个记者端都是相同的。 加密功能的值不能在不访问会话密钥的情况下被破坏或修改。

公开(公告)号：US20120047363A1

公开(公告)日：2012-02-23

申请号：US13284770

申请日：2011-10-28

申请人： Marinus Struik

发明人： Marinus Struik

IPC分类号： H04L29/06

CPC分类号： H04L9/002 ,  G06F7/725 ,  H04L9/0844 ,  H04L9/3066 ,  H04L9/3252 ,  H04L9/3263

摘要： A method of computing a cryptographic key to be shared between a pair of correspondents communicating with one another through a cryptographic system is provided, where one of the correspondents receives a certificate of the other correspondents public key information to be combined with private key information of the one correspondent to generate the key. The method comprises the steps of computing the key by combining the public key information and the private key information and including in the computation a component corresponding to verification of the certificate, such that failure of the certificate to verify results in a key at the one correspondent that is different to the key computed at the other correspondent.

摘要翻译： 提供了一种计算通过密码系统彼此通信的一对通信对方之间共享密码密钥的方法，其中一个通信对方接收到其他通信对方的证书，以将其与该密钥信息的私钥信息相结合 一个通讯员生成密钥。 该方法包括以下步骤：通过组合公钥信息和私钥信息来计算密钥，并在计算中包括对应于证书验证的组件，使得证书的验证失败在一个记者的密钥中得到结果 这与在其他记者计算的密钥不同。

公开(公告)号：US20090316902A1

公开(公告)日：2009-12-24

申请号：US12549075

申请日：2009-08-27

申请人： Marinus Struik

发明人： Marinus Struik

IPC分类号： H04L9/00

CPC分类号： H04L63/0428 ,  H04L1/1803 ,  H04L1/1812 ,  H04L1/1867 ,  H04L29/06 ,  H04L47/34 ,  H04L63/0435 ,  H04L63/06 ,  H04L67/04 ,  H04L67/12 ,  H04L69/329 ,  H04L2209/80 ,  H04W4/12 ,  H04W12/02 ,  H04W12/04 ,  H04W24/00 ,  H04W28/04 ,  H04W28/06 ,  H04W56/0015

摘要： A method of transmitting messages from a sender to a recipient over a wireless channel, the messages including a sequence counter and a frame counter. The method comprises establishing initial values of the sequence counter and the frame counter at the sender. Initial values of the frame counter and the sequence counter are provided to the recipient. The sender sends compressed messages including the value of the sequence counter and not the frame counter and monitors for an acknowledgement of receipt by the recipient. When no acknowledgment is received, the sender sends uncompressed messages until an acknowledgement of receipt is received from the recipient. The sequence counter is incremented and the next value of the frame counter is established as the integer next larger than previous value of the frame counter which is congruent to the sequence counter modulo 256.

摘要翻译： 一种通过无线信道从发送方向接收者发送消息的方法，所述消息包括序列计数器和帧计数器。 该方法包括在发送方建立序列计数器和帧计数器的初始值。 帧计数器和序列计数器的初始值被提供给接收者。 发送方发送压缩消息，包括序列计数器的值，而不是帧计数器，并监视收件人的收到确认。 当没有接收到确认时，发送方发送未压缩的消息，直到从收件人收到收到确认。 序列计数器递增，并且帧计数器的下一个值被建立为接下来大于帧计数器的先前值的整数，其与序列计数器模256一致。

公开(公告)号：US09002003B2

公开(公告)日：2015-04-07

申请号：US11947290

申请日：2007-11-29

申请人： Daniel R. L. Brown ,  Marinus Struik

发明人： Daniel R. L. Brown ,  Marinus Struik

IPC分类号： H04L9/00 ,  H04L9/30 ,  H04L9/08 ,  H04L9/32

CPC分类号： H04L9/3066 ,  H04L9/0861 ,  H04L9/0863 ,  H04L9/3226

摘要： A password protocol uses a multiple word password and provides prompts to a user allowing the user to select the next word in the password from a set of words. The selection of a word causes a client to perform a cryptographic operation and generate a new selection of words. After the password is completely entered, a key is generated from the words selected.

摘要翻译： 密码协议使用多字密码，并向用户提供允许用户从一组单词中选择密码中的下一个单词的提示。 单词的选择使得客户端执行加密操作并生成新的单词选择。 密码完全输入后，会从所选择的单词中生成一个密钥。

公开(公告)号：US08862866B2

公开(公告)日：2014-10-14

申请号：US10885115

申请日：2004-07-07

申请人： Marinus Struik

发明人： Marinus Struik

IPC分类号： H04L29/06 ,  H04L9/08

CPC分类号： H04L63/105 ,  H04L9/00 ,  H04L9/088 ,  H04L63/0428 ,  H04L63/08 ,  H04L63/123 ,  H04L63/162 ,  H04L63/164 ,  H04W12/02

摘要： A method of communicating in a secure communication system, comprises the steps of assembling a message at a sender, then determining a security level, and including an indication of the security level in a header of the message. The message is then sent to a recipient.

摘要翻译： 一种在安全通信系统中进行通信的方法包括以下步骤：在发送器处组装消息，然后确定安全级别，并且包括消息头部中的安全级别的指示。 然后将该消息发送给收件人。

公开(公告)号：US20120221850A1

公开(公告)日：2012-08-30

申请号：US13037018

申请日：2011-02-28

申请人： Marinus Struik

发明人： Marinus Struik

IPC分类号： H04L9/00

CPC分类号： H04L9/0844 ,  H04L9/3066 ,  H04L9/321 ,  H04L2209/20 ,  H04L2209/64 ,  H04L2209/80

摘要： There are disclosed systems and methods for reducing the number of computations performed by a computing device constructing a public key from an implicit certificate associated with a certificate authority in an implicit certificate scheme. In one embodiment, the device first operates on the implicit certificate to derive an integer e. The device then derives a pair of integers (e1, e2) from the integer e, such that each of the pair of integers (e1, e2) has a bit length less than the bit length of the integer e, and such that the ratio of the pair of integers (e1, e2) corresponds to the integer e. The device then computes the public key by combining the integers e1 and e2 with public key contribution data derived from the implicit certificate and a public key of the certificate authority.

摘要翻译： 已经公开了用于减少由隐式证书方案中与证书机构相关联的隐式证书构建公共密钥的计算设备执行的计算次数的系统和方法。 在一个实施例中，设备首先对隐式证书进行操作以导出整数e。 然后，该装置从整数e导出一对整数（e1，e2），使得该对整数（e1，e2）中的每一个具有小于整数e的位长度的位长度，并且使得比 的整数（e1，e2）对应于整数e。 然后，该设备通过将整数e1和e2与从隐式证书导出的公共密钥贡献数据和证书颁发机构的公开密钥相结合来计算公开密钥。

公开(公告)号：US07844051B2

公开(公告)日：2010-11-30

申请号：US11272152

申请日：2005-11-14

申请人： Daniel R. L. Brown ,  Robert P. Gallant ,  Scott A. Vanstone ,  Marinus Struik

发明人： Daniel R. L. Brown ,  Robert P. Gallant ,  Scott A. Vanstone ,  Marinus Struik

IPC分类号： H04L9/30

CPC分类号： H04L63/0823 ,  G06F21/64 ,  H04L9/3066 ,  H04L9/3252

摘要： The present invention provides a new trapdoor one-way function. In a general sense, some quadratic algebraic integer z is used. One then finds a curve E and a rational map defining [z] on E. The rational map [z] is the trapdoor one-way function. A judicious selection of z will ensure that [z] can be efficiently computed, that it is difficult to invert, that determination of [z] from the rational functions defined by [z] is difficult, and knowledge of z allows one to invert [z] on a certain set of elliptic curve points. Every rational map is a composition of a translation and an endomorphism. The most secure part of the rational map is the endomorphism as the translation is easy to invert. If the problem of inverting the endomorphism and thus [z] is as hard as the discrete logarithm problem in E, then the size of the cryptographic group can be smaller than the group used for RSA trapdoor one-way functions.

摘要翻译： 本发明提供了一种新的陷门单向功能。 在一般意义上，使用一些二次代数整数z。 然后找到曲线E和在E上定义[z]的有理图。有理图[z]是陷门单向函数。 z的明智选择将确保可以有效地计算[z]，难以反转，[z]定义的[z]的确定是困难的，而z的知识允许反转[ z]在一组椭圆曲线点上。 每一个合理的地图都是一个翻译和一个同化的组合。 理性地图中最安全的部分是翻译易翻译的同化。 如果反转内生的问题，因此[z]与E中的离散对数问题一样困难，则密码组的大小可以小于用于RSA陷门单向函数的组的大小。