A knapsack-type public key cryptosystem based on arithmetic in finite fields
- 1 September 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (5), 901-909
- https://doi.org/10.1109/18.21214
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Solving low-density subset sum problemsJournal of the ACM, 1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- SequencesPublished by Springer Nature ,1983
- Improved algorithms for integer programming and related lattice problemsPublished by Association for Computing Machinery (ACM) ,1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete ProblemsSIAM Journal on Computing, 1981
- A modification of the RSA public-key encryption procedure (Corresp.)IEEE Transactions on Information Theory, 1980
- Analysis of a simple factorization algorithmTheoretical Computer Science, 1976
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Enumerative source encodingIEEE Transactions on Information Theory, 1973