Pages that link to "Item:Q5864294"
From MaRDI portal
The following pages link to Hiding information and signatures in trapdoor knapsacks (Q5864294):
Displaying 50 items.
- A semantically secure public key cryptoscheme using bit-pair shadows (Q344780) (← links)
- A provably secure non-iterative hash function resisting birthday attack (Q344781) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Cryptanalysis of a quadratic knapsack cryptosystem (Q552295) (← links)
- Embedding cryptographic trapdoors in arbitrary knapsack systems (Q595612) (← links)
- Anonymous message communications with user hierarchy in a multicast system (Q702584) (← links)
- Cryptanalysis of a knapsack-based probabilistic encryption scheme (Q730959) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- Integer programming and cryptography (Q799477) (← links)
- A deterministic algorithm for modular knapsack problems (Q809609) (← links)
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment (Q857394) (← links)
- Studying the performance of artificial neural networks on problems related to cryptography (Q867941) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- An efficient probabilistic encryption scheme (Q912074) (← links)
- Sums of lexicographically ordered sets (Q912760) (← links)
- Quadratic compact knapsack public-key cryptosystem (Q980333) (← links)
- Heuristics and exact methods for number partitioning (Q1038378) (← links)
- Trapdoor knapsacks without superincreasing structure (Q1066113) (← links)
- A nonlinear public key cryptosystem (Q1102923) (← links)
- Partial information in public key cryptography (Q1105565) (← links)
- The iterated mod problem (Q1119390) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- A cryptosystem for multiple communication (Q1145121) (← links)
- Uniform complexity and digital signatures (Q1154262) (← links)
- A dynamic access control scheme based upon the knapsack problem (Q1324377) (← links)
- Preimage selective trapdoor function: how to repair an easy problem (Q1718474) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem (Q2125915) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- Low-density attack revisited (Q2384011) (← links)
- A knapsack-based probabilistic encryption scheme (Q2384519) (← links)
- Solving low-density multiple subset sum problems with SVP oracle (Q2416533) (← links)
- Balanced Integer Solutions of Linear Equations (Q2926145) (← links)
- A New Non-Merkle-Damgård Structural Hash Function with Provable Security (Q3196424) (← links)
- A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security (Q3196425) (← links)
- New Definition of Density on Knapsack Cryptosystems (Q3506377) (← links)
- Local Testing of Lattices (Q4565131) (← links)
- Knapsack Public Key Cryptosystems and Diophantine Approximation (Q5019314) (← links)
- Solving Low Density Knapsacks (Q5019315) (← links)
- Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems (Q5019316) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- A Modified Technique for Reliable Image Encryption Method using Merkle-Hellman Cryptosystem and Rsa Algorithm (Q5069678) (← links)
- Constructing ID-based cryptographic technique for IFP and GDLP based cryptosystem (Q5069964) (← links)
- (Q5075820) (← links)
- A Coverless Image Information Hiding Algorithm Based on Fractal Theory (Q5107092) (← links)
- ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM (Q5150749) (← links)
