EFFICIENT POINT VERIFICATION FOR SEMI-STATIC ELLIPTIC CURVE DIFFIE-HELLMAN AUTHENTICATION PROTOCOLS

    公开(公告)号:US20250030543A1

    公开(公告)日:2025-01-23

    申请号:US18356403

    申请日:2023-07-21

    Applicant: NXP B.V.

    Abstract: An elliptic curve point validation method, comprising: receiving a standard projective X and Z coordinate on an elliptic curve; computing X·Z; inverting X·Z to get (XZ)−1; multiplying Z2, (XZ)−1, and a constant √{square root over (b)} resulting in √{square root over (b)}·x−1, where b is a constant of the elliptic curve; multiplying X2 and (XZ)−1 resulting in x; computing Tr(x) and checking that it has a value of 1, where Tr(⋅) is a trace of Frobenius map that maps an input to a value of 0 or 1; computing Tr(√{square root over (b)}x−1) and checking that it has a value of 0; and outputting x and a PointOnCurve value, where the PointOnCurve value indicates whether x is on the elliptic curve.

    Random number generator using multiple entropy sources and a method for generating random numbers

    公开(公告)号:US11126404B2

    公开(公告)日:2021-09-21

    申请号:US16416417

    申请日:2019-05-20

    Applicant: NXP B.V.

    Abstract: A device for providing a random number generator is provided. The device may include a true random number generator, at least one deterministic random number generator, and an exclusive OR logic function. The TRNG has an output and the at least one DRNG has an output. The exclusive OR logic function has a first input coupled to the output of the TRNG and a second input coupled to the output of the at least one DRNG, and an output for providing a random number. The TRNG and the at least one DRNG may include separate and independent entropy sources. A method for generating a random number is also provided.

    Method for performing multiple enrollments of a physically uncloneable function

    公开(公告)号:US10146464B2

    公开(公告)日:2018-12-04

    申请号:US15198104

    申请日:2016-06-30

    Applicant: NXP B.V.

    Abstract: A data processing system having a PUF and method for providing multiple enrollments, or instantiations, of the PUF are provided. A PUF segment includes a plurality of SRAM cells on an integrated circuit. A PUF response from the PUF segment is used to create a first activation code and a first PUF key. A second PUF key may be created from the PUF response. Initially, during a second enrollment, the PUF response is combined with the first activation code to reproduce a codeword. The first secret string is reconstructed by encoding the codeword. The codeword is combined with the first activation code to reproduce the PUF response. Inverse anti-aging is applied to the PUF response. Then a second secret string is generated using a random number generator (RNG). The second secret string is encoded to produce a new codeword. The new codeword is combined with the recovered PUF response to create a second activation code. The second activation coded is hashed with the second secret string to provide a second PUF key.

    METHOD OF GENERATING AN ELLIPTIC CURVE CRYPTOGRAPHIC KEY PAIR

    公开(公告)号:US20180115419A1

    公开(公告)日:2018-04-26

    申请号:US15335177

    申请日:2016-10-26

    Applicant: NXP B.V.

    Abstract: A method is provided for generating an elliptic curve cryptography key pair that uses two topologically identical pseudo-random number generators operating in parallel and in step with each other. One generator operates in the scalar number domain and the other generator operates in the elliptic curve point domain. Parallel sequences of pseudo-random elliptic curve points aG and corresponding scalars a are generated in this manner. A scalar a becomes a private key and an elliptic curve point aG is a public key of a key pair. Each generator is advanced by one iteration successively, and the isomorphic relationship ensures that the point domain generator always contains values which are multiples of the system base point according to values contained in the corresponding position in the number domain generator. In one embodiment, the pseudo-random number generators are each characterized as being lagged Fibonacci generators.

    RANDOM NUMBER GENERATOR USING MULTIPLE ENTROPY SOURCES AND A METHOD FOR GENERATING RANDOM NUMBERS

    公开(公告)号:US20200371752A1

    公开(公告)日:2020-11-26

    申请号:US16416417

    申请日:2019-05-20

    Applicant: NXP B.V.

    Abstract: A device for providing a random number generator is provided. The device may include a true random number generator, at least one deterministic random number generator, and an exclusive OR logic function. The TRNG has an output and the at least one DRNG has an output. The exclusive OR logic function has a first input coupled to the output of the TRNG and a second input coupled to the output of the at least one DRNG, and an output for providing a random number. The TRNG and the at least one DRNG may include separate and independent entropy sources. A method for generating a random number is also provided.

    UPDATING SOFTWARE ON A SECURE ELEMENT
    6.
    发明申请
    UPDATING SOFTWARE ON A SECURE ELEMENT 有权
    更新安全软件的软件

    公开(公告)号:US20150172255A1

    公开(公告)日:2015-06-18

    申请号:US14569588

    申请日:2014-12-12

    Applicant: NXP B.V.

    Abstract: There is disclosed a method of providing a software update to a secure element comprised in a host device, comprising converting the software update into a sequence of ciphertext blocks using a chained encryption scheme, and transmitting said sequence of ciphertext blocks to the host device. Furthermore, there is disclosed a method of installing a software update on a secure element comprised in a host device, comprising receiving, by the host device, a sequence of ciphertext blocks generated by a method of providing a software update of the kind set forth, converting said sequence of ciphertext blocks into the software update, and installing the software update on the secure element. Furthermore, corresponding computer program products and a corresponding host device are disclosed.

    Abstract translation: 公开了一种向包含在主机设备中的安全元件提供软件更新的方法,包括使用链接加密方案将软件更新转换成密码块序列,并将所述密文块序列发送到主机设备。 此外,公开了一种在包含在主机设备中的安全元件上安装软件更新的方法,包括由主机设备接收通过提供所述类型的软件更新的方法生成的密码块序列, 将所述密文块序列转换成软件更新,以及将所述软件更新安装在所述安全元件上。 此外,公开了相应的计算机程序产品和相应的主机设备。

    Method of generating an elliptic curve cryptographic key pair

    公开(公告)号:US10680810B2

    公开(公告)日:2020-06-09

    申请号:US15335177

    申请日:2016-10-26

    Applicant: NXP B.V.

    Abstract: A method is provided for generating an elliptic curve cryptography key pair that uses two topologically identical pseudo-random number generators operating in parallel and in step with each other. One generator operates in the scalar number domain and the other generator operates in the elliptic curve point domain. Parallel sequences of pseudo-random elliptic curve points aG and corresponding scalars a are generated in this manner. A scalar a becomes a private key and an elliptic curve point aG is a public key of a key pair. Each generator is advanced by one iteration successively, and the isomorphic relationship ensures that the point domain generator always contains values which are multiples of the system base point according to values contained in the corresponding position in the number domain generator. In one embodiment, the pseudo-random number generators are each characterized as being lagged Fibonacci generators.

    X-only generic mapping function for PACE protocol

    公开(公告)号:US10484173B2

    公开(公告)日:2019-11-19

    申请号:US15397462

    申请日:2017-01-03

    Applicant: NXP B.V.

    Inventor: Bruce Murray

    Abstract: A method of calculating the x-coordinate(xM) of a point mapping in an elliptic curve Diffie-Hellman key exchange protocol (EC-DHKF), wherein the point mapping is defined as sG+H, where sG is a point (xS,yS) on an elliptic curve and H is a point (xH,yH) on the elliptic curve, including: computing V=yS2 based upon the elliptic curve and xS; computing W=yH2 based upon the elliptic curve and xH; computing U=sqrt(W·V)mod p, where p is a large prime number; choosing U′=U or U′=p−U such that U′ based upon a characteristic agreed upon by the parties to the EC-DHKF; computing xM based upon V, W, U′, xS, xH, and p.

    BLINDED SEMI-STATIC ELLIPTIC CURVE DIFFIE-HELLMAN AUTHENTICATION PROTOCOL

    公开(公告)号:US20240195620A1

    公开(公告)日:2024-06-13

    申请号:US18065396

    申请日:2022-12-13

    Applicant: NXP B.V.

    CPC classification number: H04L9/3066 H04L9/0841 H04L9/3271

    Abstract: Various embodiments relate to a data processing system comprising instructions embodied in a non-transitory computer readable medium, the instructions for an elliptic curve cryptography authentication method based on an elliptic curve in a processor, the instructions, comprising: generating, by a verifier, a random challenge r; multiplying, by the verifier, the random challenge r by a basepoint G to produce R; sending an x coordinate of R to a prover; receiving an x-coordinate of a first point P1 and a second point P2 from the prover, wherein P1 is based on a random share q1 of the private key q of the prover and R, and wherein P2 is based on a random share q2 of the private key q and R; where q=q1−q2; finding a point P1′ on the elliptic curve having an x-coordinate of the first point P1; finding a point P2′ on the elliptic curve having an x-coordinate of the second point P2; and authenticating the prover when an x-coordinate of one of (P1′+P2′) and (P1′−P2′) matches an x-coordinate of r·Q, wherein Q is a public key of the prover.

Patent Agency Ranking