Computational Methods in Public Key Cryptology
نویسنده
چکیده
These notes informally review the most common methods from computational number theory that have applications in public key cryptology.
منابع مشابه
FHPKE with Zero Norm Noises based on DLA&CDH
In this paper I propose the fully homomorphic public-key encryption(FHPKE) scheme with zero norm noises that is based on the discrete logarithm assumption(DLA) and computational Diffie–Hellman assumption(CDH) of multivariate polynomials on octonion ring. Since the complexity for enciphering and deciphering become to be small enough to handle, the cryptosystem runs fast. keywords: fully homomorp...
متن کاملFully Homomorphic Public-key Encryption Based on Discrete Logarithm Problem
In this paper I propose the new fully homomorphic public-key encryption scheme without bootstrapping that is based on the discrete logarithm assumption and computational Diffie–Hellman assumption of multivariate polynomials on octonion ring. The key size of this scheme and complexity for enciphering /deciphering become to be not so large to handle. keywords: fully homomorphic public-key encrypt...
متن کاملFHE with Recursive Ciphertext
In this paper I propose fully homomorphic public-key encryption (FHPKE) with the recursive ciphertex. A ciphertext consists of three sub-ciphertexts corresponding to one plaintext. When we execute the additional operation or multiplicative operation, a new three sub-ciphertexts are generated from the three sub-ciphertexts recursively without revealing the plaintexts. The scheme is based on the ...
متن کاملPublic Key Exchange Using Matrices Over Group Rings
We offer a public key exchange protocol in the spirit of Diffie-Hellman, but weuse (small) matrices over a group ring of a (small) symmetric group as the platform. This“nested structure” of the platform makes computation very efficient for legitimate parties.We discuss security of this scheme by addressing the Decision Diffie-Hellman (DDH) andComputational Diffie-Hellman (CDH) p...
متن کاملKey Replacement Attack on a Certificateless Signature Scheme
Yap, Heng and Goi propose an efficient certificateless signature scheme based on the intractability of the computational DiffieHellman problem, and prove that the scheme is secure in the random oracle model. This paper shows that their certificateless signature scheme is vulnerable to key replacement attacks, where an adversary who replaces the public key of a signer can forge valid signatures ...
متن کامل