Pages that link to "Item:Q2277428"
From MaRDI portal
The following pages link to On the Chor-Rivest knapsack cryptosystem (Q2277428):
Displaying 13 items.
- On algorithms to find \(p\)-ordering (Q831740) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708) (← links)
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices (Q1999896) (← links)
- On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials (Q2031633) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Factorization of composed polynomials and applications (Q2329189) (← links)
- Factorization of a class of composed polynomials (Q2420476) (← links)
- Balanced Integer Solutions of Linear Equations (Q2926145) (← links)
- (Q3187779) (← links)
- (Q3752293) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- Equal-degree factorization of binomials and trinomials over finite fields (Q6584731) (← links)
