Polly Cracker, Revisited-Reference-Cited by-同舟云学术

Polly Cracker, Revisited

Published:2011 Issue: Volume: Page:179-196
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Albrecht Martin R.,Farshim Pooya,Faugère Jean-Charles,Perret Ludovic

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-25385-0_10

Reference30 articles.

1. Albrecht, M.R., Farshim, P., Faugère, J.-C., Perret, L.: Polly Cracker, revisited. Cryptology ePrint Archive, Report 2011/289 (2011)

2. Lecture Notes in Computer Science;B. Applebaum,2009

3. Lecture Notes in Computer Science;S. Arora,2011

4. Bard, G.V., Courtois, N.T., Jefferson, C.: Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via SAT-solvers. Cryptology ePrint Archive, Report 2007/024 (2007)

5. Barkee, B., Can, D.C., Ecks, J., Moriarty, T., Ree, R.F.: Why you cannot even hope to use Gröbner bases in public key cryptography: An open letter to a scientist who failed and a challenge to those who have not yet failed. J. of Symbolic Computations 18(6), 497–501 (1994)

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

1. Towards an efficient LWE‐based fully homomorphic encryption scheme;IET Information Security;2022-04-28

2. On the IND-CCA1 Security of FHE Schemes;Cryptography;2022-03-17

3. Tensor Based Multivariate Polynomial Modulo Multiplier for Cryptographic Applications;IEEE Transactions on Computers;2022

4. Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures;Applicable Algebra in Engineering, Communication and Computing;2020-04-17

5. Topology hiding routing based on learning with errors;Concurrency and Computation: Practice and Experience;2020-03-25