5 Ergebnisse.

Fully homomorphic encryption is the cryptosystem which supports both addition and multiplication. The existence of the cryptosystems which have efficiency and fully homomorphism would bring great practical implications in the outsourcing of private computations, for instance, in the context of cloud computing.In this book I propose the fully homomorphic public-key encryption (FHPKE) with composite number modulus based on the discrete logarithm...

Since Diffie and Hellman proposed the concept of key agreement protocols (KAP) and public key cryptosystems (PKC) in 1976, various KAP and PKC were proposed. The typical examples of KAP and PKC are almost based on the factoring problem of large integers, the discrete logarithm problem over finite fields and the elliptic curve discrete logarithm problem. It is said that these problems are efficiently solved in a polynomial time by quantum compu...

Fully homomorphic encryption(FHE) is the cryptosystem which supports both addition and multiplication. The existence of the cryptosystems which have efficiency and fully homomorphism would bring great practical implications in the outsourcing of private computations, for instance, in the context of cloud computing. But FHE scheme which runs fast for practical use is not proposed until now because the scheme requires huge complexity. This book,...

Since Diffie and Hellman proposed the concept of the public key cryptosystem (PKC), key agreement protocol (KAP) and digital signature scheme (DSS) in 1976, various PKC, KAP and DSS were proposed.The signcryption which is a new public-key technology that combines signing and encrypting a message, that is , DSS+PKC or DSS+KAP in a single step was proposed by Y. Zheng in 1997. The signcryption is particularly useful in cloud computing for ensuri...

Gentry's bootstrapping technique is still the only known method for obtaining fully homomorphic encryption. I propose a new fully homomorphic encryption scheme on non-associative octonion ring over finite field without bootstrapping technique. The security of the proposed fully homomorphic encryption scheme is based on computational difficulty to solve the multivariate algebraic equations of high degree while the almost all multivariate crypto...