Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
From MaRDI portal
Publication:1784985
DOI10.3934/amc.2018026zbMath1401.94150OpenAlexW2887430501MaRDI QIDQ1784985
Konstantinos A. Draziotis, Anastasia Papadopoulou
Publication date: 27 September 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2018026
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptanalysis of a knapsack-based probabilistic encryption scheme
- Factoring polynomials with rational coefficients
- Efficient signature generation by smart cards
- Improved low-density subset sum algorithms
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- A knapsack-based probabilistic encryption scheme
- Improved cryptanalysis of a knapsack-based probabilistic encryption scheme
- Efficient cryptographic schemes provably as secure as subset sum
- Mathematics of Public Key Cryptography
- Balanced Integer Solutions of Linear Equations
- Quantum Communication Attacks on Classical Cryptographic Protocols
- Improved Generic Algorithms for Hard Knapsacks
- New Generic Algorithms for Hard Knapsacks
- Lattice Enumeration Using Extreme Pruning
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Lattice-based Cryptography
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
- Solving low-density subset sum problems
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- The LLL Algorithm and Integer Programming
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Predicting Lattice Reduction
This page was built for publication: Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
