Прикладная криптография / 9

1267. B. Preneel, R. Govaerts, and J. Vandewalle,

"An Attack on Two Hash Functions by

Zheng-Matsumoto-Imai, " Advances in Cryptology ASIACRYPT '92 Proceedings,

Springer-Verlag, 1993, pp. 535-538.

1268.

B. Preneel, R. Govaerts, and J. Vandewalle,

"Hash Functions Based on Block Ciphers: A

Synthetic Approach, " Advances in Cryptology CRYPTO '93 Proceedings, Springer-

Verlag, 1994, pp.368-378.

1269.

B. Preneel, M. Nuttin, V. Rijmen, and J.

Buelens, "Cryptanalysts of the CFB mode of the

DES with a Reduced Number of

Rounds," Advances in Cryptology CRYPTO '93

Proceedings, Springer-Verlag,

1994, pp. 212-223.

1270. B. Preneel and V. Rijmen, "On Using Maximum Likelihood to Optimize Recent

Cryptanalytic Techniques, " presented at

the rump session of EUROCRYPT '94, May

1994.

1271.

B. Preneel, W. Van Leekwijck, L. Van Linden, R. Govaerts, and J. Vandewalle,

"Propagation Characteristics of Boolean Functions, " Advances in Cryptology

EUROCRYPT '90 Proceedings, Springer-Verlag, 1991, pp. 161-173.

1272.

W.H. Press, B.R Flannery, S.A. Teukolsky,

and W.T. Vetterling, Numerical Recipes in

C: The Art of Scientific Computing, Cambridge University Press, 1988.

1273.

W. Price, "Key Management for Data Encipherment, " Security: Proceedings of IFIP/SEC

'83, North Holland: Elsevier SciencePublishers 1983.

1274.

G.R Purdy, "A High-Security Log-in Proce dure," communications of the ACM, v

17, n. 8,

Aug 1974, pp. 442-445.

1275.

J.-J. Quisquater, "Announcing the Smart -Card with RSA Capability, " Proceedings of the

Conference: IC Cards and Applications, Today and Tomorrow, Amsterdam, 1989.

1276. J.-J. Quisquater and C. Couvreur, "Fast Decipherment Algorithm for RSA Public

Key

Cryptosystem," Electronic Letters, v. 18, 1982, pp. 155-168.

1277.

J.-J. Quisquater and J.-R Delescaille,

"Other Cycling Tests for DES," Advances

in

Cryptology CRYPTO '87 Proceedings,

Springer-Verlag, 1988, pp. 255-256.

1278.

J.-J. Quisquater and Y.G. Desmedt, "Chinese Lotto as an Exhaustive Code-Breaking

Machine," Computer. v. 24, n. 11, Nov

1991, pp. 14-22.

1279.

J.-J. Quisquater and M. Girault, "2p-bit

Hash Functions Using e-bit Symmetric

Block

Cipher Algorithms, Advances in Cryptology EUROCRYPT '89 Proceedings, Springer-

Verlag, 1990, pp. 102-109.

1280. J.-J. Quisquater and L.C. Guillou, "Des

Procedes d'Authentification Bases sur une

Publication de Problemes Complexes et

Personnalises dont les Solutions Maintenues

n.2, May 1980, pp.273-280.

1286.

M.O. Rabin, "How to Exchange Secrets by Oblivious Transfer," Technical Memo TR 81,

Aiken Computer Laboratory, Harvard University, 1981.

1287. M.O. Rabin, "Fingerprinting by Random

Polynomials, " Technical Report TR15-81,

Center for Research in Computing Technology, Harvard University, 1981.

1288.

T. Rabin and M. Ben-Or, "Verifiable Secret

Sharing and Multiparty Protocols with

Honest Majority," Proceedings of the 21st ACM Symposium on the Theory of Computing,

1989, pp. 73-85.

1289.

RAND Corporation, A Million Random Digits with 100,000 Normal Deviates, Glencoe,

IL: Free Press Publishers, 1955.

1290.

T.R.N. Rao, "Cryposystems Using Algebraic Codes," International Conference on

Computer Systems and Signal Processing,

Bangalore, India, Dec 1984.

1291.

T.R.N. Rao, "On Struit-Tilburg Cryptanalysis of Rao-Nam Scheme," Advances in

Cryptology CRYPTO '87 Proceedings, Springer-Verlag, 1988, pp. 458-460.

1292.

T.R.N. Rao and K.H. Nam, "Private-Key

Algebraic-Coded Cryptosystems, " Advances in

Cryptology CRYPTO '86 Proceedings, Springer-Verlag, 1987, pp.35-48.

1297.

J.A. Reeds and J.L. Manferdelli, "DES Has No Per Round Linear Factors," Advances in

Cryptology: Proceedings of CRYPTO 84, Springer-Verlag, 1985, pp. 377-389.

1298.

J.A. Reeds and N.J.A. Sloane, "Shift Register Synthesis (Modulo m)," SIAM Journal on

Computing, v. 14, n. 3, Aug 1985, pp. 505-513.

1299.

J.A. Reeds and P.J. Weinberger, "File Security and the UNIX Crypt Command, " AT &T

Technical Journal, v. 63, n. 8, Oct 1984, pp. 1673-1683.

1300.

T. Renji, "On Finite Automaton One-Key Cryptosystems," Fast Software Encryption,

Signature, " Chinese Journal of Computers,

v. 8, 1985, pp. 401 -409. (In Chinese.)

1302.

T. Renji and C. Shihua, "Two Varieties of

Finite Automaton Public Key Cryptosystems

and Digital Signature, " Journal of

Computer Science and Tecnology, v. 1, 1986, pp. 9-18.

(In Chinese.)

1303.

T. Renji and C. Shihua, "An Implementation

of Identity-based Cryptosystems and

Signature Schemes by Finite Automaton Public

Key Cryptosystems," Advances in

Cryptology CHINACRYPT '92, Bejing: Science

Press, 1992, pp.87-104. (In Chinese.)

1304.

T. Renji and C. Shihua, "Note on Finite Automaton Public Key Cryptosystems, "

CHINACRYPT '94, Xidian, China, 11-15

Nov 1994, pp. 76-80.

1305.

Research and Development in Advanced

Communication Technologies in Europe, RIPE

Integrity Primitives: Final Report of

RACE Integrity Primitives Evaluation (R1040),

RACE, June 1992.

Information Theory, v. IT-30, n. 5, Sep

1984, pp. 775-776.

1307.

P. Ribenboim, The Book of Prime Number Records, Springer-Verlag, 1988.

1308.

P. Ribenboim, The Little Book of Big

Primes, Springer-Verlag, 1991.

1318. R.L. Rivest, "The MD4 Message Digest

Algorithm," RFC 1186, Oct 1990.

1319. R.L. Rivest, "The MD4 Message Digest

Algorithm," Advances in Cryptology CRYPTO

1993.

1347.

RSA Laboratories, "PKCS #5: Password-Based Encryption Standard," version 1.5,

Nov

1993.

1348.

RSA Laboratories, "PKCS #6: Extended-Certificate Syntax Standard," version 1.5,

Nov

1993.

1349.

RSA Laboratories, "PKCS #7: Cryptographic Message Syntax Standard," version

1.5,

Nov 1993.

1355.

A.D. Rubin and P. Honeyman, "Formal

Methods for the Analysis of Authentication

Protocols," draft manuscript, 1994.

1356.

F. Rubin, "Decrypting a Stream Cipher

Based on J-K Flip-Flops, " IEEE Transactions on

Computing. v. C-28, n. 7, Jul l 97Y,

pp. 483 487.

1357.

R.A. Rueppel, Analysis and Design of Stream Ciphers, Springer-Verlag, 1986.

1358.

R.A. Rueppel, "Correlation Immunity and the Summation Combiner," Advances in

Cryptology EUROCRYPT '85, Springer-Verlag, 1986, pp. 260-272.

1359.

R.A. Rueppel, "When Shift Registers Clock Themselves," Advances in Cryptology

EUROCRYPT '87 Proceedings, Springer-Verlag, 1987, pp. 53-64.

1360.

R.A. Rueppel, "Security Models and

Notions for Stream Ciphers," Cryptography and

Coding 11, C. Mitchell, ed., Oxford: Clarendon Press, 1992, pp. 213 230.

1361. R.A. Rueppel, "On the Security of

Schnorr's Pseudo-Random Sequence Generator,"

Advances in Cryptology EUROCRYPT 89 Proceedings, Springer-Verlag, 1990, pp. 423-

428.

1362. R.A. Rueppel, "Stream Ciphers," Contemporary Cryptology: The Science of Information

Integrity, G.J. Simmons, ed., IEEE Press, 1 992, pp. 65-134.

1363.

R.A. Rueppel and J.L. Massey, "The Knapsack as a Nonlinear Function," IEEE

International Symposium on Information Theory, Brighton, UK, May 1985.

1364.

R. A. Rueppel and O. J. Staffelbaeh, " Products of Linear Recurring Sequences with

Maximum Complexity, " IEEE Transactions on Information Theory, v. IT-33, n. 1, Jan

1987, pp. 124-131.

1365.

D. Russell and G.T. Gangemi, Computer

Security Basics, O'Reilly and Associates, Inc.,

1991.

1366.

S. Russell and P. Craig, "Privacy Enhanced Mail Modules for ELM," Proceedings of the

Internet Society 1994 Workshop on Network and Distributed System Security, The

Internet Society, 1994, pp. 21-34.

1367.

D.F.H. Sadok and J. Kelner, "Privacy Enhanced Mail Design and Implementation

Perspectives," Computer Communications Review, v. 24, n. 3, Jul 1994, pp. 38 -46.

Random Sources, " 70lzrnal of Computer

and System Sciences, v.33, 1986, pp. 75-87.

1377. S. Saryazdi, "An Extension to EIGamal

Public Key Cryptosystem with a New Signature

Scheme," Proceedings of the 1990 Bilkent International Conference O n New Trends in

Communication, Control, and

Signal Processing, North Holland: Elsevier Science

Publishers, 1990, pp. 195-198.

1378. J.E. Savage, "Some Simple SelfSynchronizing Digital Data Scramblers." Bell System

Technical Journal, v. 46, n. 2,

Feb 1967, pp. 448 -487.

1383.

A. Scherbius, "Ciphering Machine," U.S. Patent #1,657,411, 24 Jan 1928.

1384. J.I. Schiller, "Secure Distributed Computing," Scientific American, v. 271, n.5, Nov

1994,

pp. 72-76.

1385. R. Schlafly, "Complaint Against Exclusive Federal Patent License," Civil Action File

No.

C-93 20450, United States District Court for the Northern District of California.

1386.

B. Schneier, "One-Way Hash Functions," Dr. Dobb's journal, v. 16, n. 9, Sep 1991,

pp.

148-151.

1389.

B. Schneier, "The Blowfish Encryption Algorithm," Dr. Dobb's Journal, v. 19, n. 4, Apr

1994, pp. 38-40.

1390. B. Schneier. Protect Your Macintosh,

Peachpit Press, 1994.

1391.

B. Schneier, "Designing Encryption Algorithms for Real People, " Proceedings of the

1994

ACM SIGSAC New Secunty Paradigms Workshop, IEEE Computer Society Press, 1994,

pp. 63-71.

1392.

B. Schneier, "A Primer on Authentication and Digital Signatures," Computer Secu rity

lournal, v. 10, n. 2, 1994, pp. 38-40.

1393.

B. Schneier, "The GOST Encryption Algorithm," Dr. Dobb's journal, v. 20, n. 1, Jan

95,

pp. 123-124.

1394.

B. Schneier, E-Mail Security (with POP and SEM) New York: John Wiley & Sons, 1995.

1395.

C.P Schnorr, "On the Construction of

Random Number Generators and Random

Function Generators," Advances in Cryptology EUROCRYPT '88 Proceedings, Springer-

Verlag, 1988, pp. 225-232.

1396.

C.P Schnorr, "Efficient Signature General tion for Smart Cards," Advances in Cryptology

CRYPTO '89 Proceedings, Springer-Verlag, 1990, pp. 239-252.

1397.

C.P. Schnorr, "Efficient Signature Generation for Smart Cards," Journal of

Cryptology,v.4,n.3, 1991,pp. 161-174.

1399.

C.P. Schnorr, "An Efficient Cryptographic

Hash Function, " presented at the rump

session of CRYPTO '91, Aug 1991.

1400.

C.P. Schnorr, "FFT-Hash II, Efficient Cryptographic Hashing, " Advances in Cryptology

EUROCRYPT '92 Proceedings, Springer-Verlag, 1993, pp. 45-54.

1401.

C.P. Schnorr and W. Alexi, "RSA-bits are

0.5 + E Secure," Advances in Cryptology:

Proceedings of EUROCRYPT 84, Springer-Verlag, 1985, pp. 113-126.

1402.

C.R Schnorr and S. Vaudenay, "Parallel FFT-Hashing," Fast Software Encryption,

Cambridge Secunty Workshop Proceedings, Springer-Verlag, 1994, pp. 149-156.

1403.

C.P. Schnorr and S. Vaudenay, "Black Box Cryptanalysis of Hash Networks Based on

Multipermutations, " Advances in Cryptology EUROCRYPT '94 Proceedings, Springer-

Verlag, 1995, to appear.

1404.

W. Schwartau, Information Warfare: Chaos on the Electronic Superhighway, New York:

Thunders Mouth Press, 1994.

1405.

R. Scott, "Wide Open Encryption Design Offers Flexible Implementations," Cryptologia, v.

9, n. 1, Jan 1985, pp. 75-90.

1408. J. Seberry, X.-M. Zhang, and Y. Zheng,

"Nonlinearly Balanced Boolean Functions and

Their Propagation Characteristics, " Advances in Cryptology EUROCRYPT '91

Proceedings, Springer-Verlag, 1994, pp.

49-60.