A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)-Reference-Cited by-同舟云学术

A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)

Published: Issue: Volume: Page:54-65
ISSN:
Container-title:Advances in Cryptology
language:
Short-container-title:

Author:

Chor Benny,Rivest Ronald L.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-39568-7_6.pdf

Reference19 articles.

1. Bose, R.C. and S. Chowla, “Theorems in the additive theory of numbers”, Comment. Math. Helvet., vol. 37, pp. 141–147, 1962.

2. Brickell, E.F., “A new knapsack based cryptosystem”, Presented in Crypto83.

3. Brickell, E.F., “Are most low density knapsacks solvable in polynomial time?”, Proceedings of the Fourteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, 1983.

4. Brillhart, J., D.H. Lehmer, J.L. Selfridge, B. Tuckerman and S.S. Wagstaff, Jr., Factorization of b n ± 1, in Contemporary Mathematics, vol. 22, AMS, Providence, 1983.

5. Coppersmith, D., “Fast Evaluation of Logarithms in Fields of Characteristic Two”, to appear, IEEE Trans. Inform. Theory; extended abstract in Proceedings of the Sixteenth Annual Symposium on Theory of Computing, ACM, pp. 201–207, 1984.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Knapsack Cryptographic Schemes;Encyclopedia of Cryptography, Security and Privacy;2024

2. Low Weight Discrete Logarithm and Subset Sum in $$2^{0.65n}$$ with Polynomial Memory;Advances in Cryptology – EUROCRYPT 2020;2020

3. Provable Security for Public Key Cryptosystems;Cryptography;2020

4. Deterministic lattice reduction on knapsacks with collision‐free properties;IET Information Security;2018-07

5. Provable Security for Public Key Cryptosystems;Handbook of Research on Modern Cryptographic Solutions for Computer and Cyber Security;2016