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

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2005.03.050
+Normal rank
@@ Property / OpenAlex ID @@
+W2074152152
@@ Property / OpenAlex ID: W2074152152 / rank @@
+Normal rank
@@ Property / cites work @@
+Selected Areas in Cryptography
@@ Property / cites work: Selected Areas in Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+A SIGNED BINARY MULTIPLICATION TECHNIQUE
@@ Property / cites work: A SIGNED BINARY MULTIPLICATION TECHNIQUE / rank @@
+Normal rank
@@ Property / cites work @@
+SUBBLOCK OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS
+Normal rank
@@ Property / cites work @@
+Distribution results for low-weight binary representations for pairs of integers
+Normal rank
@@ Property / cites work @@
+Analysis of linear combination algorithms in cryptography
+Normal rank
@@ Property / cites work @@
+Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms
+Normal rank
@@ Property / cites work @@
+On convergence rates in the central limit theorems for combinatorial structures
+Normal rank
@@ Property / cites work @@
+Optimal left-to-right binary signed-digit recoding
+Normal rank
@@ Property / cites work @@
+Q4529547
@@ Property / cites work: Q4529547 / rank @@
+Normal rank
@@ Property / cites work @@
+Topics in Cryptology – CT-RSA 2005
@@ Property / cites work: Topics in Cryptology – CT-RSA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4500961
@@ Property / cites work: Q4500961 / rank @@
+Normal rank