The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography (Q2566002): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.050 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074152152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Areas in Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SIGNED BINARY MULTIPLICATION TECHNIQUE / rank
 
Normal rank
Property / cites work
 
Property / cites work: SUBBLOCK OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution results for low-weight binary representations for pairs of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of linear combination algorithms in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence rates in the central limit theorems for combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal left-to-right binary signed-digit recoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Cryptology – CT-RSA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500961 / rank
 
Normal rank

Latest revision as of 16:32, 10 June 2024

scientific article
Language Label Description Also known as
English
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
scientific article

    Statements

    The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 September 2005
    0 references
    0 references
    Signed digit expansion
    0 references
    Left-to-right algorithm
    0 references
    Joint expansion
    0 references
    Public-key cryptography
    0 references
    0 references