Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 223,152,471 papers from all fields of science
Search
Sign In
Create Free Account
Key clustering
In cryptography, key clustering is said to occur when two different keys generate the same ciphertext from the same plaintext, using the same cipher…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Algorithm
Brute-force attack
Cipher
Ciphertext
Expand
Broader (1)
Key management
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
An Improved Secure Routing Protocol Based on Clustering for Wireless Sensor Networks
Lin Chen
,
Long Chen
2014
Corpus ID: 53783963
The security and efficiency are essential primary points for Wireless Sensor Networks (WSNs) when designing routing strategy…
Expand
2013
2013
Comparison of clustering routing protocols for Wireless Sensor Networks
Gulbadan Sikander
,
M. H. Zafar
,
M. I. Babar
,
M. Rashid
,
M. Zuhairi
IEEE International Conference on Smart…
2013
Corpus ID: 6467272
Nowadays, Wireless Sensor Networks (WSN's) has become progressively more attractive and has found its way into a wide variety of…
Expand
2010
2010
WhanauSIP: A Secure Peer-to-Peer Communications Platform
Raymond Cheng
2010
Corpus ID: 111193250
This thesis presents a novel mechanism for achieving secure and reliable peer-to-peer communications on the Internet. WhanauSIP…
Expand
Review
2010
Review
2010
Математичне та програмне забезпечення ієрархічної декомпозиції, індексування, класифікації та аналізу візуальних образів
Руслан Богданович Тушницький
2010
Corpus ID: 74964081
Mathematical and program tools for hierarchical decomposition, indexing, classification and analysis of visual patterns are…
Expand
2009
2009
Geometric Algorithms for the Constrained 1-d k-Means Clustering Problems and IMRT Applications
D. Chen
,
M. Healy
,
Chao Wang
,
Bin Xu
International Journal of Foundations of Computer…
2009
Corpus ID: 38544663
In this paper, we present efficient geometric algorithms for the discrete constrained 1-D K-means clustering problem and extend…
Expand
2007
2007
Geometric Algorithms for the Constrained 1-D K -Means Clustering Problems and IMRT Applications
D. Chen
,
M. Healy
,
Chao Wang
,
Bin Xu
Frontiers in Algorithmics
2007
Corpus ID: 38517161
In this paper, we present efficient geometric algorithms for the discrete constrained 1-D K-means clustering problem and extend…
Expand
2007
2007
An Improved K-Means Clustering Algorithm
Wen-yong Zhou
2007
Corpus ID: 17008425
The traditional K-means algorithm is a widely used clustering algorithm, with a wide range of applications. This paper introduces…
Expand
2007
2007
An Improved Key Clustering Searching Algorithm in P2P Network
G. Zhong
2007
Corpus ID: 58132625
An efficient search technique has become a crucial research problem in P2P system.Key clustering algorithm divides routing space…
Expand
2004
2004
Using Small-World to Devise Routing Algorithm for Unstructured Peer-to-Peer System
Zhou Jin
,
Lu Hai-Ming
,
Liao Yan-da
2004
Corpus ID: 62925233
Peer-to-Peer systems have shown a great potential on file sharing in recent years, and developing efficient search techniques has…
Expand
1994
1994
Key Clustering in Substitution-Permutation Network Cryptosystems †
Draft H M Heys
,
S. Tavares
1994
Corpus ID: 4573287
In this paper we examinethe key clustering characteristics of a classof block cryptosystemsreferred to as substitution…
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