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

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

P - Patent

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2009

Kód důvěrnosti údajů

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

Číslo patentu nebo vzoru

7574469

Vydavatel

—

Název vydavatele

—

Místo vydání

—

Stát vydání

—

Datum přijetí

11. 8. 2009

Název vlastníka

ČVUT v Praze

Způsob využití

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

Druh možnosti využití

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