The relations between preimage awareness and some other cryptographic properties of hash functions

Authors

  • Nguyễn Tuấn Anh
  • Triệu Quang Phong

DOI:

https://doi.org/10.54654/isj.v1i13.128

Keywords:

Pseudo-random oracle, preimage awareness, weak preimage awareness, bounded preimage awareness

Tóm tắt

AbstractRandomness tests related to overlapping template matching have been proposed in NIST SP 800-22 [1], however the probabilities in these tests are only valid for specific samples and should be recalculated for other samples. In [2], the authors proposed new template matching tests for all 4-bit templates. The new tests can be applied to any sequence of minimum length of 5504 bits whereas the overlapping template matching test in the NIST test suite can only be applied to sequences of minimum length of 106 bits. In this paper, we have modified and proposed new 4-bit template matching tests that can be applied to any sequence of minimum length 3726 bits. Furthermore, we proposed three new 5-bit template matching tests. Our theoretical and practical results show that our new proposed tests are very efficient in psedorandom number generator testing.

Downloads

Download data is not yet available.

Author Biographies

Nguyễn Tuấn Anh

 

Triệu Quang Phong

 

References

Dodis, Y., T. Ristenpart, and T. Shrimpton. Salvaging Merkle-Damgård for practical applications. in Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2009. Springer.

Maurer, U., R. Renner, and C. Holenstein. Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. in Theory of cryptography conference. 2004. Springer.

Coron, J.-S., et al. Merkle-Damgård revisited: How to construct a hash function. in Annual International Cryptology Conference. 2005. Springer.

Buldas, A. and R. Laanoja. Security proofs for hash tree time-stamping using hash functions with small output size. in Australasian Conference on Information Security and Privacy. 2013. Springer.

Buldas, A., et al. Bounded pre-image awareness and the security of hash-tree keyless signatures. in International Conference on Provable Security. 2014. Springer.

Buldas, A., R. Laanoja, and A. Truu, Security Proofs for the BLT Signature Scheme. IACR Cryptol. ePrint Arch., 2014. 2014: p. 696.

Guido, B., et al., Cryptographic sponge functions. 2011.

Седов, Г.К., Стойкость ГОСТ Р 34.11-2012 к атаке поиска прообраза и к атаке поиска коллизий. Математические вопросы криптографии, 2015. 6(2): p. 79-98.

Downloads

Abstract views: 97 / PDF downloads: 46

Published

2022-01-12 — Updated on 2022-01-12

How to Cite

Anh, N. T., & Phong, T. Q. (2022). The relations between preimage awareness and some other cryptographic properties of hash functions. Journal of Science and Technology on Information Security, 1(13), 12-20. https://doi.org/10.54654/isj.v1i13.128

Issue

Section

Papers