The robust arithmetic of finite field for fault-tolerant Tate pairing with binary field

MaRDI QIDQ4898484zbMATHFDO

Authors Gyoyong Sohn

Publication date 2 January 2013

zbMATH Keywords

Tate pairingfault-tolerantrobust codes

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Arithmetic codes (94B40)

Recommendations

• Robust finite field arithmetic for fault-tolerant Tate pairing
• Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems
• scientific article; zbMATH DE number 1979306
• Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
• Hardware architectures for the Tate pairing over GF\((2^{m})\)

Cited in

(1)

• Robust finite field arithmetic for fault-tolerant Tate pairing

This page was built for publication: The robust arithmetic of finite field for fault-tolerant Tate pairing with binary field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4898484)