Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic system

Computer Methods for Discrete Logarithm Problem: a Cryptographic Perspective

Compution of discrete logarithm is of great interest because of its relevance to public key cryptography. It is believed to be a hard problem because no polynomial time solution has been found. One of the generic algorithm in computing discrete logarithm is Pollard rho algorithm (and its derivatives). The algorithm depend on the ”birthday paradox” idea and makes a pseudo-random walk in finite a...

Cryptanalysis of an Efficient Proof of Knowledge of Discrete Logarithm

At PKC 2005, Bangerter, Camenisch and Maurer proposed an efficient protocol to prove knowledge of discrete logarithms in groups of unknown order. We describe an attack that enables the verifier to recover the full secret with essentially no computing power beyond what is required to run the protocol and after only a few iterations of it. We also describe variants of the attack that apply when s...

Some Inequalities for Nilpotent Multipliers of Powerful p-Groups

simulation and design of electronic processing circuit for restaurants e-procurement system

the poor orientation of the restaurants toward the information technology has yet many unsolved issues in regards to the customers. one of these problems which lead the appeal list of later, and have a negative impact on the prestige of the restaurant is the case when the later does not respond on time to the customers’ needs, and which causes their dissatisfaction. this issue is really sensiti...

On the discrete logarithm problem in class groups of curves

We study the discrete logarithm problem in degree 0 class groups of curves over finite fields, with particular emphasis on curves of small genus. We prove that for every fixed g ≥ 2, the discrete logarithm problem in degree 0 class groups of curves of genus g can be solved in an expected time of Õ(q 2 g ), where Fq is the ground field. This result generalizes a corresponding result for hyperell...