The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Symmetric and Asymmetric Encryption
ACM Computing Surveys (CSUR)
Report of the public cryptography study group
Communications of the ACM
On the security of multiple encryption
Communications of the ACM
Timestamps in key distribution protocols
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Orderly enumeration of nonsingular binary matrices applied to text encryption
Communications of the ACM
Secure communications over insecure channels
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Cryptography and data security
Cryptography and data security
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the cryptocomplexity of knapsack systems
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Usually the unicity distance is used to give the strength of encryption algorithms. In this work, the behaviour of encipherment algorithm has been analyzed and two different parameters are proposed in order to evaluate the quality. These parameters are checked against the unicity distance and a final test has been executed, using DES.