Fast modular multiplication based on complement representation and canonical recoding (Q3066940): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160903033630
+Normal rank
@@ Property / OpenAlex ID @@
+W1965773781
@@ Property / OpenAlex ID: W1965773781 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel computation of the multi-exponentiation for cryptosystems
+Normal rank
@@ Property / cites work @@
+New directions in cryptography
@@ Property / cites work: New directions in cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+A public key cryptosystem and a signature scheme based on discrete logarithms
+Normal rank
@@ Property / cites work @@
+A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
+Normal rank
@@ Property / cites work @@
+Optimal left-to-right binary signed-digit recoding
+Normal rank
@@ Property / cites work @@
+Q4398780
@@ Property / cites work: Q4398780 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient implementation of algorithms for approximate exponentiation
+Normal rank
@@ Property / cites work @@
+Fast exponentiation by folding the signed-digit exponent in half
+Normal rank
@@ Property / cites work @@
+A method for obtaining digital signatures and public-key cryptosystems
+Normal rank
@@ Property / cites work @@
+Quadratic residues and the combinatorics of sign multiplication
+Normal rank
@@ Property / cites work @@
+Fast binary multiplication by performing dot counting and complement recoding
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3066940