The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-36178-2_19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1986English

New Bivariate Hensel Lifting Algorithm for N Factors

ACM Communications in Computer Algebra
MathematicsComputational MathematicsComputational Theory
2019English

The Discrete Logarithm Problem With Auxiliary Inputs

English

Relaxed P-Adic Hensel Lifting for Algebraic Systems

2012English

Discrete Logarithm Based Protocols

English

On the Discrete Logarithm Problem for Plane Curves

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2012English

The Discrete Logarithm Hides $O(\log N)$ Bits

SIAM Journal on Computing
MathematicsComputer Science
1988English

On the Discrete Logarithm Problem in Elliptic Curves II

Algebra and Number Theory
Number TheoryAlgebra
2013English

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

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy