(Enter summary)
Abstract: , 44
equivalent, 48
admissible, 19
associated, 48
binary addition chain, 45
binary method, 43, 63
Carmichael function, 4
Carmichael number, 16, 29
Chinese Remainder Theorem, 5
complex extension, 3
conjugate, 3
CRT, 5
Dickson polynomials, 11
doubling step, 63
dual, 48
Fermat test, 15, 16
graph
reduced, 48
group of units, 3
in-degree, 45
Jacobi symbol, 6
Legendre symbol, 5
Lucas chain, 62
composite, 63
degenerate, 63
simple, 63
Lucas sequence, 8
Mathematica, 23, 41
Miller-Rabin test, 18
norm, 3... (Update)
Context of citations to this paper: More
.... y q mod p) This attack will also work in the more general case that the authority knows a small multiple cq of q with 0 c w; see [7, 8] for details. Bleichenbacher s attack is particularly pernicious as it means that if an implementer chooses g = 2 for performance reasons,...
Cited by: More
Signature Schemes Based on the Strong RSA Assumption - Cramer, Shoup (1999)
(Correct)
Minding Your P's and Q's - Anderson, Vaudenay (1996)
(Correct)
Active bibliography (related documents): More All
1.0: Efficiency and Security of Cryptosystems Based on Number Theory - Bleichenbacher (1996)
(Correct)
1.0: Efficiency and Security of Cryptosystems based on Number Theory - Bleichenbacher (1996)
(Correct)
0.6: Primality Testing Revisited - Davenport (1992)
(Correct)
Similar documents based on text: More All
0.7: Konventionslexikon zur Transliteration von Spontansprache - Burger
(Correct)
0.6: Distributed Objects - CORBA versus COM: A Comparison of.. - Bergler
(Correct)
0.6: Starved Holes and Active Nuclei - The Central Engine in Galactic.. - Falcke (1994)
(Correct)
Related documents from co-citation: More All
3: Algorithmic Number Theory (context) - Bach, Shallit - 1996
3: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols
- Bellare, Rogaway - 1993
3: Collision-resistant hashing: towards making UOWHFs practical (context) - Bellare, Rogaway - 1997
BibTeX entry: (Update)
D. Bleichenbacher, `Efficiency and Security of Cryptosystems based on Number Theory' Dissertation ETH No. 11404, Swiss Federal Institute of Technology, Zurich (1996) http://citeseer.ist.psu.edu/bleichenbacher96efficiency.html More
@inproceedings{ bleichenbacher96efficiency,
author = "Bleichenbacher and Maurer",
title = "On the Efficiency of One-Time Digital Signatures",
booktitle = "{ASIACRYPT}: Advances in Cryptology -- {ASIACRYPT}: International Conference on the Theory and Application of Cryptology",
publisher = "LNCS, Springer-Verlag",
year = "1996",
url = "citeseer.ist.psu.edu/bleichenbacher96efficiency.html" }
Citations (may not include all citations):
25
There are infinitely many Carmichael numbers
- Alford, Granville et al. - 1994
21
Analytic methods in the analysis and design of numbertheoret.. (context) - Bach - 1985
16
Open problems in number theoretic complexity (context) - Adleman, McCurley - 1994
10
Primality testing and two dimensional Abelian varieties over.. (context) - Adleman, Huang - 1992
7
Le test de primalit'e de Rabin-Miller: Un nombre compos'e qu.. (context) - Arnault - 1991
5
Rabin-Miller primality test: Composite numbers which pass it (context) - Arnault - 1995
5
the difficulty of finding reliable witnesses (context) - Alford, Granville et al. - 1994
4
Universit'e de Poitiers D'epartement de Math'ematiques (context) - Arnault, pseudo-premiers et al. - 1993
Documents on the same site (http://dinis.inf.ethz.ch/publications/diss.de.html): More
Extending a Library for Geometric Computation to Provide.. - De Lorenzi (1995)
(Correct)
Design of Neural Networks Using a Priori Knowledge - Cozzio-Büeler (1995)
(Correct)
The Homotopy Method Applied to the Symmetric Eigenproblem - Oettli (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC