Improving NFS for the Discrete Logarithm Problem in Non-Prime Finite Fields

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-46800-5_6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Discrete Logarithm Problem for Plane Curves

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2012English

The Discrete Logarithm Problem With Auxiliary Inputs

English

On the Discrete Logarithm Problem in Elliptic Curves II

Algebra and Number Theory
Number TheoryAlgebra
2013English

Integer Factorization: Solution via Algorithm for Constrained Discrete Logarithm Problem

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2009English

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

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2004English

A New Approach to the Discrete Logarithm Problem With Auxiliary Inputs

LMS Journal of Computation and Mathematics
Computational TheoryMathematics
2016English

Discrete Logarithm Based Protocols

English

The Minimum Rank Problem Over Finite Fields

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2010English

New Linear Codes Over Non-Prime Fields

Cryptography and Communications
Computational TheoryCommunicationsComputer NetworksApplied MathematicsMathematics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy