WO2000059157A1 - Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle publique de type courbe elliptique - Google Patents
Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle publique de type courbe elliptique Download PDFInfo
- Publication number
- WO2000059157A1 WO2000059157A1 PCT/FR2000/000723 FR0000723W WO0059157A1 WO 2000059157 A1 WO2000059157 A1 WO 2000059157A1 FR 0000723 W FR0000723 W FR 0000723W WO 0059157 A1 WO0059157 A1 WO 0059157A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- countermeasure method
- decryption
- algorithm
- integer
- counter
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/725—Finite field arithmetic over elliptic curves
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/002—Countermeasures against attacks on cryptographic mechanisms
- H04L9/003—Countermeasures against attacks on cryptographic mechanisms for power analysis, e.g. differential power analysis [DPA] or simple power analysis [SPA]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3066—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
- G06F2207/7219—Countermeasures against side channel or fault attacks
- G06F2207/7223—Randomisation as countermeasure against side channel attacks
- G06F2207/7233—Masking, e.g. (A**e)+r mod n
- G06F2207/7238—Operand masking, i.e. message blinding, e.g. (A+r)**e mod n; k.(P+R)
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
- G06F2207/7219—Countermeasures against side channel or fault attacks
- G06F2207/7223—Randomisation as countermeasure against side channel attacks
- G06F2207/7233—Masking, e.g. (A**e)+r mod n
- G06F2207/7247—Modulo masking, e.g. A**e mod (n*r)
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
- G06F2207/7219—Countermeasures against side channel or fault attacks
- G06F2207/7223—Randomisation as countermeasure against side channel attacks
- G06F2207/7257—Random modification not requiring correction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/04—Masking or blinding
- H04L2209/046—Masking or blinding of operations, operands or results of the operations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/08—Randomization, e.g. dummy operations or using noise
Definitions
- the present invention relates to a countermeasure method in an electronic component implementing a public key encryption algorithm of the elliptical curve type.
- the disadvantage of the secret key encryption system is that said system requires the prior communication of the key K between the two persons via a secure channel, before any encrypted message is received. be sent through the unsecured channel.
- the term “secure channel” is understood to mean a channel for which it is impossible to know or modify the information which passes through said channel. Such a secure channel can be achieved by a cable connecting two terminals, owned by the two said people.
- Public key cryptography solves the problem of distributing keys through an insecure channel.
- the principle of public key cryptography consists in using a pair of keys, a public encryption key and a private decryption key. It must be impossible to find the private decryption key from the public encryption key.
- a person A wishing to communicate information to a person B uses the public encryption key of person B. Only person B has the private key associated with his public key. Only person B is therefore able to decipher the message addressed to him.
- Another advantage of public key cryptography over secret key cryptography is that public key cryptography allows authentication by the use of electronic signature.
- This encryption system is based on the difficulty of the problem of the sum of subsets.
- This encryption system is based on the theory of algebraic codes. It is based on the problem of decoding linear codes.
- This encryption system is based on the difficulty of the discrete logarithm in a finite body.
- the elliptic curve encryption system constitutes a modification of existing cryptographic systems to apply them to the domain of elliptic curves.
- P P + PP .... + P d times.
- a common point in most cryptographic algorithms based on elliptic curves is that they include as parameter a elliptic curve defined on a finite field and a point P belonging to this elliptic curve.
- the private key is an integer d chosen randomly.
- the number of m is the triplet (xl, yl, c).
- the simplest and most used algorithm is the "double and add” algorithm.
- the “double and add” algorithm takes as input a point P belonging to a given elliptical curve and an integer d.
- the algorithm returns at point Q ⁇ d.P.
- the "double and add” algorithm has the following 3 steps:
- the DPA type attack therefore makes it possible to obtain additional information on the intermediate data manipulated by the microprocessor of the card during the execution of a cryptographic algorithm . This additional information can in certain cases make it possible to reveal the private parameters of the decryption algorithm, rendering the cryptographic system insecure.
- a DPA attack method is described on an elliptic curve type algorithm performing an operation of the scalar multiplication type of a point P by an integer d, the integer d being the secret key. This attack directly reveals the secret key d. It therefore seriously compromises the security of the implementation of elliptical curves on a smart card.
- the first step of the attack is the recording of the current consumption corresponding to the execution of the "double and add" algorithm described above for N distinct points P (1), ..., P (N).
- the chip card microprocessor will perform N scalar multiplications d. P (1), ..., d. P (N).
- the points P (l) to P (N) are grouped according to the value of the last bit of the abscissa of 4.P, where P designates one of the points P (l) to P (N).
- the first group consists of points P such that the last bit of the abscissa of 4.P is equal to 1.
- the second group consists of points P such that the last bit of the abscissa of 4.P is equal to 0.
- the average of the current consumptions corresponding to each of the two groups is calculated, and the difference curve between these is calculated. two averages.
- the scalar multiplication algorithm previously described calculates and stores the value of 4. P. This means that when the algorithm is executed in a map chip, the card microprocessor will effectively calculate 4. P. In this case, in the first message group the last bit of the data manipulated by the microprocessor is always 1, and in the second message group the last bit of the data manipulated is always 0. The average of the current consumptions corresponding to each group is therefore different. It therefore appears in the difference curve between the 2 averages a peak of current consumption differential.
- the input is defined by N points denoted P (l) to P (N) corresponding to N calculations performed by the smart card and the output by an integer h.
- the algorithm is carried out in the following manner in three stages.
- the method of the invention consists in the development of three countermeasures making it possible to guard against the DPA attack previously described.
- the method of the first countermeasure consists in calculating from the private key d and the number of points n of the elliptic curve a new deciphering integer of, such as the decryption of any encrypted message with d 'gives the same result as with d.
- the method of the first countermeasure includes two variants which relate to updating the whole of.
- the first variant consists in that a new decryption integer is calculated on each new execution of the decryption algorithm, according to the method described above.
- the method of the first countermeasure therefore makes the previously described DPA attack impossible by changing the integer d of decryption.
- the scalar multiplication operation Q dp performed in an algorithm based on an elliptical curve is then carried out according to the following process in five steps: 1) Determination of a security parameter s; in practice, we can take s close to the number 60;
- the method of the second countermeasure includes two variants which relate to the updating of the integer r.
- the first variant consists in that a new integer r is calculated on each new execution of the decryption algorithm, according to the method described above.
- the second variant consists in that a counter is incremented with each new execution of the decryption algorithm.
- the method of the third countermeasure consists in "masking" the point P on which we want to apply the scalar multiplication algorithm by adding a random point R.
- the method of the third countermeasure includes three variants.
- the first variant consists in that a counter is incremented on each new execution of the decryption algorithm.
- the algorithm is executed according to the five-step process described above. As long as the counter has not reached the limit value T, steps 1 and 4 of the method described above are not executed, the points R and S keeping the values taken during the previous execution.
- the third variant consists of a modification of the second variant, characterized in that a counter is incremented on each new execution of the decryption algorithm.
- the algorithm is executed according to the five-step method of the second variant described above. As long as the counter has not reached a limit value T, steps l ′ and 4 ′ of the method described above are not executed, the points R and S keeping the values taken during the previous execution.
- the application of the three preceding countermeasure methods makes it possible to protect the entire cryptographic algorithm based on the elliptical curves against the DPA attack previously described.
- the three countermeasures presented are moreover compatible with each other: it is possible to apply to the RSA decryption algorithm one, two or three of the countermeasures described.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Pure & Applied Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mathematical Physics (AREA)
- Computing Systems (AREA)
- Computational Mathematics (AREA)
- Algebra (AREA)
- General Engineering & Computer Science (AREA)
- Storage Device Security (AREA)
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
MXPA01009402A MXPA01009402A (es) | 1999-03-26 | 2000-03-22 | Procedimiento de contramedida en un componente electronico que implementa un algoritmo de criptografia de clave publica de tipo curva eliptica. |
AU36603/00A AU3660300A (en) | 1999-03-26 | 2000-03-22 | Countermeasure method in an electric component implementing an elliptical curve type public key cryptography algorithm |
US09/937,397 US7286666B1 (en) | 1999-03-26 | 2000-03-22 | Countermeasure method in an electric component implementing an elliptical curve type public key cryptography algorithm |
JP2000608546A JP2002540484A (ja) | 1999-03-26 | 2000-03-22 | 楕円曲線型の公開鍵暗号化アルゴリズムを用いる電子構成部品における対抗措置方法 |
EP00915215A EP1166495A1 (fr) | 1999-03-26 | 2000-03-22 | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle publique de type courbe elliptique |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR9903920A FR2791496B1 (fr) | 1999-03-26 | 1999-03-26 | Procedes de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de crytographie a cle publique de type courbe elliptique |
FR99/03920 | 1999-03-26 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2000059157A1 true WO2000059157A1 (fr) | 2000-10-05 |
Family
ID=9543774
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/FR2000/000723 WO2000059157A1 (fr) | 1999-03-26 | 2000-03-22 | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle publique de type courbe elliptique |
Country Status (8)
Country | Link |
---|---|
US (1) | US7286666B1 (fr) |
EP (1) | EP1166495A1 (fr) |
JP (1) | JP2002540484A (fr) |
CN (1) | CN1218531C (fr) |
AU (1) | AU3660300A (fr) |
FR (1) | FR2791496B1 (fr) |
MX (1) | MXPA01009402A (fr) |
WO (1) | WO2000059157A1 (fr) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2005008955A1 (fr) | 2003-07-22 | 2005-01-27 | Fujitsu Limited | Chiffrement infalsifiable utilisant une cle individuelle |
US6914986B2 (en) * | 2000-06-02 | 2005-07-05 | Gemplus | Countermeasure method in an electronic component using a public key cryptography algorithm on an elliptic curve |
EP2326041A1 (fr) * | 2009-11-19 | 2011-05-25 | Gemalto SA | Contre-mesures contre les attaques en force pour la randomisation de l'exposant |
US8280042B2 (en) | 2009-01-19 | 2012-10-02 | Fujitsu Limited | Decryption processor and decryption processing method |
Families Citing this family (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000305453A (ja) * | 1999-04-21 | 2000-11-02 | Nec Corp | 暗号化装置,復号装置,および暗号化・復号装置 |
FR2821944B1 (fr) * | 2001-03-12 | 2003-05-30 | Gemplus Card Int | Procede de protection contre les attaques par mesure de courant ou de rayonnement electromagnetique |
FR2821945B1 (fr) * | 2001-03-12 | 2003-05-30 | Gemplus Card Int | Procede de protection contre les attaques par mesure de courant ou de rayonnement electromagnetique |
FR2824210B1 (fr) * | 2001-04-27 | 2003-05-30 | Gemplus Card Int | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme cryptographique du type a cle publique sur une courbe elliptique |
US7372960B2 (en) * | 2001-12-31 | 2008-05-13 | Certicom Corp. | Method and apparatus for performing finite field calculations |
KR100652377B1 (ko) * | 2004-08-06 | 2007-02-28 | 삼성전자주식회사 | 모듈라 지수승 알고리즘, 기록매체 및 시스템 |
FR2881300B1 (fr) * | 2005-01-21 | 2007-03-16 | Gemplus Sa | Procede de generation d'une courbe elliptique, application a un procede cryptographique, et procede cryptographique une telle courbe |
JP5147412B2 (ja) * | 2005-01-21 | 2013-02-20 | サーティコム コーポレーション | 楕円曲線乱数生成 |
CN101213513B (zh) | 2005-06-29 | 2013-06-12 | 爱迪德艾恩德霍芬公司 | 保护数据处理装置免受密码攻击或分析的设备和方法 |
JP4513752B2 (ja) * | 2006-01-16 | 2010-07-28 | ソニー株式会社 | 暗号処理装置、および暗号処理方法、並びにコンピュータ・プログラム |
DE102006013515A1 (de) * | 2006-03-23 | 2007-10-04 | Siemens Ag | Kryptographisches Verfahren mit elliptischen Kurven |
FR2941115B1 (fr) * | 2009-01-14 | 2011-02-25 | Sagem Securite | Codage de points d'une courbe elliptique |
EP3220306B1 (fr) * | 2016-02-22 | 2018-11-07 | Eshard | Procédé de test de la résistance d'un circuit à une analyse de canal latéral |
US10674045B2 (en) * | 2017-05-31 | 2020-06-02 | Google Llc | Mutual noise estimation for videos |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6064740A (en) * | 1997-11-12 | 2000-05-16 | Curiger; Andreas | Method and apparatus for masking modulo exponentiation calculations in an integrated circuit |
US6466668B1 (en) * | 1998-01-28 | 2002-10-15 | Hitachi, Ltd. | IC card equipped with elliptical curve encryption processing facility |
FR2809893B1 (fr) * | 2000-06-02 | 2002-11-15 | Gemplus Card Int | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle publique sur courbe elliptique |
-
1999
- 1999-03-26 FR FR9903920A patent/FR2791496B1/fr not_active Expired - Lifetime
-
2000
- 2000-03-22 US US09/937,397 patent/US7286666B1/en not_active Expired - Lifetime
- 2000-03-22 WO PCT/FR2000/000723 patent/WO2000059157A1/fr not_active Application Discontinuation
- 2000-03-22 CN CN00805519XA patent/CN1218531C/zh not_active Expired - Lifetime
- 2000-03-22 EP EP00915215A patent/EP1166495A1/fr not_active Withdrawn
- 2000-03-22 JP JP2000608546A patent/JP2002540484A/ja active Pending
- 2000-03-22 AU AU36603/00A patent/AU3660300A/en not_active Abandoned
- 2000-03-22 MX MXPA01009402A patent/MXPA01009402A/es unknown
Non-Patent Citations (4)
Title |
---|
KOBLITZ N: "Elliptic curve cryptosystems", MATHEMATICS OF COMPUTATION, JAN. 1987, USA, vol. 48, no. 177, pages 203 - 209, XP000671098, ISSN: 0025-5718 * |
KOCHER P C: "Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems", ADVANCES IN CRYPTOLOGY - CRYPTO'96. 16TH ANNUAL INTERNATIONAL CRYPTOLOGY CONFERENCE. PROCEEDINGS, ADVANCES IN CRYPTOLOGY - CRYPTO '96, SANTA BARBARA, CA, USA, 18-22 AUG. 1996, 1996, Berlin, Germany, Springer-Verlag, Germany, pages 104 - 113, XP000626590, ISBN: 3-540-61512-1 * |
MENKUS B: "Two important data encryption structures reported broken in record times", EDPACS, JAN. 1999, AUERBACH PUBLICATIONS, USA, vol. 26, no. 7, pages 15 - 18, XP000884687, ISSN: 0736-6981 * |
PAUL KOCHER ET AL.: "Introduction to Differential Power Analysis and Related Attacks", RETRIEVED FROM INTERNET: <URL: HTTP://WWW.CRYPTOGRAPHY.COM/DPA/TECHNICAL/INDEX.HTML> ON 24 FEBRUARY 2000; AVAILABLE ON INTERNET SINCE 1998, San Francisco, CA, USA, pages 1 - 8, XP002132318 * |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6914986B2 (en) * | 2000-06-02 | 2005-07-05 | Gemplus | Countermeasure method in an electronic component using a public key cryptography algorithm on an elliptic curve |
WO2005008955A1 (fr) | 2003-07-22 | 2005-01-27 | Fujitsu Limited | Chiffrement infalsifiable utilisant une cle individuelle |
EP1648111A1 (fr) * | 2003-07-22 | 2006-04-19 | Fujitsu Limited | Chiffrement infalsifiable utilisant une cle individuelle |
EP1648111A4 (fr) * | 2003-07-22 | 2008-03-19 | Fujitsu Ltd | Chiffrement infalsifiable utilisant une cle individuelle |
US8280042B2 (en) | 2009-01-19 | 2012-10-02 | Fujitsu Limited | Decryption processor and decryption processing method |
EP2326041A1 (fr) * | 2009-11-19 | 2011-05-25 | Gemalto SA | Contre-mesures contre les attaques en force pour la randomisation de l'exposant |
WO2011061263A1 (fr) * | 2009-11-19 | 2011-05-26 | Gemalto Sa | Contre-mesures contre des attaques en puissance pour la randomisation de l'exposant |
Also Published As
Publication number | Publication date |
---|---|
FR2791496A1 (fr) | 2000-09-29 |
FR2791496B1 (fr) | 2001-10-19 |
CN1345496A (zh) | 2002-04-17 |
US7286666B1 (en) | 2007-10-23 |
CN1218531C (zh) | 2005-09-07 |
MXPA01009402A (es) | 2002-06-04 |
JP2002540484A (ja) | 2002-11-26 |
EP1166495A1 (fr) | 2002-01-02 |
AU3660300A (en) | 2000-10-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1166494B1 (fr) | Procedes de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle publique de type courbe elliptique | |
WO2001093014A1 (fr) | Procede de contre-mesure dans un composant electronique mettant en oeuvre un alrogithme de cryptographie a cle publique sur courbe elliptique | |
EP2946284B1 (fr) | Procédé de cryptographie comprenant une opération de multiplication par un scalaire ou une exponentiation | |
WO2000059157A1 (fr) | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle publique de type courbe elliptique | |
EP2296086B1 (fr) | Protection d'une génération de nombres premiers contre des attaques par canaux cachés | |
EP2546737A1 (fr) | Protection d'un calcul d'exponentiation modulaire par addition d'une quantité aléatoire | |
FR3010210A1 (fr) | Protection d'un calcul contre des attaques par canaux caches | |
EP1381936B1 (fr) | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme cryptographique du type a cle publique sur une courbe elliptique | |
FR2941798A1 (fr) | Appareil pour calculer un resultat d'une multiplication scalaire | |
EP1224765B1 (fr) | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle publique de type rsa | |
EP2983083B1 (fr) | Procede de cryptographie sur courbe elliptique comprenant une detection d'erreur | |
EP1350357B1 (fr) | Procede d'amelioration de la securite de schemas de chiffrement a clef publique | |
EP1639451A2 (fr) | Procédé de contre-mesure par masquage de l'accumulateur | |
EP1325584A1 (fr) | Procede d'encodage de messages longs pour schemas de signature electronique a base de rsa | |
FR2810821A1 (fr) | Procedes de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle publique de type courbe elliptique de koblitz | |
FR2856538A1 (fr) | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme cryptographique du type a cle publique | |
FR2818846A1 (fr) | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie | |
EP1325585A1 (fr) | Procede de transmission accelere de signature electronique | |
WO2002050658A1 (fr) | Procedes de contre-mesure dans un composant electronique mettant en ouvre un algorithme de cryptographie a cle publique de type rsa | |
FR2864390A1 (fr) | Procede cryptographique d'exponentiation modulaire protege contre les attaques de type dpa. | |
FR2797126A1 (fr) | Procede d'amelioration de performance de l'operation de multiplication sur corps fini de caracteristique 2 | |
FR2854997A1 (fr) | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme cryptographique du type a cle publique sur une courbe elliptique definie sur un corps de caracteristique deux | |
WO2002093411A1 (fr) | Dispositif destine a realiser des calculs d"exponentiation appliques a des points d"une courbe elliptique |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 00805519.X Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AL AM AT AU AZ BA BB BG BR BY CA CH CN CR CU CZ DE DK DM EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2000915215 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: PA/a/2001/009402 Country of ref document: MX |
|
ENP | Entry into the national phase |
Ref document number: 2000 608546 Country of ref document: JP Kind code of ref document: A |
|
WWP | Wipo information: published in national office |
Ref document number: 2000915215 Country of ref document: EP |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 09937397 Country of ref document: US |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2000915215 Country of ref document: EP |