Cryptanalysis of an Efficient Proof of Knowledge of Discrete Logarithm

Lecture Notes in Computer Science - Germany
doi 10.1007/11745853_3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Discrete Logarithm for Nilpotent Groups and Cryptanalysis of Polylinear Cryptographic System

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Discrete Logarithm Based Protocols

English

Cryptanalysis and Improvement of an Efficient Certificateless Signature Scheme

Communications in Computer and Information Science
MathematicsComputer Science
2012English

Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction Without Pairing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2004English

An Efficient Zero-Knowledge Proof Based Identification Scheme for Securing Software Defined Network

Scalable Computing
Computer Science
2019English

Solving the Discrete Logarithm of a 113-Bit Koblitz Curve With an FPGA Cluster

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Discrete Logarithm Problem With Auxiliary Inputs

English

Hardware Implementation of an Additive Bit-Serial Algorithm for the Discrete Logarithm Modulo 2^k

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy