Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems (Q5386085): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4387319 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast fault-tolerant digital convolution using a polynomial residue number system / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the importance of eliminating errors in cryptographic computations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4248250 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fault-tolerant computations over replicated finite rings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4941869 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3765876 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial Codes Over Certain Finite Fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4343015 / rank | |||
Normal rank |
Latest revision as of 21:47, 27 June 2024
scientific article; zbMATH DE number 5265306
Language | Label | Description | Also known as |
---|---|---|---|
English | Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems |
scientific article; zbMATH DE number 5265306 |
Statements
Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems (English)
0 references
17 April 2008
0 references