METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p)

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F09%3A00159869" target="_blank" >RIV/68407700:21240/09:00159869 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p)

Original language description

The essence of the Invention is an effective method for generating the multiplicative inverse in a finite field GF(p) where p is prime, i.e. for generating the modular inverse. This method is derived from the Extended Euclidean Algorithm (EEA). The method is designed for binary execution of operations during the process of generating the modular inverse, with respect to the lowest number of addition, subtraction and shift operations possible. The proposed method avoids redundant operations for converting odd and negative values, which are performed in methods currently in use. To achieve that, negative numbers are represented in the two's complement code, values in the control part of the EEA are shifted to the left, and a new definition of the boundary and control conditions is utilized in the procedure. Minimizing the number of additions and subtractions is desirable for calculations with large numbers often encountered in cryptography.

Czech name

—

Czech description

—

Type

P - Patent

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Patent/design ID

7574469

Publisher

—

Publisher name

—

Place of publication

—

Publication country

—

Date of acceptance

Aug 11, 2009

Owner name

ČVUT v Praze

Method of use

A - Výsledek využívá pouze poskytovatel

Usage type

A - K využití výsledku jiným subjektem je vždy nutné nabytí licence