Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems (Q5386085): 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.1007/978-3-540-77224-8_16
+Normal rank
@@ Property / OpenAlex ID @@
+W1607148308
@@ Property / OpenAlex ID: W1607148308 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4387319
@@ Property / cites work: Q4387319 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast fault-tolerant digital convolution using a polynomial residue number system
+Normal rank
@@ Property / cites work @@
+On the importance of eliminating errors in cryptographic computations
+Normal rank
@@ Property / cites work @@
+Q4248250
@@ Property / cites work: Q4248250 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-tolerant computations over replicated finite rings
+Normal rank
@@ Property / cites work @@
+Q4941869
@@ Property / cites work: Q4941869 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3765876
@@ Property / cites work: Q3765876 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Codes Over Certain Finite Fields
@@ Property / cites work: Polynomial Codes Over Certain Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+Q4343015
@@ Property / cites work: Q4343015 / rank @@
+Normal rank