Cryptography Reference
In-Depth Information
[48] J. Brillhart and J.L. Selfridge,
Some factorizations of
2
n
±
1
and related
results
, Math. Comp.
21
(1967), 87-96. (
Cited on page 510.
)
[49] J. Brunner,
The Shockwave Rider
, Ballentine Books, New York (1975).
(
Cited on page 408.
)
[50] J.P. Buhler, H.W. Lenstra Jr., and C. Pomerance,
Factoring integers with
the number field sieve
,in
The Development of the Number Field
Sieve
, A.K. Lenstra and H.W. Lenstra Jr. eds., LNM, Springer-Verlag,
Berlin
1554
(1993), 50-94. (
Cited on pages 524-525.
)
[51] K.W. Campbell and M.J. Weiner,
Proof that DES is not a group
in
Ad-
vances in Cryptology
— CRYPTO '92 Proceedings, Springer-Verlag,
Berlin, LNCS
740
(1993), 518-526. (
Cited on page 132.
)
[52] J. Chadwick,
The Decipherment of Linear B
, Cambridge University
Press, Cambridge, U.K. and New York, USA, Second Ed. (1990). (
Cited on
page 31.
)
[53] D. Chaum,
Blind signatures for untraceable payments
,in
Advances in
Cryptology
, CRYPTO '82, Plenum Press, New York (1983), 199-203.
(
Cited on page 232.
)
[54] D. Chaum,
Online cash checks
,in
Advances in Cryptology
, EURO-
CRYPT '89, Springer-Verlag, Berlin, LNCS
434
(1990), 288-293. (
Cited
on page 232.
)
[55] D.M. Chess,
Virus verification and removal tools and techniques
, Virus
Bulletin, November (1991). (
Cited on page 404.
)
[56] B. Chorr and R.L. Rivest,
A knapsack type public key cryptosystem based
on arithmetic in finite fields
in
Advances in Cryptology
— CRYPTO
'84, Springer-Verlag, Berlin, LNCS
196
(1985), 54-65. (
Cited on page 105.
)
[57] B. Chorr and R. L. Rivest,
A knapsack type public key cryptosystem based
on arithmetic in finite fields
in IEEE Transactions on Information Theory,
34
(1988), 901-909. (
Cited on page 105.
)
[58] C.C. Cocks,
A note on “non-secret” encryption
, GCHQ/CESG publication,
November 20 (1973), 1 page. (
Cited on page 103.
)
[59] C.J. Colbourn and J.H. Dinitz, eds.,
CRCHandbookofCombinatorial
Designs
, CRC Press, Boca Raton, FL (1996). (
Cited on page 457.
)
[60] D. Coppersmith,
The data encryption standard
(
DES
)
and its strength
against attacks
, IBM Journal of Research and Development,
38
,May
(1994), 243-250. (
Cited on pages 117-118.
)
[61] D. Coppersmith,
Small solutions to polynomial equations, and low exponent
RSA vulnerabilities
, J. Cryptol.
10
(1997), 233-260. (
Cited on pages 178-
179.
)
Search WWH ::
Custom Search