Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
43
views
0
references
Top references
cited by
26
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,558
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — EUROCRYPT ’96
Finding a Small Root of a Univariate Modular Equation
other
Author(s):
Don Coppersmith
Publication date
(Online):
July 13 2001
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
SAXS
Author and book information
Book Chapter
Publication date (Print):
1996
Publication date (Online):
July 13 2001
Pages
: 155-165
DOI:
10.1007/3-540-68339-9_14
SO-VID:
e4d683e2-ca31-430e-8f06-175205eb9cd7
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Low-Exponent RSA with Related Messages
pp. 10
Generating EIGamal Signatures Without Knowing the Secret Key
pp. 19
On the Security of Two MAC Algorithms
pp. 72
Multi-Authority Secret-Ballot Elections with Linear Work
pp. 84
Asymmetric Fingerprinting
pp. 143
Designated Verifier Proofs and Their Applications
pp. 155
Finding a Small Root of a Univariate Modular Equation
pp. 178
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
pp. 190
Publicly Verifiable Secret Sharing
pp. 212
The Security of the Gabidulin Public Key Cryptosystem
pp. 224
Non-Linear Approximations in Linear Cryptanalysis
pp. 245
An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
pp. 307
Foiling Birthday Attacks in Length-Doubling Transformations
pp. 332
On Diffie-Hellman Key Agreement with Short Exponents
pp. 344
On the Security of a Practical Identification Scheme
pp. 354
Robust Threshold DSS Signatures
pp. 399
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Similar content
2,558
Multivariate and univariate analysis of continuous arterial spin labeling perfusion MRI in Alzheimer's disease.
Authors:
Iris Asllani
,
Christian Habeck
,
Nikolaos Scarmeas
…
Some Issues with Univariate Fractional Polynomial Models
Authors:
Investigating univariate temporal patterns for intrinsic connectivity networks based on complexity and low-frequency oscillation: a test-retest reliability study.
Authors:
Meina T Tang
,
Xianshu Wang
,
Z. Lu
…
See all similar
Cited by
26
RSA-OAEP Is Secure under the RSA Assumption
Authors:
Eiichiro Fujisaki
,
Tatsuaki Okamoto
,
David Pointcheval
…
Finding small roots of univariate modular equations revisited
Authors:
Nicholas Howgrave-Graham
Checking before output may not be enough against fault-based cryptanalysis
Authors:
Sung-Ming Yen
,
M. Joye
See all cited by