Fast multi-precision multiplication for public-key cryptography on embedded microprocessors (Q5918131): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129599653, #quickstatements; #temporary_batch_1724872475876
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Cryptographic Hardware and Embedded Systems - CHES 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Hardware and Embedded Systems - CHES 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting cryptographic key sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information and communications security. 8th international conference, ICICS 2006, Raleigh, NC, USA, December 4--7, 2006. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448406 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129599653 / rank
 
Normal rank

Latest revision as of 21:23, 28 August 2024

scientific article; zbMATH DE number 6970575
Language Label Description Also known as
English
Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
scientific article; zbMATH DE number 6970575

    Statements

    Fast multi-precision multiplication for public-key cryptography on embedded microprocessors (English)
    0 references
    0 references
    0 references
    1 November 2018
    0 references
    0 references
    multi-precision arithmetic
    0 references
    microprocessors
    0 references
    elliptic curve cryptography
    0 references
    RSA
    0 references
    embedded devices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references