Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques (Q5426314): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Fast Exponentiation Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2773752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. / rank
 
Normal rank

Latest revision as of 12:57, 27 June 2024

scientific article; zbMATH DE number 5210556
Language Label Description Also known as
English
Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
scientific article; zbMATH DE number 5210556

    Statements

    Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques (English)
    0 references
    0 references
    12 November 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Arithmetic algorithm
    0 references
    exponentiation
    0 references
    multiplication
    0 references
    information theory
    0 references
    public key cryptography
    0 references
    0 references