Cryptanalysis of the Randomized Version of a Lattice-Based Signature Scheme from PKC’08-Reference-Cited by-同舟云学术

Cryptanalysis of the Randomized Version of a Lattice-Based Signature Scheme from PKC’08

Published:2018 Issue: Volume: Page:455-466
ISSN:0302-9743
Container-title:Information Security and Privacy
language:
Short-container-title:

Author:

Li Haoyu,Liu Renzhang,Nitaj Abderrahmane,Pan Yanbin

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-93638-3_26

Reference23 articles.

1. Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 10–19. ACM, New York (1998). https://doi.org/10.1145/276698.276705

2. Babai, L.: On Lovász’ lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1–13 (1986). https://doi.org/10.1007/BF02579403

3. Boas, P.V.E.: Another NP-complete problem and the complexity of computing short vectors in lattices. Mathematics Department Report 81–04. University of Amsterdam (1981)

4. Lecture Notes in Computer Science;Y Chen,2011

5. Lecture Notes in Computer Science;L Ducas,2013

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

1. YOLO-Fall: A Novel Convolutional Neural Network Model for Fall Detection in Open Spaces;IEEE Access;2024

2. Learning Strikes Again: The Case of the DRS Signature Scheme;Journal of Cryptology;2020-11-25

3. Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices;Information Sciences;2020-10

4. A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution †;Information;2020-02-27

5. Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise;Information Security and Privacy;2019