Article

Article title TIME-MEMORY TRADE-OFF ON RECONFIGURABLE COMPUTER SYSTEMS
Authors A.V. Kolodzey
Section SECTION I. PRINCIPLES OF CONSTRUCTION, ARCHITECTURE AND HARDWARE BASE SUPERCOMPUTERS
Month, Year 12, 2014 @en
Index UDC 004.272.43
DOI
Abstract Now is the urgent task of creating a problem-oriented computing system (POCS) that is intended to solve specific classes of problems. One such class of problems is the reversing cryptographic hash functions by using preliminary calculations. The article solves the problem of achieving a balance between computational performance and throughput of the memory system when using the so-called rainbow tables. Provides assessment solution time and the required amount of memory depending on the complexity and configuration of the computing system. One of their main technique parameters rainbow chains is chain length L. The estimates obtained allow us to choose the optimal value of L depending on the current configuration of the computing system. Growth of complexity of the solved tasks can demand modernization of POVS. It appears if modernization it is planned to conduct in a "extensive" way when the relative growth of number of computing units (CU) advances the relative growth of productivity of separate CU, with a growth of the general intensity of inquiries to memory, their specific intensity decreases. At "intensive" development of POVS when the relative growth of productivity of separate CU advances the relative growth of number of CU, also requirements to the specific productivity of system of memory grow.

Download PDF

Keywords Problem-oriented computing; Time-Memory Trade-Off; Rainbow Tables; IOPS.
References 1. Kalyaev I.A., Levin I.I., Semernikov E.A., Shmoylov V.I. Rekonfiguriruemye mul'ti-konveyernye vychislitel'nye struktury [Reconfigurable multiconference computational patterns]. Rostov-on-Don: Izd-vo YuNTs RAN, 2008, 320 p.
2. Hellman M.E. A cryptanalytic time-memory trade-off, IEEE Transactions on Information Theory, 1980, No. 26(4), pp. 401-406.
3. Philippe Oechslin. Making a Faster Cryptoanalytic Time-Memory Trade-Off. In Dan Boneh, editor, Advanced in Cryptology – CRYPTO’03, vol. 2729 of Lecture Notes in Computer Science, Santa Barbara, California, USA, August 2003. IACR, Springer-Verlag, pp. 617-630.
4. Gildas Avoine, Pascal Junod, Philippe Oechslin: Characterization and Improvement of Time-Memory Trade-Off Based on Perfect Tables. ACM Trans. Inf. Syst. Secur., 2008, No. 11 (4).
5. Jung Woo Kim, Jin Hong, Kunsoo Park. Analysis of the Rainbow Tradeoff Algorithm Used in Practice – JACR Cryptology ePrint Archive, 2013. Available at: http://eprint.iacr.org/2013/591.pdf (Accessed: 31 October 2014).
6. Hong J. The cost of false alarms in Hellman and rainbow tradeoffs, Des. Codes Cryptography, Dec. 2010, Vol. 57, pp. 293-327.
7. Hong J. and Moon S. A comparison of cryptanalytic tradeoff algorithms, J. Cryptology, 2013, Vol. 26, pp. 559-637.
8. Lee G.W., Hong J. A comparison of perfect table cryptanalytic tradeoff algorithms, Cryptology ePrint Archive, Report 2012/540. Available at: http://eprint.iacr.org/2012/540 (Accessed: 31 October 2014).
9. Как правильно мерять производительность диска. Available at: www.habrahabr.ru/post/ 154235/ (Accessed: 31 October 2014).
10. Project fio. Available at: http://freecode.com/projects/fio (Accessed: 31 October 2014).

Comments are closed.