3 results about "Pairing" patented technology

A pairing method between a user device (1) and an operator device (2), the user device (1) being intended to receive conditional access data from the operator device (2), the user device having a user device identifier (UID), the operator having an operator device identifier (OID). The method comprises receiving, by the user device, a user device key (KUID) derived from a first cryptographically secure function and receiving, by the operator device, an operator key (KOID) derived from a second cryptographically secure function. The user device comprises a user device bilinear mathematical function (e(KUID, OID)) and the operator device comprises an operator bilinear mathematical function (e(UID, KOID)) which each define a pairing over an elliptic curve. The method includes generating, by the operator device (2), a pairing key (KD=e(UID, KOID)) between the user device (1) and the operator device (2), using the operator key (KOID) and the device identifier (UID) as variables of the operator mathematical function (e(UID, KOID)). The user device (1) generates the same pairing key (KD=e(KUID, OID)) using the user device key (KUID) and the operator device identifier (UID) as variables of the user device mathematical function e(KUID, OID).

It is provided a method, including monitoring if an information on a first pairing condition is received, wherein the first pairing condition indicates that a first flow is suitable for pairing under the first pairing condition; checking, if the information on the first pairing condition is received, for at least one of one or more stored second pairing conditions, if the respective stored second pairing condition matches the first pairing condition, wherein each of the one or more second pairing conditions indicates that a respective second flow different from the first flow is suitable for the pairing under the respective second pairing condition; pairing the first flow and one of the second flows if the second pairing condition related to the one of the second flows matches the first pairing condition.

The application discloses an FPGA double-output lookup table mapping method based on iterative pairing selection, which comprises the following steps: introducing a pairing flow mechanism in the iterative mapping process based on cut sets, evaluating the interconnection and the pairing ability between candidate cuts on line in the cut selection stage, and sorting and selecting the cuts by using the pairing flow score in the tolerance window; after the cut is determined, a weighted pairing graph is constructed, global pairing is carried out through conflict-aware graph matching, and a double-output LUT is formed; and the pairing awareness is integrated into each round of the multi-round iterative mapping, compared with the existing method of decoupling mapping and packing, more high-quality pairing cuts can be found, and better effects can be achieved in area and depth.