How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields

DOI10.1016/J.INS.2019.10.007zbMath1456.68016OpenAlexW2980257992WikidataQ127113133 ScholiaQ127113133MaRDI QIDQ1999182

Jia Yu, Hanlin Zhang, Chengliang Tian, Qiang Zhou, Feng Jun Li

Publication date: 18 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.10.007

zbMATH Keywords

cloud computingextended Euclidean algorithmcomputation outsourcinglarge-scale polynomialsunimodular matrix transformation

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06) Randomized algorithms (68W20) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Internet topics (68M11) Computer security (68M25)

Related Items (1)

Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures

Uses Software

• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure outsourcing of modular exponentiations under single untrusted programme model
• Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
• Speeding up exponentiation using an untrusted computational resource
• Sanitization of FHE Ciphertexts
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Choosing Parameters for NTRUEncrypt
• Secure Optimization Computation Outsourcing in Cloud Computing: A Case Study of Linear Programming
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• The Probability of Relatively Prime Polynomials
• Fully homomorphic encryption using ideal lattices
• Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
• Theory of Cryptography
• Factoring polynomials over finite fields: A survey

This page was built for publication: How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields