DE602004027943D1 - Verbesserte natürliche montgomery-exponentenmaskierung - Google Patents

Verbesserte natürliche montgomery-exponentenmaskierung

Info

Publication number
DE602004027943D1
DE602004027943D1 DE602004027943T DE602004027943T DE602004027943D1 DE 602004027943 D1 DE602004027943 D1 DE 602004027943D1 DE 602004027943 T DE602004027943 T DE 602004027943T DE 602004027943 T DE602004027943 T DE 602004027943T DE 602004027943 D1 DE602004027943 D1 DE 602004027943D1
Authority
DE
Germany
Prior art keywords
masking
montgomery
montgomery arithmetic
cryptographic device
improved natural
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
DE602004027943T
Other languages
English (en)
Inventor
Carmi Gressel
Boris Dolgunov
Odile Derouet
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Western Digital Israel Ltd
Original Assignee
SanDisk IL Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by SanDisk IL Ltd filed Critical SanDisk IL Ltd
Publication of DE602004027943D1 publication Critical patent/DE602004027943D1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/728—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 using Montgomery reduction
    • 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
    • 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • 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/3013—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 involving the discrete logarithm problem, e.g. ElGamal or Diffie-Hellman systems
    • 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/302—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 involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes
    • 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)
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Physics (AREA)
  • General Engineering & Computer Science (AREA)
  • Storage Device Security (AREA)
  • Dental Preparations (AREA)
  • Lubricants (AREA)
  • Electroplating And Plating Baths Therefor (AREA)
DE602004027943T 2003-11-16 2004-11-16 Verbesserte natürliche montgomery-exponentenmaskierung Active DE602004027943D1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US52377303P 2003-11-16 2003-11-16
PCT/IL2004/001053 WO2005048008A2 (en) 2003-11-16 2004-11-16 Enhanced natural montgomery exponent masking

Publications (1)

Publication Number Publication Date
DE602004027943D1 true DE602004027943D1 (de) 2010-08-12

Family

ID=34590484

Family Applications (1)

Application Number Title Priority Date Filing Date
DE602004027943T Active DE602004027943D1 (de) 2003-11-16 2004-11-16 Verbesserte natürliche montgomery-exponentenmaskierung

Country Status (4)

Country Link
EP (1) EP1692800B1 (de)
AT (1) ATE472769T1 (de)
DE (1) DE602004027943D1 (de)
WO (1) WO2005048008A2 (de)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2895609A1 (fr) 2005-12-26 2007-06-29 Gemplus Sa Procede cryptographique comprenant une exponentiation modulaire securisee contre les attaques a canaux caches, cryptoprocesseur pour la mise en oeuvre du procede et carte a puce associee
EP2015171A1 (de) * 2007-06-29 2009-01-14 Gemplus Kryptographieverfahren, das eine gesicherte modulare Potenzierung gegen Angriffe mit verborgenen Kanälen ohne Kenntnis des öffentlichen Exponenten umfasst, Kryptoprozessor zur Umsetzung des Verfahrens und dazugehörige Chipkarte
JP5390844B2 (ja) * 2008-12-05 2014-01-15 パナソニック株式会社 鍵配布システム、鍵配布方法
ITMI20111992A1 (it) * 2011-11-03 2013-05-04 St Microelectronics Srl Metodo per crittografare un messaggio mediante calcolo di funzioni matematiche comprendenti moltiplicazioni modulari
WO2019191040A1 (en) * 2018-03-28 2019-10-03 Cryptography Research, Inc. Using cryptographic blinding for efficient use of montgomery multiplication
US11468797B2 (en) 2020-06-24 2022-10-11 Western Digital Technologies, Inc. Low complexity conversion to Montgomery domain
US11508263B2 (en) 2020-06-24 2022-11-22 Western Digital Technologies, Inc. Low complexity conversion to Montgomery domain
IT202100032048A1 (it) 2021-12-21 2023-06-21 Nextage S R L Sistema di gestione di dati criptati e metodo di ricerca di dati criptati
WO2023141933A1 (en) 2022-01-28 2023-08-03 Nvidia Corporation Techniques, devices, and instruction set architecture for efficient modular division and inversion
WO2023141934A1 (en) * 2022-01-28 2023-08-03 Nvidia Corporation Efficient masking of secure data in ladder-type cryptographic computations

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5003596A (en) * 1989-08-17 1991-03-26 Cryptech, Inc. Method of cryptographically transforming electronic digital data from one form to another
FR2726667B1 (fr) * 1994-11-08 1997-01-17 Sgs Thomson Microelectronics Procede de mise en oeuvre de multiplication modulaire selon la methode montgomery
US6748410B1 (en) * 1997-05-04 2004-06-08 M-Systems Flash Disk Pioneers, Ltd. Apparatus and method for modular multiplication and exponentiation based on montgomery multiplication
JP2001527673A (ja) 1997-05-04 2001-12-25 フォートレス ユー アンド ティー リミティド モントゴメリー乗算に基づくモジュラ乗算及び累乗の改善された装置と方法
US5991415A (en) 1997-05-12 1999-11-23 Yeda Research And Development Co. Ltd. At The Weizmann Institute Of Science Method and apparatus for protecting public key schemes from timing and fault attacks
DE69826963T2 (de) * 1997-11-04 2005-11-17 Nippon Telegraph And Telephone Corp. Gerät für die modulare Inversion zur Sicherung von Information
US6085210A (en) * 1998-01-22 2000-07-04 Philips Semiconductor, Inc. High-speed modular exponentiator and multiplier
US6298442B1 (en) 1998-06-03 2001-10-02 Cryptography Research, Inc. Secure modular exponentiation with leak minimization for smartcards and other cryptosystems
FI107487B (fi) * 1999-03-08 2001-08-15 Nokia Mobile Phones Ltd Datalähetyksen salausmenetelmä radiojärjestelmässä
FR2828608B1 (fr) 2001-08-10 2004-03-05 Gemplus Card Int Procede securise de realisation d'une operation d'exponentiation modulaire
JP4360792B2 (ja) * 2002-09-30 2009-11-11 株式会社ルネサステクノロジ べき乗剰余演算器
US7532720B2 (en) * 2003-10-15 2009-05-12 Microsoft Corporation Utilizing SIMD instructions within montgomery multiplication

Also Published As

Publication number Publication date
EP1692800A2 (de) 2006-08-23
EP1692800B1 (de) 2010-06-30
WO2005048008A2 (en) 2005-05-26
ATE472769T1 (de) 2010-07-15
WO2005048008A3 (en) 2005-11-24
EP1692800A4 (de) 2009-04-29

Similar Documents

Publication Publication Date Title
NO20044028L (no) Bruk av isogenier for utvikling av kryptosystemer
EA201891822A1 (ru) Безопасность персональных устройств с использованием криптографии на основе эллиптических кривых для разделения секрета
HK1076883A1 (en) Trusted system clock
ATE374478T1 (de) System und verfahren für das erneuern von schlüsseln, welche in public-key kryptographie genutzt werden
ATE422125T1 (de) Generierungs- und verifizierungsverfahren durch benutzung von time lock puzzle
ATE514271T1 (de) Anordnung und verfahren zur sicheren datenübertragung
DE602008000738D1 (de) Beschleunigung von Berechnungen im Galois-Counter-Modus
DE602004027943D1 (de) Verbesserte natürliche montgomery-exponentenmaskierung
RU2011148528A (ru) Способ и система защиты криптографического устройства
Galindo et al. Implementation of a leakage-resilient ElGamal key encapsulation mechanism
DE602004024407D1 (de) System und verfahren zur anzeige der verschlüsselungsstärke
BRPI0611402A2 (pt) determinação de um inverso modular
ATE422278T1 (de) Verfahren und vorrichtung zum ermitteln eines schlüsselpaars und zum erzeugen von rsa-sclüsseln
Bhavana Data Security in Cloud environments
DE60325732D1 (de) Kryptographisches verfahren und einrichtungen zur ermöglichung von berechnungen während transaktionen
MY181899A (en) Method of providing trusted application services
GB0522093D0 (en) Method and device using one-time pad data
US20100195830A1 (en) Electronic data encryption and encrypted data decryption system, and its method
Xuan et al. Comparison research on digital signature algorithms in mobile web services
TW200635318A (en) Method for computing inversion in galois field
Han et al. The combined use of FAPKC without compromising the security of the cryptosystem.
Chowdhury et al. Proposal of a new block cipher reasonably non-vulnerable against cryptanalytic attacks
Grosu Hill's Cipher: Analysis of the Cryptographic Computational Times in the Eventuality of a Brute-Force Attack
McKee et al. On a cryptosystem of Vanstone and Zuccherato
FR3018372B1 (fr) Generation de message pour test de generation de cles cryptographiques