Artículos en revistas especializadas

Divulgación

Criptografía moderna

Teoría de números y codificación

Seguridad

Criptoanálisis

Artículos

Revistas

Otros

D. Adlemann, J. Reeds, On the cryptanalysis of rotor and substitution-permutation networks. IEEE Trans. on Inform. Theory, 28(4), 578--584, 1982.

D. Angluin, D. Lichtenstein, Provable Security in Crypto-systems: a survey. Yale University, Department of Computer Science, #288, 1983.

American National Standards Institute. Working Draft: American National Standard X9.30-199X: Public Key Cryptography Using Irreversible Algorithms for the Financial Services Industry: Part 1: The Digital Signature Algorithm (DSA). American Bankers Association, Washington, D.C., March 4, 1993.

J.P. Barlow. Decrypting the puzzle palace. Communications of the ACM, 35(7):25--31, July 1992.

P. Beauchemin, G. Brassard, C. Crepeau, C. Goutier, and C. Pomerance. The generation of random numbers that are probably prime. J. of Cryptology, 1:53--64, 1988.

John Bennett, Analysis of the Encryption Algorithm Used in the WordPerfect Word Processing Program. Cryptologia 11(4), 206--210, 1987.

H. A. Bergen and W. J. Caelli, File Security in WordPerfect 5.0. Cryptologia 15(1), 57--66, January 1991.

T. Beth y F.C. Piper, "The Stop-and-Go Generator". Proc. Eurocrypt'84, Springer-Verlag Lecture Notes in Computer Science, No. 209, pp. 88-92, New York 1984.

T. Beth, Algorithm engineering for public key algorithms. IEEE Selected Areas of Communication, 1(4), 458--466, 1990.

E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, vol. 4, #1, 3--72, 1991.

E. Biham, A. Shamir, Differential cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and LUCIFER. In Proceedings of CRYPTO '91, ed. by J. Feigenbaum, 156--171, 1992.

E. Biham and A. Shamir. Differential cryptanalysis of the full 16-round DES. In Advances in Cryptology --- Crypto '92, Springer-Verlag, New York, 1993.

M. Blum and S. Goldwasser. An efficient probabilistic public-key encryption scheme which hides all partial information. In Advances in Cryptology --- Crypto '84, pages 289--299, Springer-Verlag, New York, 1985.

B. den Boer and A. Bosselaers. An attack on the last two rounds of MD4. In Advances in Cryptology --- Crypto '91, pages 194--203, Springer-Verlag, New York, 1992.

J. BOYAR, "Inferring Sequences Produced by Pseudorandom Number Generators". J. ACM. Vol. 36, No. 1, pp. 129-144, Jan. 1989.

J. Brandt and I. Damgard. On generation of probable primes by incremental search. In Advances in Cryptology --- Crypto '92, Springer-Verlag, New York, 1993. [BRI 86] E. Brickell, J. Moore, M. Purtill, Structure in the S-boxes of DES. In Proceedings of CRYPTO '86, A. M. Odlyzko ed., 3--8, 1987.

E.F. BRICKELL y A.M. ODLYZKO, "Cryptanalysis: A Survey of Recent Results". Proc. IEEE. Vol. 76, No. 5, pp. 578-593, May. 1988.

J. Brillhart, D.H. Lehmer, J.L. Selfridge, B. Tuckerman, and S.S. Wagstaff Jr. Factorizations of b^n +/- 1, b=2,3,5,6,7,10,11,12 up to High Powers. Volume 22 of Contemporary Mathematics, American Mathematical Society, Providence, Rhode Island, 2nd edition, 1988.

L. Brown, A proposed design for an extended DES, Computer Security in the Computer Age. Elsevier Science Publishers B.V. (North Holland), IFIP, W. J. Caelli ed., 9--22, 1989.

L. Brown, J. Pieprzyk, J. Seberry, LOKI - a cryptographic primitive for authentication and secrecy applications. In Proceedings of AUSTCRYPT 90, 229--236, 1990.

M.V.D. Burmester, Y.G. Desmedt, and T. Beth. Efficient zero-knowledge identification schemes for smart cards. Computer Journal, 35:21--29, 1992.

P. Caballero y A. Fuster: Algoritmo de cálculo de una cuota inferior de la complejidad lineal del filtrado no lineal. Actas de la III Reunión Española sobre Criptología. 1992, Nov. 1994.

H. Gustafson, E. Dawson, W. Caelli, Comparison of block ciphers. In Proceedings of AUSCRYPT '90, J. Seberry and J. Piepryzk eds., 208--220, 1990.

K.W. Campbell and M.J. Wiener. Proof that DES is not a group. In Advances in Cryptology --- Crypto '92, Springer-Verlag, New York, 1993.

John Carrol and Steve Martin, The Automated Cryptanalysis of Substitution Ciphers. Cryptologia 10(4), 193--209, 1986.

John Carrol and Lynda Robbins, Automated Cryptanalysis of Polyalphabetic Ciphers. Cryptologia 11(4), 193--205, 1987.

W.G. CHAMBERS y D. GOLLMANN, "Generators for Sequences with Near-Maximal Linear Equivalence". IEE Proceedings. Vol. 135, Pt E, No. 1, pp. 67-69, Jan. 1988.

Ben Zion Chor y Ronald L. Rivest: A knapsack-type public key cryptosystem based on aritmetic in finite fields. IEEE Trans on Information Theory, 901--909, vol 34, Sep, 1988.

D. Coppersmith: Fast evaluation of logarithms in fields of characteristic two. IEEE Trans on Information Theory, 587--594, vol 30, Jul, 1984.

D. Coppersmith, A.M. Odlyzko, and R. Schroeppel. Discrete logarithms in GF(p). Algorithmica, 1:1--15, 1986.

M. Davio, J. Goethals, Elements of cryptology. in Secure Digital Communications, G. Longo ed., 1--57, 1983.

Dorothy E. Denning. The Clipper encryption system. American Scientist, 81(4):319--323, July--August 1993.

Dorothy E. Denning y Miles E. Smid: Key Escrowing Today. IEEE Communications Magazine, 58--68, Sept. 1994.

W. Diffie and M.E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22:644--654, 1976.

W. Diffie and M.E. Hellman. Exhaustive cryptanalysis of the NBS Data Encryption Standard. Computer, 10:74--84, 1977.

W. Diffie, M. Hellman, Privacy and Authentication: An introduction to cryptography. IEEE proceedings, 67(3), 397--427, 1979.

W. Diffie, The first ten years of public key cryptography. IEEE proceedings, 76(5), 560--577, 1988.

T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31:469--472, 1985.

Carl M. Ellison, A Solution of the Hebern Messages. Cryptologia, vol. XII, #3, 144-158, Jul 1988.

S. Even, O. Goldreich, DES-like functions can generate the alternating group. IEEE Trans. on Inform. Theory, vol. 29, #6, 863--865, 1983.

H. Feistel, Cryptography and Computer Privacy. Scientific American, 228(5), 15--23, 1973.

H. Feistel, H, W. Notz, J. Lynn Smith. Some cryptographic techniques for machine-to-machine data communications, IEEE proceedings, 63(11), 1545--1554, 1975.

A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology --- Crypto '86, pages 186--194, Springer-Verlag, New York, 1987.

A. Fúster, D. De La Guía, J. Negrillo, F. Montoya. Estructuras no lineales para la generación de secuencias binarias de Aplicación Criptográfica. Actas Del IV Simposium Nacional De La Union Cientifica Internacional De Radio. 1991. Pags 904 a 908. Septiembre. Caceres.

A. Fúster, D. de la Guía, J. Negrillo, F. Montoya. Diseño e implementación de algoritmos de generación de secuencias binarias. Actas de la I Reunion Española sobre Criptografia. 1991. Octubre. Palma de Mallorca.

A. Fuster, R. E. Lillo: Visión probabilística de las secuencias binarias de aplicación criptográfica. Actas de la II Reunion Española sobre Criptografia. 1992. Octubre. Madrid.

A. Fuster y P. Caballero: On the linear complexity of nonlinearly filtered PN-sequences. Pre-Proceedings of the ASIACRPT'94 61--71. . Wollongong, Australia, Nov 1994.

G. Garon, R. Outerbridge, DES watch: an examination of the sufficiency of the Data Encryption Standard for financial institutions in the 1990's. Cryptologia, vol. XV, #3, 177--193, 1991.

P.R.Geffe, "How to Protect Data with Ciphers that Are Really Hard to Break". Electronics. Vol. 46, No. 1, Jan. 1973.

Shafi Goldwasser, Silvio Micali, Probabilistic Encryption and How To Play Mental Poker Keeping Secret All Partial Information. Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, 1982.

S. Goldwasser and S. Micali. Probabilistic encryption. J. of Computer and System Sciences, 28:270--299, 1984.

D.M. Gordon and K.S. McCurley. Massively parallel computation of discrete logarithms. In Advances in Cryptology --- Crypto '92, Springer-Verlag, New York, 1993.

D. de la Guía, F. Montoya, E. Valderrama y Ll. Porta: ASIC-CRIPTO: un circuito integrado para el módulo de seguridad del PLANBA. Actas de la III Reunión Española sobre Criptología. 1992, Nov. 1994.

D. de la Guía y A. Fuster: Arquitecturas criptográficas a partir de productos modulares. Actas de la III Reunión Española sobre Criptología. 1992, Nov. 1994.

D. de la Guía y A. Fuster: Módulo de Cifrado para Seguridad en Redes de Transmisión de Datos. Actas del IX Symposium Nacional de la Union Científica Internacional de Radio, 852--856. Las Palmas, Sep. 1994.

J. Hastad. Solving simultaneous modular equations of low degree. SIAM J. Computing, 17:336--241, 1988.

M.E. Hellman. A cryptanalytic time-memory trade off. IEEE Transactions on Information Theory, IT-26:401--406, 1980.

M. Hellman, The mathematics of public key cryptography. Scientific American, 130--139, 1979.

L. Hernandez, F. Montoya, J. Muñoz: Generación de secuencias pseudoaleatorias mediante funciones cuadráticas en Zpn y en su límite proyectivo. Actas de la III Reunión Española sobre Criptología. 1992, Nov. 1994.

D. G. N. Hunter and A. R. McKenzie, Experiments with Relaxation Algorithms for Breaking Simple Substitution Ciphers. Computer Journal 26(1), 1983.

B. Kaliski, R. Rivest, A. Sherman, Is the Data Encryption Standard a Group?, Journal of Cryptology, vol. 1, #1, 1--36, 1988.

J. Kam, G. Davida, A structured design of substitution-permutation encryption networks. IEEE Trans. Information Theory, 28(10), 747--753, 1978.

S. Kent. RFC 1422: Privacy Enhancement for Internet Electronic Mail, Part II: Certificate-Based Key Management. Internet Activities Board, February 1993.

P. Kinnucan, Data encryption gurus: Tuchman and Meyer. Cryptologia, vol. II #4, 371--XXX, 1978.

King and Bahler, Probabilistic Relaxation in the Cryptanalysis of Simple Substitution Ciphers. Cryptologia 16(3), 215--225, 1992.

King and Bahler, An Algorithmic Solution of Sequential Homophonic Ciphers. Cryptologia 17(2), in press.

Martin Kochanski, A Survey of Data Insecurity Packages. Cryptologia 11(1), 1--15, 1987.

Martin Kochanski, Another Data Insecurity Package. Cryptologia 12(3), 165--177, 1988.

X. Lai, J. Massey, A proposal for a new block encryption standard. EUROCRYPT 90, 389--404, 1990.

S. Lakshmivarahan, Algorithms for public key cryptosystems. In Advances in Computers, M. Yovtis ed., 22, Academic Press, 45--108, 1983.

B.A. LaMacchia and A.M. Odlyzko. Computation of discrete logarithms in prime fields. Designs, Codes and Cryptography, 1:47--62, 1991.

S. Landau. Zero knowledge and the Department of Defense. Notices of the American Mathematical Society, 35:5--12, 1988.

A. Lempel, Cryptology in transition, Computing Surveys, 11(4), 285--304, 1979.

H.W. Lenstra Jr. Factoring integers with elliptic curves. Ann. of Math., 126:649--673, 1987.

A.K. Lenstra and H.W. Lenstra Jr. Algorithms in number theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, MIT Press/Elsevier, Amsterdam, 1990.

A.K. Lenstra and M.S. Manasse. Factoring with two large primes. In Advances in Cryptology --- Eurocrypt '90, pages 72--82, Springer-Verlag, Berlin, 1991.

H.W. Lenstra Jr.: On the Cor-Rivest Knapsack Cryptosysthem. Journal of Criptology, 149--155, vol 3, 1991.

C. Rackoff, M. Luby, How to construct psuedorandom permutations from psuedorandom functions. SIAM Journal of Computing, vol. 17, #2, 373--386, 1988.

Michael Lucks, A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers. In CRYPTO '88.

J.L. Massey, "Shift-register synthesis and BCH decoding", IEEE Trans. Informat. Theory, Vol. IT-15, pp. 122-127, Jan. 1969.

J. Massey, An introduction to contemporary cryptology. IEEE proceedings, 76(5), 533--549, 1988.

M. Matsui. Linear cryptanalysis method for DES cipher. In Advances in Cryptology --- Eurocrypt '93, Springer-Verlag, Berlin, 1993.

R.C. Merkle and M.E. Hellman. Hiding information and signatures in trapdoor knapsacks. IEEE Transactions on Information Theory, IT-24:525--530, 1978.

R.C. Merkle and M.E. Hellman. On the security of multiple encryption. Communications of the ACM, 24:465--467, July 1981.

R. Merkle, Fast software encryption functions. In Proceedings of CRYPTO '90, Menezes and Vanstone ed., 476--501, 1991.

E. Messmer. NIST stumbles on proposal for public-key encryption. Network World, 9(30), July 27, 1992.

C. Meyer, Ciphertext/plaintext and ciphertext/key dependence vs. number of rounds for the Data Encryption Standard. AFIPS Conference proceedings, 47, 1119--1126, 1978.

S. Micali. Fair public-key cryptosystems. In Advances in Cryptology --- Crypto '92, Springer-Verlag, New York, 1993.

V.S. Miller. Use of elliptic curves in cryptography. In Advances in Cryptology --- Crypto '85, pages 417--426, Springer-Verlag, New York, 1986.

J. Muñoz Masqué, M. Romera y F. Montoya: Caos en sistemas finitos y secuencias pseudo aleatorias para aplicaciones criptográficas. Actas de la III Reunión Española sobre Criptología. 1992, Nov. 1994.

Data Encryption Standard. National Bureau of Standards, FIPS PUB 46, Washington, DC, January 1977.

National Institute of Standards and Technology (NIST). FIPS Publication 81: DES Modes of Operation. December 2, 1980. Originally issued by National Bureau of Standards.

National Institute of Standards and Technology (NIST). FIPS Publication 46-1: Data Encryption Standard. January 22, 1988. Originally issued by National Bureau of Standards.

National Institute of Standards and Technology (NIST). The Digital Signature Standard, proposal and discussion. Communications of the ACM, 35(7):36--54, July 1992.

National Institute of Standards and Technology (NIST). Publication XX: Announcement and Specifications for a Digital Signature Standard (DSS). August 19, 1992.

National Institute of Standards and Technology (NIST). FIPS Publication 180: Secure Hash Standard (SHS). May 11, 1993.

National Institute of Standards and Technology (NIST). A proposed Federal Information Processing Standard for an Escrowed Encryption Standard (EES). Federal Register, 58(145), July 30, 1993.

A.M. Odlyzko. Discrete logarithms in finite fields and their cryptographic significance. In Advances in Cryptology --- Eurocrypt '84, pages 224--314, Springer-Verlag, Berlin, 1984.

S. Peleg and A. Rosenfeld, Breaking Substitution Ciphers Using a Relaxation Algorithm. CACM 22(11), 598--605, 1979.

Stephen C. Pohlig y Martin E. Hellman: An improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance. IEEE Trans on Information Theory, 106--110. Vol24, Jan 1978.

J. Pollard. Theorems of factorization and primality testing. Proc. Cambridge Philos. Soc., 76:521--528, 1974.

J. Pollard. Monte Carlo method for factorization. BIT, 15:331--334, 1975.

M.O. Rabin. Digitalized signatures as intractable as factorization. Technical Report MIT/LCS/TR-212, MIT, 1979.

J. Reeds, `Cracking' a Random Number Generator. Cryptologia 1(1), 20--26, 1977.

J. A. Reeds and P. J. Weinberger, File Security and the UNIX Crypt Command. AT&T Bell Laboratories Technical Journal, Vol. 63 #8, part 2, 1673--1684, October, 1984.

R.L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120--126, February 1978.

R.L. Rivest. Cryptography. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, MIT Press/Elsevier, Amsterdam, 1990.

R.L Rivest. The MD4 message digest algorithm. In Advances in Cryptology --- Crypto '90, pages 303--311, Springer-Verlag, New York, 1991.

R.L. Rivest. Finding four million random primes. In Advances in Cryptology --- Crypto '90, pages 625--626, Springer-Verlag, New York, 1991.

M. Romera, I. Jimenez, J. Negrillo: Generación de secuencias cifrantes mediante funciones caoticas. Actas de la I Reunion Española sobre Criptografia. 1991. Octubre. Palma de Mallorca.

C.P. Schnorr. Efficient identification and signatures for smart cards. In Advances in Cryptology --- Crypto '89, pages 239--251, Springer-Verlag, New York, 1990.

C. Shannon, Communication Theory of Secrecy Systems. Bell System Technical Journal 28(4), 656--715, 1949.

M. Shand and J. Vuillemin. Fast implementations of RSA cryptography. In Proceedings of the 11th IEEE Symposium on Computer Arithmetic, pages 252--259, IEEE Computer Society Press, Los Alamitos, CA, 1993.

A. Shimizu, S. Miyaguchi, Fast data encipherment algorithm FEAL. EUROCRYPT '87, 267--278, 1988.

K. Shirriff, C. Welch, A. Kinsman, Decoding a VCR Controller Code. Cryptologia 16(3), 227--234, 1992.

T. SIEGENTHALER ,"Correlation-immunity of nonlinear combining functions for cryptographic applications", IEEE Trans. Informat. Theory, Vol. IT-30, pp. 776-780, Sep. 1984.

R.D. Silverman. The multiple polynomial quadratic sieve. Math. Comp., 48:329--339, 1987.

M.E. Smid and D.K. Branstad. Response to comments on the NIST proposed Digital Signature Standard. In Advances in Cryptology --- Crypto '92, Springer-Verlag, New York, 1993.

A. Sorkin, LUCIFER: a cryptographic algorithm. Cryptologia, 8(1), 22--35, 1984.

R. Spillman et al., Use of Genetic Algorithms in Cryptanalysis of Simple Substitution Ciphers. Cryptologia 17(1), 31--44, 1993.

K.C. ZENG, C.H. YANG y T.R. RAO, "On the Linear Consistency Test (LCT) in Cryptoanalysis with Applications", Proc. Crypto´89, Springer-Verlag Lecture Notes in Computer Science, No. 435, pp. 164-174, 1989.

K.C. ZENG, C.H. YANG y T.R. RAO, "Large Primes in Stream-Cipher Cryptography", Proc. Auscrypt´90, Springer-Verlag Lecture Notes in Computer Science, No. 453, pp. 194-205, 1990

Criptonomicón es un servicio ofrecido libremente desde el Instituto de Física Aplicada del CSIC. Para información sobre privacidad, por favor consulte la declaración de política sobre privacidad.