DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Discrete logarithm
Discrete logarithm
A Public-Key Cryptosystem Based on Discrete Logarithm Problem Over Finite Fields 퐅퐩퐧
2.3 Diffie–Hellman Key Exchange
Making NTRU As Secure As Worst-Case Problems Over Ideal Lattices
The Discrete Log Problem and Elliptic Curve Cryptography
Sieve Algorithms for the Discrete Logarithm in Medium Characteristic Finite Fields Laurent Grémy
Comparing the Difficulty of Factorization and Discrete Logarithm: a 240-Digit Experiment⋆
Discrete Logarithm Based Protocols
11.6 Discrete Logarithms Over Finite Fields
Decisional Diffie-Hellman Problem (DDH)
Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
Discrete Logarithms Aurore Guillevic, François Morain
The Past, Evolving Present and Future of Discrete Logarithm
Two-Party Authenticated Multiple-Key Agreement Based on Elliptic Curve Discrete Logarithm Problem⋆
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
RSA, Integer Factorization, Diffie–Hellman, Discrete Logarithm
The Impact of Quantum Computing on Present Cryptography
Elementary Thoughts on Discrete Logarithms
Key Exchange Diffie-Hellman Key Exchange Discrete Logarithms
Top View
CRYPTREC Review of Eddsa CRYPTREC EX-3003-2020
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
On Improving Integer Factorization and Discrete Logarithm Computation Using Partial Triangulation
8.2 Algorithms for Computing Discrete Logarithms Let G Be a Group for Which the Group Operation Can Be Carried out Efficiently
Solving Discrete Logarithms in Smooth-Order Groups with CUDA1
On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols
How to Backdoor Diffie-Hellman
THE DIFFIE-HELLMAN KEY EXCHANGE in MATRICES OVER a FIELD and a RING by JOSHUA B. NELSON, B.A. a THESIS in MATHEMATICS Submitted
The Impact of the Number Field Sieve on the Discrete Logarithm Problem In
The Discrete-Logarithm Problem with Preprocessing
Diffie-Hellman Key Exchange and the Discrete Log Problem
On Factoring Integers and Evaluating Discrete Logarithms
Trapdoor DDH Groups from Pairings and Isogenies
Algorithms for Integer Factorization and Discrete Logarithms Computation Algorithmes Pour La Factorisation D’Entiers Et Le Calcul De Logarithme Discret
Solving Discrete Logarithms in Smooth-Order Groups with CUDA1
Post-Quantum Cryptosystem Ntruencrypt and Its Advantage Over Pre – Quantum Cryptosystem RSA
Assumptions Related to Discrete Logarithms:Why Subtleties Make A
Mini Topics on RSA and Discrete Logarithm Problem
Batch Verification of Eddsa Signatures
X9.42–2003 Public Key Cryptography for the Financial Services Industry
Ntruencrypt and NTRUMLS
An Overview of Key Exchange Protocols
Discrete Logarithm Problem in Non-Abelian Groups
Integer Factorization and Discrete Logarithm Problems
Recommendation for Discrete Logarithm-Based Cryptography
Discrete Logarithms
Draft SP 800-56A Rev. 3
Computing Elliptic Curve Discrete Logarithms with the Negation Map ⋆
Taming the Many Eddsas
Integer Factorization and Discrete Logarithm Problems Vol
Integer Factorization and Discrete Logarithm Problems Pierrick Gaudry
Cheon's Algorithm, Pairing Inversion and the Discrete Logarithm Problem
Removing the Strong RSA Assumption from Arguments Over the Integers
Attacks on Elliptic Curve Cryptography Discrete Logarithm Problem (EC-DLP)
Lecture on the Invention of Public Key Cryptography
10.1 the Discrete Logarithm Problem in Its Most Standard Form, the Discrete Logarithm Problem in a finite Group G Can Be Stated As Follows
A Group Signature Scheme Based on an RSA-Variant Copyright C 1998, BRICS, Department of Computer Science University of Aarhus
Integer Factorization and Computing Discrete Logarithms in Maple
The Diffie-Hellman Problem and Cryptographic Applications
Non-Interactive Half-Aggregation of Eddsa and Variants of Schnorr Signatures
Computing Elliptic Curve Discrete Logarithms with Improved Baby-Step Giant-Step Algorithm
1 Introduction and Motivation 2 Diffie-Hellman Key Agreement and the Discrete Logarithm Problem
Faster Individual Discrete Logarithms in Finite Fields 3
Cryptosystems Based on Discrete Logarithms
Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem Over Prime fields
Recommendation for Pair-Wise Key Establishment
10 Generic Algorithms for the Discrete Logarithm Problem
Efficient Zero-Knowledge Proofs of Knowledge of Double Discrete Logarithm
Diffie-Hellman Key Exchange Might Not Be Equivalent to Solving the Discrete Logarithm Problem
How Special Is the Elliptic Curve Discrete Logarithm Problem?
Discrete Logarithms on Elliptic Curves
Diffie-Hellman Key-Exchange Protocol This Protocol Allows Two Users To
Discrete Logarithms in Finite Fields and Their Cryptographic Significance
The Equivalence of Strong RSA and Factoring in the Generic Ring Model of Computation Divesh Aggarwal, Ueli Maurer, Igor Shparlinski
Discrete Logarithm and Integer Factorization Using ID-Based Encryption
7.11 Ntruencrypt As a Lattice Cryptosystem
NIST.SP.800-56Ar2
Elliptic Curve Cryptography
The ISP Column DNSSEC with Eddsa
On the Complexity of the Discrete Logarithm and Diffie–Hellman
The Security of All RSA and Discrete Log Bits
The Equivalence of the Computational Diffie–Hellman and Discrete
The Improvement of Ntruencrypt Public Key Cryptosystem: Design and Performance Evaluation
Discrete Logarithm Computation in Finite Fields Fpn with NFS Variants
Integer Factorization and Discrete Logarithm Problems
Another Look at Non-Standard Discrete Log and Diffie-Hellman Problems
The Security of DSA and ECDSA Bypassing the Standard Elliptic Curve Certification Scheme
Elliptic Curve Discrete Logarithm 1 Introduction
The Discrete Logarithm Problem on Elliptic Curves of Trace One
Recommendation for Pair-Wise Key Establishment Schemes Using
Contents 2 Discrete Logarithms in Cryptography
Non-Interactive Half-Aggregation of Eddsa and Variants of Schnorr Signatures
ANOTHER LOOK at HMQV 1. Introduction the MQV Protocols [27]