Hiding information and signatures in trapdoor knapsacks
From MaRDI portal
(Redirected from Publication:5864294)
Recommendations
Cited in
(69)- Heuristics and exact methods for number partitioning
- Trapdoor knapsacks without superincreasing structure
- A nonlinear public key cryptosystem
- Partial information in public key cryptography
- The iterated mod problem
- Univariate polynomial factorization over finite fields
- A cryptosystem for multiple communication
- Uniform complexity and digital signatures
- A dynamic access control scheme based upon the knapsack problem
- Preimage selective trapdoor function: how to repair an easy problem
- Paillier's trapdoor function hides up to O(n) bits
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Scheduling lower bounds via AND subset sum
- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
- Succinct non-interactive arguments via linear interactive proofs
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Improved broadcast attacks against subset sum problems via lattice oracle
- Low-density attack revisited
- A knapsack-based probabilistic encryption scheme
- Solving low-density multiple subset sum problems with SVP oracle
- Balanced integer solutions of linear equations
- A new non-Merkle-Damgård structural hash function with provable security
- A public key cryptoscheme using bit-pairs with provable semantical security
- A semantically secure public key cryptoscheme using bit-pair shadows
- A provably secure non-iterative hash function resisting birthday attack
- New Definition of Density on Knapsack Cryptosystems
- A public key cryptosystem based on three new provable problems
- How to sign given any trapdoor permutation
- Local testing of lattices
- Knapsack public key cryptosystems and Diophantine approximation
- Solving low density knapsacks
- Evaluation of the Adleman attack on multiply iterated knapsack cryptosystems
- The Complexity of Public-Key Cryptography
- A Modified Technique for Reliable Image Encryption Method using Merkle-Hellman Cryptosystem and Rsa Algorithm
- Constructing ID-based cryptographic technique for IFP and GDLP based cryptosystem
- Equal-subset-sum faster than the meet-in-the-middle
- A coverless image information hiding algorithm based on fractal theory
- ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM
- Packing a knapsack of unknown capacity
- Knapsack problems in groups
- Cryptanalysis of a quadratic knapsack cryptosystem
- Non-injective knapsack public-key cryptosystems
- Embedding cryptographic trapdoors in arbitrary knapsack systems
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Algorithmic obstructions in the random number partitioning problem
- Commitments with efficient zero-knowledge arguments from subset sum problems
- An approach to the moments subset sum problem through systems of diagonal equations over finite fields
- Branch-and-bound and dynamic programming approaches for the knapsack problem
- No polynomial kernels for knapsack
- On the matching arrangement of a graph, improper weight function problem and its application
- Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications
- Self-masking for hardening inversions
- Anonymous message communications with user hierarchy in a multicast system
- Does subset sum admit short proofs?
- Knapsack problems with monotonically non-decreasing variable weights (profits) of items
- Cryptanalysis of a knapsack-based probabilistic encryption scheme
- A knapsack McEliece-based public key cryptosystem
- Diagonally dominant matrices for cryptography
- Computer algebra tales on Goppa codes and McEliece cryptography
- Integer programming and cryptography
- A deterministic algorithm for modular knapsack problems
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
- Studying the performance of artificial neural networks on problems related to cryptography
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- An efficient probabilistic encryption scheme
- Sums of lexicographically ordered sets
- Quadratic compact knapsack public-key cryptosystem
This page was built for publication: Hiding information and signatures in trapdoor knapsacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864294)
