Notes on A Preimage-Resistant Hash Function

János Folláth

doi:10.2478/v10127-012-0041-9

.blurhash-client-img { display: none !important; }

Notes on A Preimage-Resistant Hash Function

Tatra Mountains Mathematical Publications

Volume 53 (2012): Issue 1 (December 2012)

By: János Folláth

Open Access

|Feb 2013

[1] AUMASSON, J.-R:Cryptologia 33 (2009), 1-4.
Open DOI Search in Google Scholar
[2] BÉRCZES, A.-FOLLÁTH, J.-PETHŐ, A.:Tatra Mt. Math. Publ. 47 (2010), 1-13.
Search in Google Scholar
[3] BÉRCZES, A.-JÁRÁSI, L:Period. Math. Hungar. 58 (2008), 35-45.
Open DOI Search in Google Scholar
[4] BÉRCZES, A.-KÖDMÖN, J.-PETHŐ, A.:Period. Math. Hungar.(2004), 1-13.
Open DOI Search in Google Scholar
[5] BUCHMANN, J.-PAULUS, S.:Lecture Notes in Comput. Sei.(1997), 385-394.
Open DOI Search in Google Scholar
[6] CHAO, L. R.-LIN, Y. C.: Associative one-way function and its significances to crypto-graphics, Internat. J. Inform. Management Sci. 5 (1994), 53-59.
Search in Google Scholar
[7] COULTER, R. S.: Planar monomials over fields of prime square order, Proc. Amer. Math. Soc. 134 (2006), 3373-3378.
Open DOI Search in Google Scholar
[8] COULTER, R. S.-HENDERSON, M.: A note on the roots of trinomials over a finite field, Bull. Austral. Math. Soc. 69 (2004), 429-432.
Open DOI Search in Google Scholar
[9] COULTER, R. S.-MATTHEWS R. W.: Planar functions and planes of Lenz-Barlotti class II, Des. Codes Cryptogr. 10 (1997), 167-184.
Open DOI Search in Google Scholar
[10] DEMBOWSKI, P.-OSTROM, T. G.: Planes of order n with collineation groups of order n, Math. Z. 103 (1968), 239-258.
Open DOI Search in Google Scholar
[11] FORRÈ, R.: The strict avalanche criterion: spectral properties of Boolean functions and an extended definition, in: CRYPTO ’88-Advances in Cryptology (S. Goldwasser, ed.), Santa Barbara, California, USA, 1988, Lecture Notes in Comput. Sci., Vol. 403, Springer-Verlag, New York, NY, USA, 1990, pp. 450-468.
Open DOI Search in Google Scholar
[12] GLUCK, D.: A note on permutation polynomials and finite geometries, Discrete Math. 80 (1990), 97-100.
Open DOI Search in Google Scholar
[13] GOLDREICH, O.-LEVIN, L.-NISAN, N.: On constructing 1-1 one-way functions, in: Proc. of the Electronic Colloquium on Computational Complexity (ECCC), Vol. 2, 1995, pp. 1-11.
Search in Google Scholar
[14] HEMASPAANDRA, L. A.-ROTHE, J.: Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory, J. Comput. System Sci. 58 (1999), 648-659.
Open DOI Search in Google Scholar
[15] HIRAMINE, Y.: A conjecture on affine planes of prime order, J. Combin. Theory Ser. A 52 (1989), 44-50.
Open DOI Search in Google Scholar
[16] LI, Y.-CUSICK, T. W.: Strict avalanche criterion over finite fields, Math. Cryptology 1 (2008) 65-78.
Search in Google Scholar
[17] LIDL, R.-NIEDERREITER, H.: Finite Fields. Cambridge University Press, Cambridge, 1997.
Open DOI Search in Google Scholar
[18] MERKLE, R. C.: A fast software one-way hash function, J. Cryptology 3 (1990), 43-58.
Open DOI Search in Google Scholar
[19] MENEZES, A. J.-VAN OORSCHOT, P. C.-VANSTONE, S. A.: Handbook of Applied Cryptography. CRC Press, Boca Raton, 1997.
Search in Google Scholar
[20] PAPADIMITRIOU, C. H.: Computational complexity. Addison-Wesley Publ. Comp., Reading, MA, 1994.
Search in Google Scholar
[21] RÓNYAI, L.- SZONYI, T.: Planar functions over finite fields, Combinatorica 9 (1989), 315-320.
Open DOI Search in Google Scholar
[22] SCHNEIER, B.: Applied Cryptography. John Wiley & Sons, New York, 1996.
Search in Google Scholar
[23] SUN, Q.: A kind of trap-door one-way function over algebraic integers, J. Sichuan Univ., Nat. Sci. Ed. 2 (1986), 22-27.
Search in Google Scholar
[24] WEBSTER, A. F.-TAVARES, S. E.: On the design of S-boxes, in: Advances in Cryptology-CRYPTO ’85 (H. C. Williams, ed.), Santa Barbara, 1985, Lecture Notes in Comput. Sci., Vol. 218, Springer-Verlag, New York, 1986, pp. 523-534.
Open DOI Search in Google Scholar