知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

710 records (took 0.14 seconds)

    HARDWARE ACCELERATOR FOR COMPUTING A SCALAR DOT PRODUCT
    1.
    发明公开
    HARDWARE ACCELERATOR FOR COMPUTING A SCALAR DOT PRODUCT 审中-公开

    公开(公告)号：US20240080197A1

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

    申请号：US17903647

    申请日：2022-09-06

    Applicant: INGONYAMA LTD.

    Inventor： Daniel SHTERMAN ,  Omer SHLOMOVITS ,  Michael ASA ,  Yuval DOMB

    IPC: H04L9/32 ,  G06F7/72 ,  G06F17/16

    CPC classification number: H04L9/3218 ,  G06F7/725 ,  G06F17/16

    Abstract: A hardware accelerator computes a scalar dot product given by Σi=0N−1diPi where di is a scalar of length b bits and Pi is an element in a group. The hardware accelerator includes a plurality A of accumulators addressed by corresponding contiguous partitions of the scalar di, each partition being of length c such that




    A
    =

    ⌈

    b
    c

    ⌉





    and each accumulator containing a plurality B of buckets where B=2c. The value of Pi is entered into each empty accumulator bucket whose value corresponds to the weight of the respective partition associated with the corresponding accumulator or is added to a non-zero value that is already in the bucket, the sum replacing the previous value. An accumulator sums the values in the respective buckets of each accumulator so as to derive A sums, and sums the A computed sums to derive the scalar dot product.

    Unknown
    9.
    发明申请
    Unknown 审中-公开

    公开(公告)号：US20180101362A1

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

    申请号：US15727058

    申请日：2017-10-06

    Applicant: Idemia Identity & Security France

    Inventor： Victor SERVANT ,  Guillaume DABOSVILLE

    IPC: G06F7/72 ,  H04L9/30 ,  G06F9/30 ,  G06K19/07

    CPC classification number: G06F7/725 ,  G06F9/30098 ,  G06F2207/7261 ,  G06F2207/7285 ,  G06K19/07 ,  H04L9/003 ,  H04L9/3066

    Abstract: The invention relates to a cryptographic processing method comprising multiplication of a point P of an elliptic curve on a Galois field by a scalar k, the multiplication comprising steps of: storing, in a first register, a zero point of the Galois field, executing a loop comprising at least one iteration comprising steps of: selecting a window of w bits in the non-signed binary representation of the scalar k, w being a predetermined integer independent of the scalar k and strictly greater than 1, calculating multiple points of P being each associated with a bit of the window and of the form ±2iP, adding or not in the first register of multiple points stored, depending of the value of the bit of the window with which the multiple points are associated, wherein the loop ends once each bit of the non-signed binary representation of the scalar k has been selected, returning a value stored in the first register. If all the bits of the window selected during an iteration of the loop are zero, the iteration comprises at least one dummy execution of the addition function, and/or if all the bits of the window during an iteration of the loop are non-zero, the multiple points to be added in the first register during the step are determined from a non-adjacent form associated with the window.

Patent Agency Ranking