Pages that link to "Item:Q3816016"

The following pages link to A knapsack-type public key cryptosystem based on arithmetic in finite fields (Q3816016):

Displaying 27 items.

• Factors of low individual degree polynomials (Q301529) (← links)
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
• A short proof for explicit formulas for discrete logarithms in finite fields (Q802668) (← links)
• Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment (Q857394) (← links)
• Quadratic compact knapsack public-key cryptosystem (Q980333) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• Improved low-density subset sum algorithms (Q1207335) (← links)
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
• Preimage selective trapdoor function: how to repair an easy problem (Q1718474) (← links)
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics. (Q1867478) (← links)
• Irreducible compositions of polynomials over finite fields of even characteristic (Q1928790) (← links)
• Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices (Q1999896) (← links)
• The multiple multidimensional knapsack with family-split penalties (Q2029273) (← 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)
• On the Chor-Rivest knapsack cryptosystem (Q2277428) (← links)
• Low-density attack revisited (Q2384011) (← links)
• A knapsack-based probabilistic encryption scheme (Q2384519) (← links)
• Safer parameters for the Chor-Rivest cryptosystem (Q2389473) (← links)
• Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
• High generalization performance structured self-attention model for knapsack problem (Q5025155) (← links)
• (Q5239581) (← links)
• Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy (Q5298457) (← links)
• An efficient multi-round anonymous auction protocol (Q5446259) (← links)
• Factoring polynomials over finite fields: A survey (Q5928877) (← links)
• Non-injective knapsack public-key cryptosystems (Q5941079) (← links)
• Characterization of irreducible polynomials over a special principal ideal ring (Q6178036) (← links)