WO2002005483A1 - Procede de generation d'une cle electronique a partir d'un nombre premier compris dans un intervalle determine et dispositif de mise en oeuvre du procede - Google Patents
Procede de generation d'une cle electronique a partir d'un nombre premier compris dans un intervalle determine et dispositif de mise en oeuvre du procede Download PDFInfo
- Publication number
- WO2002005483A1 WO2002005483A1 PCT/FR2001/001948 FR0101948W WO0205483A1 WO 2002005483 A1 WO2002005483 A1 WO 2002005483A1 FR 0101948 W FR0101948 W FR 0101948W WO 0205483 A1 WO0205483 A1 WO 0205483A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- prime
- primality
- integers
- positive integers
- calculation
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000012360 testing method Methods 0.000 claims abstract description 11
- 238000004364 calculation method Methods 0.000 claims description 15
- 230000015654 memory Effects 0.000 claims description 4
- 238000012795 verification Methods 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 3
- 230000003936 working memory Effects 0.000 description 2
Classifications
-
- 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/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
- H04L9/3033—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters details relating to pseudo-prime or prime number generation, e.g. primality test
-
- 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/80—Wireless
- H04L2209/805—Lightweight hardware, e.g. radio-frequency identification [RFID] or sensor
Definitions
- the invention relates to a method for generating an electronic key from a prime number q comprised in a determined interval of positive integers [w m , w M ].
- the invention also relates to a
- the invention applies very particularly to. key, public cryptography protocols used for information encryption and / or authentication between two entities and / or electronic signature of messages.
- a first so-called “naive" method of generating a prime number consists in: choosing a candidate from among the odd numbers, testing its primality, • if the primality is' verified, this number is stored, otherwise ,. we update the candidate in
- the object of the invention is, given the interval [w ra , w M ], to determine El once and for all and to propose an update of the candidate guaranteeing that the new candidate will be first with El in the interval initially determined while keeping the calculation time of these new candidates within reasonable limits, that is to say by limiting the number of primality tests.
- FIG. 1 The choice of El is illustrated by FIG. 1 where the set I of the integers included in an interval [ m , w M ] is represented, in which is included the set IEI of the integers of this prime interval with El, in which is includes the IP set of prime numbers in this range.
- the goal is to determine ET so that ' the intermediate set IEI of prime integers with E, i.e. the set of candidates, is as close as possible to the subset IP of prime numbers of the interval.
- a 2 16 + 1.
- the invention applies to methods of generating cryptographic keys RSA, El Gamal, Schnorr, or. Fiat Shamir.
- the arithmetic processor stores q,
- the portable electronic device consists of a microprocessor smart card.
- FIG. 1 represents the set I of the integers included in an interval [ w m , w M ], the set IEI of the integers of this prime interval between them and finally the set IP of the prime numbers of this interval
- FIG. 2 represents the flow diagram of the method according to the invention
- FIG. 3 represents the block diagram of a portable electronic device such as a smart card implementing the method according to the invention.
- the object of the invention therefore consists first of all in determining El so that the set IEI of the prime integers with- El shown in FIG. 1 is as close as possible to the subset IP of the prime numbers of the interval.
- step I to generate a prime number q such that q € [ m , w M ], a number ⁇ of the same form as II is chosen ( ⁇ is the product of the k 'first prime numbers) where k' is maximum and such that there are two whole numbers positive ⁇ m and ⁇ M such that ⁇ m is the upper rounding of W m / ⁇ , which we denote by G w m / ⁇ D and ⁇ M is the lower rounding of (w M -w m ) / ⁇ which we denote by D (w M -w m ) / ⁇ D.
- the new candidate belongs to the IEI set: in fact, due to the properties of the multiplicative groups, a and c belonging to Z * ⁇ , the product ac also belongs to this group Z * ⁇ as well as ac mod El.
- Public key cryptography protocols are often implemented on microprocessor smart cards.
- the keys are generated from numbers chosen randomly by the microprocessor card to
- FIG. 3 therefore represents the functional diagram of a microprocessor card capable of implementing the method according to the invention.
- Card C includes a main processing unit 1, program memories 3 and 4 and a working memory (not shown), associated with unit 1.
- the card also includes an arithmetic processor 2 capable of performing modular calculations and a secure memory 6 (not accessible from the outside) in which the candidate will be stored . q whose primality has been verified.
- the card has also a generator of random integers 5.
- the method according to the invention has been implemented on a SLE66CX160S smart card platform. from Infineon including an 8-bit central unit and an 1100-bit arithmetic cryptoprocessor.
Landscapes
- Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Storage Device Security (AREA)
- Complex Calculations (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU2001269221A AU2001269221A1 (en) | 2000-07-10 | 2001-06-21 | Method for generating an electronic key from a prime number contained in a specific interval and device therefor |
EP01947562A EP1302021A1 (fr) | 2000-07-10 | 2001-06-21 | Procede de generation d'une cle electronique a partir d'un nombre premier compris dans un intervalle determine et dispositif de mise en oeuvre du procede |
JP2002509226A JP3833175B2 (ja) | 2000-07-10 | 2001-06-21 | 一定の区間内に含まれる素数から電子キーを生成する方法とその装置 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR0008994 | 2000-07-10 | ||
FR0008994A FR2811442B1 (fr) | 2000-07-10 | 2000-07-10 | Procede de generation d'une cle electronique a partir d'un nombre premier compris dans un intervalle determine et dispositif de mise en oeuvre du procede |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2002005483A1 true WO2002005483A1 (fr) | 2002-01-17 |
Family
ID=8852313
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/FR2001/001948 WO2002005483A1 (fr) | 2000-07-10 | 2001-06-21 | Procede de generation d'une cle electronique a partir d'un nombre premier compris dans un intervalle determine et dispositif de mise en oeuvre du procede |
Country Status (7)
Country | Link |
---|---|
US (1) | US20040114757A1 (fr) |
EP (1) | EP1302021A1 (fr) |
JP (1) | JP3833175B2 (fr) |
CN (1) | CN1449609A (fr) |
AU (1) | AU2001269221A1 (fr) |
FR (1) | FR2811442B1 (fr) |
WO (1) | WO2002005483A1 (fr) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7113595B2 (en) | 2002-08-09 | 2006-09-26 | Gemplus | Generation of a random number that is non-divisible by a set of prime numbers |
US7149763B2 (en) | 2002-09-09 | 2006-12-12 | Gemplus | Method for generating a random prime number within a predetermined interval |
CN100338906C (zh) * | 2003-03-27 | 2007-09-19 | 松下电器产业株式会社 | 共享密钥生成装置、密钥交换装置以及密钥交换方法 |
WO2008152440A1 (fr) * | 2007-06-15 | 2008-12-18 | Sony Ericsson Mobile Communications Ab | Génération d'une clé rsa dépendante d'un dispositif |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2841411B1 (fr) * | 2002-06-19 | 2004-10-29 | Gemplus Card Int | Procede de generation de cles electroniques pour procede de crytographie a cle publique et objet portatif securise mettant en oeuvre le procede |
US8218760B2 (en) * | 2007-02-27 | 2012-07-10 | Thomson Licensing | Method and a device for generating compressed RSA moduli |
-
2000
- 2000-07-10 FR FR0008994A patent/FR2811442B1/fr not_active Expired - Fee Related
-
2001
- 2001-06-21 WO PCT/FR2001/001948 patent/WO2002005483A1/fr active Application Filing
- 2001-06-21 AU AU2001269221A patent/AU2001269221A1/en not_active Abandoned
- 2001-06-21 US US10/311,153 patent/US20040114757A1/en not_active Abandoned
- 2001-06-21 EP EP01947562A patent/EP1302021A1/fr not_active Withdrawn
- 2001-06-21 CN CN01814877.8A patent/CN1449609A/zh active Pending
- 2001-06-21 JP JP2002509226A patent/JP3833175B2/ja not_active Expired - Fee Related
Non-Patent Citations (1)
Title |
---|
YASUKO GOTOH ET AL: "A METHOD FOR RAPID RSA KEY GENERATION", SYSTEMS & COMPUTERS IN JAPAN,SCRIPTA TECHNICA JOURNALS. NEW YORK,US, vol. 21, no. 8, 1990, pages 11 - 20, XP000177817, ISSN: 0882-1666 * |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7113595B2 (en) | 2002-08-09 | 2006-09-26 | Gemplus | Generation of a random number that is non-divisible by a set of prime numbers |
US7149763B2 (en) | 2002-09-09 | 2006-12-12 | Gemplus | Method for generating a random prime number within a predetermined interval |
CN100338906C (zh) * | 2003-03-27 | 2007-09-19 | 松下电器产业株式会社 | 共享密钥生成装置、密钥交换装置以及密钥交换方法 |
WO2008152440A1 (fr) * | 2007-06-15 | 2008-12-18 | Sony Ericsson Mobile Communications Ab | Génération d'une clé rsa dépendante d'un dispositif |
US8472620B2 (en) | 2007-06-15 | 2013-06-25 | Sony Corporation | Generation of device dependent RSA key |
Also Published As
Publication number | Publication date |
---|---|
CN1449609A (zh) | 2003-10-15 |
JP3833175B2 (ja) | 2006-10-11 |
AU2001269221A1 (en) | 2002-01-21 |
EP1302021A1 (fr) | 2003-04-16 |
FR2811442A1 (fr) | 2002-01-11 |
JP2004502984A (ja) | 2004-01-29 |
US20040114757A1 (en) | 2004-06-17 |
FR2811442B1 (fr) | 2002-09-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0656710B1 (fr) | Procédé de génération de signatures DSA avec des appareils portables à bas coûts | |
EP2296086B1 (fr) | Protection d'une génération de nombres premiers contre des attaques par canaux cachés | |
EP1738517A1 (fr) | Procedes et dispositifs cryptographiques sans transfert de connaissance | |
FR2807898A1 (fr) | Procede de cryptographie sur courbes elliptiques | |
FR2926651A1 (fr) | Procede et dispositifs de contre-mesure pour cryptographie asymetrique | |
EP1159797B1 (fr) | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie a cle secrete | |
CA2712180A1 (fr) | Procede et dispositifs de contre-mesure pour cryptographie asymetrique a schema de signature | |
EP1302021A1 (fr) | Procede de generation d'une cle electronique a partir d'un nombre premier compris dans un intervalle determine et dispositif de mise en oeuvre du procede | |
WO2003017569A1 (fr) | Procede de realisation d'une unite cryptographique pour un systeme de cryptographie asymetrique utilisant une fonction logarithme discret | |
EP1104607A1 (fr) | Procede et dispositif d'authentification a algorithme symetrique | |
EP1829279B1 (fr) | Procédé et dispositif de génération de clé pour un algorithme cryptographique | |
WO2001074006A1 (fr) | Dispositif et procede de generation de cles electroniques a partir de nombres premiers entre eux | |
EP1200889B1 (fr) | Procede d'amelioration d'un generateur aleatoire en vue de le rendre resistant contre les attaques par mesure de courant | |
EP1225530A1 (fr) | Système, méthode et programme pour la concurrence quantitative et medium de stockage pour le programme associé | |
FR2818846A1 (fr) | Procede de contre-mesure dans un composant electronique mettant en oeuvre un algorithme de cryptographie | |
FR2810178A1 (fr) | Procede de calcul cryptographique comportant une routine d'exponentiation modulaire | |
CA2359198C (fr) | Unite de calcul pour l'execution d'un protocole cryptographique | |
WO2001010078A1 (fr) | Schemas de signature a base de logarithme discret avec reconstitution partielle ou totale du message | |
WO2003069841A1 (fr) | Procede de detection des attaques par mise en defaut contre les algorithmes cryptographiques | |
EP1832034A2 (fr) | Procede de generation rapide d'un nombre aleatoire non divisible par un ensemble predetermine de nombres premiers | |
FR2713420A1 (fr) | Procédé de génération de signatures DSA avec des appareils portables à bas coûts. | |
FR2837335A1 (fr) | Procede et systeme cryptographiques | |
FR3038473A1 (fr) | Procede de traitement cryptographique de donnees et programme d'ordinateur associe | |
JP2003029632A (ja) | 素数生成方法および装置並びにプログラム | |
FR2984549A1 (fr) | Procede de generation de nombres premiers prouves adapte aux cartes a puce |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC 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 MZ 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 MZ 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 TR 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) | ||
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001947562 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 018148778 Country of ref document: CN |
|
WWP | Wipo information: published in national office |
Ref document number: 2001947562 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10311153 Country of ref document: US |