Collision attack against Tav-128 hash function

Hariyanto, Fajar; Susanti, Bety Hayat

doi:10.1088/1742-6596/893/1/012047

Cited by 3 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A good hash function must meet three properties, namely preimage resistance, second-order preimage, and collision resistance. The collision resistance means it is difficult to compute get two different inputs that have the same hash value [11].…”

Section: Hash Functionmentioning

confidence: 99%

Performance Analysis of Hashing Methods on the Employment of App

Yudhana¹,

Fadlil²,

Prianto³

2018

IJECE

View full text Add to dashboard Cite

The administrative process carried out continuously produces large data. So the search process takes a long time. The search process by hashing methods can save time faster. Hashing is methods that directly access data in a table by making references to the key that hashing becomes the address in the table. The performance analysis of the hashing method is done by the number of 18 digit character values. The process of analysis is done on applications that have been implemented in the application. The algorithm of hashing method analyzed is progressive overflow (PO) and linear quotient (LQ). The main purpose of performance analysis of hashing method is to know how gig the performance of each method. The results analyzed showed the average value of collision with 15 keys in the analysis of 53.3% yield the same value, while 46.7% showed the linear quotient has better performance.

show abstract

Section: Hash Functionmentioning

confidence: 99%