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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p) Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. 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. (en)
Title	METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p) METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p) (en)
skos:prefLabel	METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p) METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p) (en)
skos:notation	RIV/68407700:21240/09:00159869!RIV10-MSM-21240___
http://linked.open...tracePatentuVzoru	2007-10-18 (xsd:date)
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM6840770014)
http://linked.open...cisloPatentuVzoru	7574469
http://linked.open...eleniPatentuVzoru	2009-08-11 (xsd:date)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Lórencz, Róbert
http://linked.open.../riv/druhVysledku	P - Patent
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	325654
http://linked.open...ai/riv/idVysledku	RIV/68407700:21240/09:00159869
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Multiplicative inverse; Cryptography; Modular arithmetic (en)
http://linked.open.../riv/klicoveSlovo	Cryptography Modular arithmetic Multiplicative inverse
http://linked.open...ontrolniKodProRIV	[A88C45470D3A]
http://linked.open.../licencniPoplatek	A - Poskytovatel licence na výsledek požaduje licenční poplatek
http://linked.open...ydaniPatentuVzoru	Washington
http://linked.open...atelePatentuVzoru	United States Patent and Trademark Office
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2009
http://linked.open...ydaniPatentuVzoru	US - Spojené státy americké
http://linked.open...iv/tvurceVysledku	Lórencz, Róbert
http://linked.open...mniOchranaPatentu	B - USTPO (Úřad pro patenty a ochranné známky USA)
http://linked.open...avai/riv/vlastnik	ČVUT v Praze
http://linked.open...itiJinymSubjektem	A - Nabytí licence je nutné vždy
http://linked.open...uzitiPatentuVzoru	A - Pouze udělený nebo využívaný pouze vlastníkem
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií
http://linked.open...stnikPatentuVzoru	ČVUT v Praze
http://localhost/t...ganizacniJednotka	21240
is http://linked.open...avai/riv/vysledek of	METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p) METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p) METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p) METHOD FOR GENERATING THE MULTIPLICATIVE INVERSE IN A FINITE FIELD GF(p)

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software