Skip to search formSkip to main contentSkip to account menu

Superincreasing sequence

Known as: Super increasing sequence, Super-increasing sequence 
In mathematics, a sequence of positive real numbers is called superincreasing if every element of the sequence is greater than the sum of all… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations

Broader (1)

Cryptography
Merkle–Hellman knapsack cryptosystemPython

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
An Efficient and Privacy-Preserving Disease Risk Prediction Scheme for E-Healthcare
Big data mining-driven disease risk prediction has become one of the important topics in the field of e-healthcare. However… 
2019
2019
RAMD: registry-based anomaly malware detection using one-class ensemble classifiers
Malware is continuously evolving and becoming more sophisticated to avoid detection. Traditionally, the Windows operating system… 
2014
2014
Power Distribution in Randomized Weighted Voting: the Effects of the Quota
We study the Shapley value in weighted voting games. The Shapley value has been used as an index for measuring the power of… 
2013
2013
Four Way Encryption Method for Secure Message Coding by use of CBC, Merkle-Hellman, Randomizers and Discrete Logarithmics
The Cipher Block Chaining (CBC) and the Merkle-Hellman algorithm are two different cryptosystems for encrypting messages. But… 
2013
2013
Improvement of CBC encryption technique by using the Merkle-Hellman Knapsack Cryptosystem
The Cipher Block Chaining (CBC) is one of the operational modes of the Block Ciphers which takes n-blocks of plain text and… 
2013
2013
Cryptanalysis and Improvement of Akleylek et al.'s cryptosystem
Akleylek et al. [S. Akleylek, L. Emmungil and U. Nuriyev, A mod ified algorithm for peer-to-peer security, journal of Appl… 
2011
2011
Research on encryption algorithm of non super-increasing sequence knapsack
In order to improve knapsack's security,through analyzing the super-increasing sequence and pointing out the problems of using… 
2010
2010
A PROPOSED SECURITY EVALUATOR FOR KNAPSACK PUBLIC KEY CRYPTOSYSTEMS BASED ON ANN
Sometimes the users of any security system need to evaluate the security (complexity) of the system under consideration. For that… 
1989
1989
A more efficient public-key cryptosystem using the Pascal triangle
The authors propose a public-key cryptosystem that uses a knapsack model based on the structure of a Pascal triangle or a super… 
1983
1983
The largest super-increasing subset of a random set
It is shown that the longest super-increasing sequence which can be constructed from a set of n independent uniformly distributed… 
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)