Memory system with an incremental hashing operation and method

    公开(公告)号:US11520708B2

    公开(公告)日:2022-12-06

    申请号:US16707515

    申请日:2019-12-09

    Applicant: NXP B.V.

    Abstract: A memory system, comprising: i) a first electronic device comprising a processor, ii) a second electronic device being external to the first electronic device and comprising a memory, wherein the memory stores a memory image over at least a part of a data set stored on the memory, and iii) a hash value related to the memory image. The first electronic device and the second electronic device are coupled such that the processor has at least partial control over the second electronic device. The processor is configured to, when updating the data set stored on the memory of the second electronic device, also update the hash value related to the memory image using an incremental hashing operation so that only those parts of the memory image are processed that have changed.

    Method of generating cryptographic key pairs

    公开(公告)号:US10341098B2

    公开(公告)日:2019-07-02

    申请号:US15414391

    申请日:2017-01-24

    Applicant: NXP B.V.

    Abstract: A method is provided for performing elliptic curve cryptography that reduces the number of required computations to produce, for example, a key pair. The number of computations is reduced by changing how a random nonce used in the computations is selected. In an embodiment, a look-up table is generated having pre-computed scalar values and elliptic curve points. Every time a new pseudo-random value is created for use in the ECDSA, a combination of the look-up table values is used to create multiple intermediate values. One of the multiple intermediate values is randomly chosen as a replacement value for one of the existing table entries. Each time the look-up table is used, multiple entries in the look-up table are updated to new look-up table values as described. In this manner, new randomness is provided in every step to generate the next pseudo-random nonce as a combination of multiple internally stored temporary look-up table values. Alternately, another mathematical group may be used.

    X-ONLY GENERIC MAPPING FUNCTION FOR PACE PROTOCOL

    公开(公告)号:US20180191498A1

    公开(公告)日:2018-07-05

    申请号: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 x based upon V, W, U′, xS, xH, and p.

Patent Agency Ranking