Fast binary multiplication by performing dot counting and complement recoding (Q990410): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2007.02.136
+Normal rank
@@ Property / OpenAlex ID @@
+W2042217352
@@ Property / OpenAlex ID: W2042217352 / rank @@
+Normal rank
@@ Property / cites work @@
+A method for obtaining digital signatures and public-key cryptosystems
+Normal rank
@@ Property / cites work @@
+Modular Multiplication Without Trial Division
@@ Property / cites work: Modular Multiplication Without Trial Division / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398780
@@ Property / cites work: Q4398780 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast exponentiation by folding the signed-digit exponent in half
+Normal rank
@@ Property / cites work @@
+Carry propagation in signed digit representations
@@ Property / cites work: Carry propagation in signed digit representations / rank @@
+Normal rank
@@ Property / cites work @@
+New methods for binary multiplication
@@ Property / cites work: New methods for binary multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+New iterative algorithms for modular multiplication
+Normal rank
@@ Property / cites work @@
+A modified method of a class of recently presented cryptosystems
+Normal rank
@@ Property / cites work @@
+Q3379045
@@ Property / cites work: Q3379045 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:990410