Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The security and efficiency are essential primary points for Wireless Sensor Networks (WSNs) when designing routing strategy… 
2013
2013
Nowadays, Wireless Sensor Networks (WSN's) has become progressively more attractive and has found its way into a wide variety of… 
2010
2010
This thesis presents a novel mechanism for achieving secure and reliable peer-to-peer communications on the Internet. WhanauSIP… 
2009
2009
In this paper, we present efficient geometric algorithms for the discrete constrained 1-D K-means clustering problem and extend… 
2007
2007
In this paper, we present efficient geometric algorithms for the discrete constrained 1-D K-means clustering problem and extend… 
2007
2007
The traditional K-means algorithm is a widely used clustering algorithm, with a wide range of applications. This paper introduces… 
2007
2007
An efficient search technique has become a crucial research problem in P2P system.Key clustering algorithm divides routing space… 
2004
2004
Peer-to-Peer systems have shown a great potential on file sharing in recent years, and developing efficient search techniques has… 
1994
1994
In this paper we examinethe key clustering characteristics of a classof block cryptosystemsreferred to as substitution…