knapsack problem solution based on knapsack packing tree search
Clicks: 173
ID: 154443
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
173 views
35 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #55 of 103 articles by views in European journal of pharmacology
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
A number of asymmetric cryptosystems (including one of the very first asymmetric cryptosystems – the Merkle–Hellman cryptosystem) are based on the knapsack problem. Many of these cryptosystems are proven either insecure or inapplicable due to extensive amounts of computation necessary. Never the less, presently the knapsack problem is considered to be of importance for cryptography. In this article, the knapsack problem solution algorithm based on knapsack packing tree search is described for the first time.
| Reference Key |
kupriyashin2014bezopasnostknapsack
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Mikhail Andreevich Kupriyashin;Georgii Ivanovich Borzunov |
| Journal | European journal of pharmacology |
| Year | 2014 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.