Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,215,036 papers from all fields of science
Search
Sign In
Create Free Account
Collision (computer science)
Known as:
Collision (disambiguation)
, Hash collision
, Cryptographic hash collision
Expand
In computer science, a collision or clash is a situation that occurs when two distinct pieces of data have the same hash value, checksum, fingerprint…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Birthday attack
Checksum
Collision attack
Collision domain
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Rectangular hash table: Bloom filter and bitmap assisted hash table with high speed
Tong Yang
,
Binchao Yin
,
+4 authors
Xiaoming Li
IEEE International Conference on Big Data (Big…
2017
Corpus ID: 26099766
Hash table, a widely used data structure, can achieve an O(1) average lookup speed at the cost of large memory usage…
Expand
2017
2017
Implementation of an Efficient Approach for Duplicate Detection System
R. Deshpande
,
S. Bodkhe
2017
Corpus ID: 212471826
-- Duplicate detection is the process of identifying multiple representations of same real world entities. The proposed System…
Expand
Review
2015
Review
2015
A Survey: Novel Approach Secure Authentication Technique by One Time Password using Mobile SMS
Preeti Ahlawat
,
Rainu Nandal
2015
Corpus ID: 63994761
In this paper we consider the potential of SMS- one time password (OTP) in results upgradation to get rid of around kinds of…
Expand
2014
2014
Massive Strings Efficient Matching Method Research
Hong-L. Zhang
,
Pla Troops
2014
Corpus ID: 63120712
This paper presents a randomizing fingerprint-based Wu and Manber( WM) algorithm( RFP-WM),which can effectively reduce false…
Expand
2013
2013
An Efficient Association Rule Mining Using the H-BIT Array Hashing Algorithm
L. Padmavathy
,
V. Umarani
2013
Corpus ID: 212523465
: Association Rule Mining (ARM) finds the interesting relationship between presences of various items in a given database…
Expand
2013
2013
Clustering Web Documents based on Efficient Multi- Tire Hashing Algorithm for Mining Frequent Termsets
N. Negm
,
Passent El-Kafrawy
,
Mohamed Amin
,
A. Salem
2013
Corpus ID: 12611851
Document Clustering is one of the main themes in text mining. It refers to the process of grouping documents with similar…
Expand
2012
2012
A Hash based Mining Algorithm for Maximal Frequent Item Sets using Double Hashing
N. G. Rao
,
Sirisha Aguru
2012
Corpus ID: 15492620
Data mining is the use of automated data analysis techniques to uncover previously undetected relationships among data items. In…
Expand
2012
2012
Topology-Oriented Boolean Operations
Songgang Xu
,
J. Keyser
2012
Corpus ID: 15248436
This technical report discusses an efficient, topologyoriented method for Boolean operations on polyhedral manifolds. A new…
Expand
2010
2010
Relation between successfulness of birthday attack on digital signature and hash function irregularity
M. Tuba
,
Nadezda Stanarevic
2010
Corpus ID: 4981934
In many network communications it is crucial to be able to authenticate both the contents and the origin of a message. Digital…
Expand
2005
2005
A Note on the Practical Value of Single Hash Collisions for Special File Formats
Max Gebhardt
,
G. Illies
,
W. Schindler
2005
Corpus ID: 267884315
We investigate Merkle-Damgard hash functions and different file formats. Our goal is to construct many meaningful hash collisions…
Expand