Reduction calculations in elliptic curve cryptography

Reduction calculations in elliptic curve cryptography

An Elliptic Curve Cryptography reduction technique uses a prime number having a first section of Most Significant Word "1" states, with N=nm-1+N1B+n0 and a second section with a plurality of "1" or "0" states. The combination of the first section and the second section...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: HUBERT GERARDUS T. M
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
JAMMING OF COMMUNICATION
PHYSICS
SECRET COMMUNICATION
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An Elliptic Curve Cryptography reduction technique uses a prime number having a first section of Most Significant Word "1" states, with N=nm-1+N1B+n0 and a second section with a plurality of "1" or "0" states. The combination of the first section and the second section is a modulus.