discrete logarithm-based cryptography
The Discrete Logarithm Problem in non-representable rings
... For Discrete Logarithm based cryptography, it is desirable to find efficiently implementable groups for which sub-exponential algorithms for the Discrete Logarithm Problem are ...
10
ABSTRACT : In this paper we purposed an image based cryptography that Elliptic Curve cryptography (ECC)
... image based cryptography that Elliptic Curve cryptography (ECC) techniques and encoding technique on images to enhance the security of the communication ...Curve cryptography (ECC) of the ...
5
Compact, Scalable, and Efficient Discrete Gaussian Samplers for Lattice-Based Cryptography
... quantum-safe) cryptography has seen a substantial expansion, due to recent advances in scalable quantum ...communication, based on the hardness of factoring prime numbers (RSA) or the discrete ...
5
An Efficient ID based Proxy Signcryption Scheme without Bilinear Pairings
... Signcryption based on elliptic curves provides the same level of security using smaller keys compared to schemes based on the discrete logarithm problem over finite ...Identity-based ...
6
Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm
... raphy based on the DLP in the group formed by rational points of an elliptic curve defined over a finite ...curve cryptography, it has been proposed to use the divisor class group of a hyperelliptic curve ...
40
Cold Boot Attacks in the Discrete Logarithm Setting
... We observe that essentially no work on cold boot attacks on schemes defined in the discrete log- arithm setting (DL) and particularly for elliptic curve cryptography (ECC) has been conducted. In this paper ...
17
A New Signature Scheme Define over a Class of Non-Abelian Group
... secure based on the hardness of some mathematical problems in a large and finite abelian group (more precisely, finite cyclic groups) (Fiat et ...and discrete logarithm problems (Rivest et ...
8
Hybrid Authentication Cybersystem Based on Discrete Logarithm, Factorization and Array Entanglements
... Eliminating the bottleneck mentioned above is one of major research areas today and will likely occupy hun- dreds of communication specialists and system designers for years ahead. Various PKC algorithms were intro- ...
6
Secure Oblivious Transfer from Semi-Commutative Masking
... are based on exponentiation-only style operations (such as discrete logarithm and isogeny based ...is based on commutative group actions and captures both the action of exponentiation ...
34
Weakness of F_{3^{6*1429}} and F_{2^{4*3041}} for Discrete Logarithm Cryptography
... While the new quasi-polynomial time algorithm (QPA) of Barbulescu et al. is asymp- totic in nature (see §2), Adj et al. [1] showed that, when combined with some steps from classical algorithms, they can have a ...
19
Image Watermarking Scheme based on Visual Cryptography in Discrete Wavelet Transform
... Lena, Kodak, Barbara, Goldhill, Airplane, Lake, Mandrill and Pepper color images of size 512 × 512are used for conducting the experiments, and are shown in Figure 3. The performance of the proposed video watermarking ...
7
On Discrete Logarithm Problem based on Algebraic Varieties over Finite Field and Public Key Cryptosystem
... In this chapter, we propose new DLPs for exponential subfield as a base field and extension of this base field by the product operators over finite fields whic[r] ...
8
Dynamic visual cryptography with Arnolds logarithm using ANN for medical data protection
... as cryptography and neural ...data. Cryptography hidden message in cipher text form so that it is not dependent for illegal party to understand ...a cryptography art- RSA very protected ...
5
Utilization of ECDLP for Constructing a New Certificate Based Digital Signature
... There are two schemes for solving this problem. One of them is certificateless public key cryptography (CL-PKC). This scheme was presented by Al-Riyami and Paterson [3]. In this scheme, a key generating center ...
7
Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems
... for Discrete Logarithm Problem,” Advances in Decision Technology and Intelligent Information Systems, International Institute for Advanced Studies in Systems Research and Cybernetics, Baden-Baden, 2008, ...
6
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials
... Range arguments can be seen as a special case of membership arguments, where L is simply a list of consecutive integers. Many are based on the strong RSA assumption, and use Lagrange’s Four-Square Theorem. Couteau ...
28
MC CDMA PAPR Reduction Using Discrete Logarithmic Method
... Discrete Logarithmic Method (DLM) has earlier been used in cryptography [1]. If an air interface is used as a communication channel, the information of the communication may be exposed to an eavesdropper or ...
6
Analysis of riemann-goldbach conjecture based on circular logarithm
... ) ^-1 The sum of the reciprocal of the two prime numbers is an even odd number. That is to say, each even odd number can be expressed as the sum of the reciprocals of two prime numbers, and ",one prime number plus ...
8
An Encryption and Decryption More Secure Elgamal Cryptosystem
... scheme based on the integration of Enhanced RSA and Elgamal algorithm is ...is based on Integer Factorization Problem ...is based on Discrete Logarithm Problem ...
9
A Digital Signature Scheme Based on Pell Equation
... scheme based on the difficulty of solving the Discrete Logarithm Problem in the multiplicative group of an appropriate finite ...is based on discrete logarithms ...
5