Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
108 | Thuy Duong Vu, Chris R. Jesshope |
Formalizing SANE Virtual Processor in Thread Algebra. |
ICFEM |
2007 |
DBLP DOI BibTeX RDF |
SANE Virtual Processor, microthreading, thread algebra |
90 | Tali Treibitz, Yoav Y. Schechner, Hanumant Singh |
Flat refractive geometry. |
CVPR |
2008 |
DBLP DOI BibTeX RDF |
|
90 | Oded Regev 0001 |
On lattices, learning with errors, random linear codes, and cryptography. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
cryptography, quantum computing, lattices, public key encryption, computational learning theory, statistical queries |
70 | Miklós Ajtai, Ravi Kumar 0001, D. Sivakumar 0001 |
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. |
CCC |
2002 |
DBLP DOI BibTeX RDF |
SVP, CVP, Lattice, shortest vector problem, closest vector problem |
69 | Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz |
A 2n/2-Time Algorithm for $\sqrt{n}$-SVP and $\sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. |
EUROCRYPT (1) |
2021 |
DBLP DOI BibTeX RDF |
|
69 | Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz |
A 2n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
54 | Subhash Khot |
Hardness of approximating the shortest vector problem in lattices. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms, cryptography, lattices, hardness of approximation, shortest vector problem |
54 | Subhash Khot |
Hardness of Approximating the Shortest Vector Problem in Lattices. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
48 | K. Koteswara Rao, G. SVP Raju, Srinivasan Nagaraj |
Optimizing the software testing efficiency by using a genetic algorithm: a design methodology. |
ACM SIGSOFT Softw. Eng. Notes |
2013 |
DBLP DOI BibTeX RDF |
|
48 | K. Koteswara Rao, G. SVP Raju |
Error correction in function point estimation using soft computing technique. |
ACAI |
2011 |
DBLP DOI BibTeX RDF |
|
46 | Benjamin Lange |
Neue Schranken für SVP-Approximation und SVP-Aufzählungsalgorithmen. |
|
2013 |
RDF |
|
46 | Gengran Hu, Yanbin Pan |
A New Reduction from Search SVP to Optimization SVP |
CoRR |
2012 |
DBLP BibTeX RDF |
|
41 | Chris R. Jesshope, Jean-Marc Philippe, Michiel W. van Tol |
An Architecture and Protocol for the Management of Resources in Ubiquitous and Heterogeneous Systems Based on the SVP Model of Concurrency. |
SAMOS |
2008 |
DBLP DOI BibTeX RDF |
concurrency models, resource management, heterogeneous systems, ubiquitous systems, market models |
41 | Bernardo Cunha, José Luís Azevedo, Nuno Lau, Luís Almeida 0001 |
Obtaining the Inverse Distance Map from a Non-SVP Hyperbolic Catadioptric Robotic Vision System. |
RoboCup |
2007 |
DBLP DOI BibTeX RDF |
visualization, robot vision, Omnidirectional vision |
41 | Mark Fiala, Anup Basu |
Panoramic Stereo Reconstruction Using Non-SVP Optics. |
ICPR (4) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Johannes Buchmann 0001, Richard Lindner, Markus Rückert |
Explicit Hard Instances of the Shortest Vector Problem. |
PQCrypto |
2008 |
DBLP DOI BibTeX RDF |
challenge, Lattice reduction, lattice-based cryptography |
36 | Chris R. Jesshope |
Building a Concurrency and Resource Allocation Model into a Processor's ISA. |
Euro-Par Workshops |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Ishay Haviv, Oded Regev 0001 |
Tensor-based hardness of the shortest vector problem to within almost polynomial factors. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
lattices, hardness of approximation, tensor product |
36 | Guillaume Hanrot, Damien Stehlé |
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. |
CRYPTO |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Shih-Schön Lin, Ruzena Bajcsy |
Single-View-Point Omnidirectional Catadioptric Cone Mirror Imager. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2006 |
DBLP DOI BibTeX RDF |
image quality analysis, optical analysis, panoramic imaging, imaging geometry, Catadioptric camera, omnidirectional imaging |
36 | Adam R. Klivans, Alexander A. Sherstov |
Cryptographic Hardness for Learning Intersections of Halfspaces. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Xiao-Feng Li, Chen Yang, Zhao-Hui Du, Tin-Fook Ngai |
Exploiting Thread-Level Speculative Parallelism with Software Value Prediction. |
Asia-Pacific Computer Systems Architecture Conference |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Daniele Micciancio, Salil P. Vadhan |
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. |
CRYPTO |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Oded Regev 0001 |
Quantum Computation and Lattice Problems. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
36 | DongGook Park, Colin Boyd, Ed Dawson |
Micropayments for Wireless Communications. |
ICISC |
2000 |
DBLP DOI BibTeX RDF |
|
36 | Jin-yi Cai, Thomas W. Cusick |
A Lattice-Based Public-Key Cryptosystem. |
Selected Areas in Cryptography |
1998 |
DBLP DOI BibTeX RDF |
cryptographic security, lattice, Public-key cryptosystem |
34 | Xavier Pujol, Damien Stehlé |
Rigorous and Efficient Short Lattice Vectors Enumeration. |
ASIACRYPT |
2008 |
DBLP DOI BibTeX RDF |
SVP, lattice cryptanalysis, Lattices, numerical stability |
23 | Palash Sarkar 0001, Subhadip Singha |
Classical reduction of gap SVP to LWE: A concrete security analysis. |
Adv. Math. Commun. |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Zhongyang Yuan, Jianhu Zhao, Tie Li |
SVP Inversion for Weakening Multibeam Bathymetry Errors by Constraint of Check Line Depth. |
IEEE Trans. Geosci. Remote. Sens. |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Johanna Loyer, André Chailloux |
Classical and quantum 3 and 4-sieves to solve SVP with low memory. |
IACR Cryptol. ePrint Arch. |
2023 |
DBLP BibTeX RDF |
|
23 | Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé, Benjamin Wesolowski |
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals. |
IACR Cryptol. ePrint Arch. |
2023 |
DBLP BibTeX RDF |
|
23 | André Chailloux, Johanna Loyer |
Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory. |
PQCrypto |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé, Benjamin Wesolowski |
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals. |
TCC (4) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Errui He, Tianyu Xu, Mengsi Wu, Jiageng Chen, Shixiong Yao, Pei Li |
A Survey of Algorithms for Addressing the Shortest Vector Problem (SVP). |
BlockTEA |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Rundong Zuo, Guozhong Li, Byron Choi, Sourav S. Bhowmick, Daphne Ngar-yin Mah, Grace Lai-Hung Wong |
SVP-T: A Shape-Level Variable-Position Transformer for Multivariate Time Series Classification. |
AAAI |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Leizhang Wang, Yuntao Wang 0002, Baocang Wang |
A Trade-off SVP-solving Strategy based on a Sharper pnj-BKZ Simulator. |
AsiaCCS |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Kaixuan Wang, Xinyu Qin, Zhuoyuan Yang, Weiliang He, Yifan Liu 0017, Jun Han 0003 |
SVP: Safe and Efficient Speculative Execution Mechanism through Value Prediction. |
ACM Great Lakes Symposium on VLSI |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Masaharu Fukase, Masahiro Kaminaga |
Improving genetic algorithms for solving the SVP: focusing on low memory consumption and high reproducibility. |
Iran J. Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Qianqian Xu, Zhiyong Yang 0001, Yangbangyan Jiang, Xiaochun Cao, Yuan Yao 0011, Qingming Huang |
Not All Samples are Trustworthy: Towards Deep Robust SVP Prediction. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé |
On Module Unique-SVP and NTRU. |
IACR Cryptol. ePrint Arch. |
2022 |
DBLP BibTeX RDF |
|
23 | Katharina Boudgoust, Erell Gachon, Alice Pellet-Mary |
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. |
IACR Cryptol. ePrint Arch. |
2022 |
DBLP BibTeX RDF |
|
23 | Zhenfei Zhang |
An SVP attack on Vortex. |
IACR Cryptol. ePrint Arch. |
2022 |
DBLP BibTeX RDF |
|
23 | Pierre-Marie Poulain, Luca Centurioni, Tamay M. Özgökmen |
Comparing the Currents Measured by CARTHE, CODE and SVP Drifters as a Function of Wind and Wave Conditions in the Southwestern Mediterranean Sea. |
Sensors |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Huck Bennett, Chris Peikert, Yi Tang |
Improved Hardness of BDD and SVP Under Gap-(S)ETH. |
ITCS |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé |
On Module Unique-SVP and NTRU. |
ASIACRYPT (3) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Olivier Bernard 0002, Andrea Lesavourey, Tuong-Huy Nguyen, Adeline Roux-Langlois |
Log-S-unit Lattices Using Explicit Stickelberger Generators to Solve Approx Ideal-SVP. |
ASIACRYPT (3) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Seyed Saber Mohammadi, Yiming Wang 0002, Matteo Taiana, Pietro Morerio, Alessio Del Bue |
SVP-Classifier: Single-View Point Cloud Data Classifier with Multi-view Hallucination. |
ICIAP (2) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Katharina Boudgoust, Erell Gachon, Alice Pellet-Mary |
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. |
CRYPTO (2) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Shintaro Narisada, Hiroki Okada 0001, Kazuhide Fukushima, Shinsaku Kiyomoto |
Faster Rotation-Based Gauss Sieve for Solving the SVP on General Ideal Lattices. |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Divesh Aggarwal, Yanlin Chen, Rajendra Kumar 0002, Zeyong Li, Noah Stephens-Davidowitz |
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
23 | Christian Porter, Andrew Mendelsohn, Cong Ling 0001 |
Subfield Algorithms for Ideal- and Module-SVP Based on the Decomposition Group. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
23 | Noveen Sachdeva, Carole-Jean Wu, Julian J. McAuley |
SVP-CF: Selection via Proxy for Collaborative Filtering Data. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
23 | Huck Bennett, Chris Peikert, Yi Tang |
Improved Hardness of BDD and SVP Under Gap-(S)ETH. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
23 | |
Fast Factoring Integers by SVP Algorithms. |
IACR Cryptol. ePrint Arch. |
2021 |
DBLP BibTeX RDF |
|
23 | Olivier Bernard 0002, Andrea Lesavourey, Tuong-Huy Nguyen, Adeline Roux-Langlois |
Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP. |
IACR Cryptol. ePrint Arch. |
2021 |
DBLP BibTeX RDF |
|
23 | Claus-Peter Schnorr |
Fast Factoring Integers by SVP Algorithms, corrected. |
IACR Cryptol. ePrint Arch. |
2021 |
DBLP BibTeX RDF |
|
23 | Christian Porter, Andrew Mendelsohn, Cong Ling 0001 |
Subfield Algorithms for Ideal- and Module-SVP Based on the Decomposition Group. |
IACR Cryptol. ePrint Arch. |
2021 |
DBLP BibTeX RDF |
|
23 | Divesh Aggarwal, Yanlin Chen, Rajendra Kumar 0002, Zeyong Li, Noah Stephens-Davidowitz |
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Eamonn W. Postlethwaite, Fernando Virdia |
On the Success Probability of Solving Unique SVP via BKZ. |
Public Key Cryptography (1) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Xiaolan Jiang, Si-Ahmed Naas, Yi-Han Chiang, Stephan Sigg, Yusheng Ji |
SVP: Sinusoidal Viewport Prediction for 360-Degree Video Streaming. |
IEEE Access |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Eamonn W. Postlethwaite, Fernando Virdia |
On the Success Probability of Solving Unique SVP via BKZ. |
IACR Cryptol. ePrint Arch. |
2020 |
DBLP BibTeX RDF |
|
23 | Palash Sarkar 0001, Subhadip Singha |
Classical Reduction of SVP to LWE: A Concrete Security Analysis. |
IACR Cryptol. ePrint Arch. |
2020 |
DBLP BibTeX RDF |
|
23 | Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger |
Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP. |
IACR Cryptol. ePrint Arch. |
2020 |
DBLP BibTeX RDF |
|
23 | Olivier Bernard 0002, Adeline Roux-Langlois |
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices. |
IACR Cryptol. ePrint Arch. |
2020 |
DBLP BibTeX RDF |
|
23 | Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski |
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. |
IACR Cryptol. ePrint Arch. |
2020 |
DBLP BibTeX RDF |
|
23 | Olivier Bernard 0002, Adeline Roux-Langlois |
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices. |
ASIACRYPT (2) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger |
Sieve, Enumerate, Slice, and Lift: - Hybrid Lattice Algorithms for SVP via CVPP. |
AFRICACRYPT |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz |
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. |
CRYPTO (2) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski |
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. |
CRYPTO (2) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Gabriel Falcão 0001, Filipe Cabeleira, Artur Mariano, Luís Paulo Santos |
Heterogeneous Implementation of a Voronoi Cell-Based SVP Solver. |
IEEE Access |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz |
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
23 | Divesh Aggarwal, Bogdan Ursu, Serge Vaudenay |
Faster Sieving Algorithm for Approximate SVP with Constant Approximation Factors. |
IACR Cryptol. ePrint Arch. |
2019 |
DBLP BibTeX RDF |
|
23 | Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé |
Approx-SVP in Ideal Lattices with Pre-processing. |
IACR Cryptol. ePrint Arch. |
2019 |
DBLP BibTeX RDF |
|
23 | Léo Ducas, Maxime Plançon, Benjamin Wesolowski |
On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm. |
IACR Cryptol. ePrint Arch. |
2019 |
DBLP BibTeX RDF |
|
23 | Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé |
Approx-SVP in Ideal Lattices with Pre-processing. |
EUROCRYPT (2) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Luan Luan, Chunxiang Gu, Yonghui Zheng |
An Enumeration-Like Vector Sampling Method for Solving Approximate SVP. |
ML4CS |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Léo Ducas, Maxime Plançon, Benjamin Wesolowski |
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm. |
CRYPTO (1) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Zhongxiang Zheng, Xiaoyun Wang 0001, Guangwu Xu, Yang Yu 0008 |
Orthogonalized lattice enumeration for solving SVP. |
Sci. China Inf. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Divesh Aggarwal, Priyanka Mukhopadhyay |
Faster algorithms for SVP and CVP in the ∞ norm. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
23 | Divesh Aggarwal, Noah Stephens-Davidowitz |
Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Divesh Aggarwal, Noah Stephens-Davidowitz |
(Gap/S)ETH hardness of SVP. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Divesh Aggarwal, Noah Stephens-Davidowitz |
(Gap/S)ETH Hardness of SVP. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
23 | Divesh Aggarwal, Noah Stephens-Davidowitz |
Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP). |
CoRR |
2017 |
DBLP BibTeX RDF |
|
23 | Artur Mariano, Thijs Laarhoven, Christian H. Bischof |
A Parallel Variant of LDSieve for the SVP on Lattices. |
PDP |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Ronald Cramer, Léo Ducas, Benjamin Wesolowski |
Short Stickelberger Class Relations and Application to Ideal-SVP. |
EUROCRYPT (1) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Yanbin Pan, Feng Zhang |
Solving low-density multiple subset sum problems with SVP oracle. |
J. Syst. Sci. Complex. |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Zhongxiang Zheng, Xiaoyun Wang 0001, Yang Yu |
Orthogonalized Lattice Enumeration for Solving SVP. |
IACR Cryptol. ePrint Arch. |
2016 |
DBLP BibTeX RDF |
|
23 | Artur Mariano, Thijs Laarhoven, Christian H. Bischof |
A Parallel Variant of LDSieve for the SVP on Lattices. |
IACR Cryptol. ePrint Arch. |
2016 |
DBLP BibTeX RDF |
|
23 | Ronald Cramer, Léo Ducas, Benjamin Wesolowski |
Short Stickelberger Class Relations and application to Ideal-SVP. |
IACR Cryptol. ePrint Arch. |
2016 |
DBLP BibTeX RDF |
|
23 | Fábio Correia, Artur Mariano, Alberto Proença, Christian H. Bischof, Erik Agrell |
Parallel Improved Schnorr-Euchner Enumeration SE++ for the CVP and SVP. |
PDP |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Noah Stephens-Davidowitz |
Discrete Gaussian Sampling Reduces to CVP and SVP. |
SODA |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Masaharu Fukase, Kenji Kashiwabara |
An Accelerated Algorithm for Solving SVP Based on Statistical Analysis. |
J. Inf. Process. |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Noah Stephens-Davidowitz |
Discrete Gaussian Sampling Reduces to CVP and SVP. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
23 | Artur Mariano, Thijs Laarhoven, Christian H. Bischof |
Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP. |
IACR Cryptol. ePrint Arch. |
2015 |
DBLP BibTeX RDF |
|
23 | Dan Ding, Guizhen Zhu, Xiaoyun Wang 0001 |
A Genetic Algorithm for Searching the Shortest Lattice Vector of SVP Challenge. |
GECCO |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Artur Mariano, Christian H. Bischof, Thijs Laarhoven |
Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP. |
ICPP |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Nobuyuki Kita |
Evaluation of 3D Analysis Error Caused by SVP Approximation of Fisheye Lens. |
VISAPP (3) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Dan Ding, Guizhen Zhu, Yang Yu, Zhongxiang Zheng |
A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors. |
IACR Cryptol. ePrint Arch. |
2014 |
DBLP BibTeX RDF |
|
23 | Dan Ding, Guizhen Zhu, Xiaoyun Wang 0001 |
A Genetic Algorithm for Searching Shortest Lattice Vector of SVP Challenge. |
IACR Cryptol. ePrint Arch. |
2014 |
DBLP BibTeX RDF |
|
23 | Gengran Hu, Yanbin Pan, Feng Zhang |
Solving Random Subset Sum Problem by lp-norm SVP Oracle. |
IACR Cryptol. ePrint Arch. |
2014 |
DBLP BibTeX RDF |
|