排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Le Van Ly 《Applicable Algebra in Engineering, Communication and Computing》2006,17(3-4):267-283
Since Fellows and Koblitz introduced the generic combinatorially algebraic public-key cryptosystem Polly Cracker in 1993, the question whether there exist secure and efficient instances of Polly Cracker remains unsettled. Namely, many of these schemes succumb to the Linear-Algebra Attacks by D. Naccache et al. and Lenstra. In this paper I present a public-key cryptoscheme Polly Two that is efficient and in some way a modified Polly-Cracker instance, but comprises techniques defending the linear-algebra attacks. 相似文献
1