Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,794,401 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
MD5: Anonymous Location-Aided Routing inSuspicious Secure MANETs
Jennie Bharathi.R
2014
Corpus ID: 64935266
Mobile Ad Hoc Networks use anonymous routing protocols to hide node identities and routes from outside observers in order to…
Expand
2013
2013
An Efficient Association Rule Mining Using the H-BIT Array Hashing Algorithm
R. Paper
,
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
A Mail Transfer System Selectively Restricting a Huge Amount of E-Mails
Y. Tsuzaki
,
Ryosuke Matsumoto
,
Daisuke Kotani
,
S. Miyazaki
,
Y. Okabe
International Conference on Signal-Image…
2013
Corpus ID: 25347236
With the wide use of e-mail, it has become commonly expected that e-mails sent are delivered to recipients immediately. It is not…
Expand
2013
2013
Improving Key Management Scheme Supporting Node Mobility in Heterogeneous Sensor Networks using Collision-Keys
Vijay Kumar
,
Priyanka Ahlawat
2013
Corpus ID: 7335028
Wireless Sensor Networks (WSNs) consist of a large number of sensor nodes that are batteries powered, equipped with limited…
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
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
2009
2009
Extending Pastry by an Alphanumerical Overlay
Dominic Battré
,
A. Höing
,
Martin Raack
,
Ulf Rerrer-Brusch
,
Odej Kao
9th IEEE/ACM International Symposium on Cluster…
2009
Corpus ID: 14565400
Many load balancing strategies have been proposed for distributed hash tables, like Pastry. These strategies assume that hash…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE