G - Physics – 06 – F
Patent
G - Physics
06
F
G06F 7/72 (2006.01)
Patent
CA 2342737
The invention concerns fast cryptographic method between two entities exchanging data via a non-secure communication channel. The method, for example for forming a common key between two entities (A, B) each having a secret key (a, b) and using a public key (P) formed by a point of an elliptic curve (E), comprises at least a step which consists in multiplying said odd order point (P) by an integer and said phase comprises operations called additions and halving , the latter operation characterising the invention.
Procédé de cryptographie rapide entre deux entités échangeant des informations à travers un canal de communication non sécurisé. Le procédé, par exemple pour la constitution d'une clef commune entre deux entités (A, B) possédant chacune une clef secrète (a, b) et faisant toutes deux appel à une clef publique (P) constituée par un point d'une courbe elliptique (E), comprend au moins une phase consistant à multiplier ledit point (P) d'ordre impair par un entier et cette phase comprend des opérations dites "additions" et "divisions par deux", cette dernière opération étant caractéristique de l'invention.
Oberthur Card Systems Sa
Robic
LandOfFree
Computing method for elliptic curve cryptography does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computing method for elliptic curve cryptography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing method for elliptic curve cryptography will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1707101