Visible to the public Fault tolerant non-linear techniques for scalar multiplication in ECC

TitleFault tolerant non-linear techniques for scalar multiplication in ECC
Publication TypeConference Paper
Year of Publication2019
AuthorsSaffar, Zahra, Mohammadi, Siamak
Conference Name2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)
Date Publishedaug
Keywordsasymmetric cryptography algorithms, case channel error detection codes, cryptographic computations, cryptology, ECC, Elliptic curve cryptography, elliptic curve scalar multiplication point, Encryption, error detection codes, false information, Fault Tolerant, fault tolerant computing, fault tolerant nonlinear techniques, faulty results, Human Behavior, injected faults, Metrics, nonlinear error detection codes, policy-based governance, pubcrawl, public key cryptography, Resiliency, Scalability, Scalar multiplication point, security level, shorter key length
AbstractElliptic curve cryptography (ECC) has shorter key length than other asymmetric cryptography algorithms such as RSA with the same security level. Existing faults in cryptographic computations can cause faulty results. If a fault occurs during encryption, false information will be sent to the destination, in which case channel error detection codes are unable to detect the fault. In this paper, we consider the error detection in elliptic curve scalar multiplication point, which is the most important operation in ECC. Our technique is based on non-linear error detection codes. We consider an algorithm for scalar multiplication point proposed by Microsoft research group. The proposed technique in our methods has less overhead for additions (36.36%) and multiplications (34.84%) in total, compared to previous works. Also, the proposed method can detect almost 100% of injected faults.
Citation Keysaffar_fault_2019