I would only embed Z/pZ (p a prime) in a larger finite field, Z/nZ tends to have zero divisors which somewhat bother me. I don't know anything about this topic, but Part III (Polynomial Systems and Satisfiability) of Bard's Algebraic Cryptanalysis may be useful.
Lazyweb: is it a common technique in algebraic cryptanalysis to embed the base ring for a polynomial system into a larger ring (e.g. Z2 into Z4) and study the larger system? (Wondering if I did something original or if there's something I should cite)
-
-
-
Thanks. I didn't see anything suitable in Bard, sadly. (The zero divisors are a feature, not a bug!)
Kraj razgovora
Novi razgovor -
-
-
Maybe
@enricflorit can help.Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.