|
Laël Cellier on Sat, 18 Jan 2025 14:47:25 +0100
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|
Some questions on how to improve Berlekamp‑Rabin algorithm’s implementation
|
- To: pari-users@pari.math.u-bordeaux.fr
- Subject: Some questions on how to improve Berlekamp‑Rabin algorithm’s implementation
- From: Laël Cellier <lael.cellier@laposte.net>
- Date: Sat, 18 Jan 2025 14:47:18 +0100
- Delivery-date: Sat, 18 Jan 2025 14:47:25 +0100
- Disposition-notification-to: Laël Cellier <lael.cellier@laposte.net>
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/simple; d=laposte.net; s=lpn-wlmd; t=1737208042; bh=rAJqU5yMt8RlHSZc8tSsJbAwlJOs5wp+rJRCmnlJlNI=; h=Message-ID:Date:MIME-Version:From:Subject:To:Content-Language:Content-Type:Content-Transfer-Encoding; b=AqBPvYbyg70uT2jXIlg5w8kXDJHqeb6z9K7AqXb8IcM5F0sSNGnYYiaBq8+9DYIe1jeFZ6UE6wq3L9LzETDrLGoWgcD4hVYLPNyAurGJsmM/8iY/rrq4tpPKCd3wYDJIbcmmcWZv++LVGPJuT1Zp+v1H1ijrEiLCe8Sx098CA6nMyi1H0cu2iPs2IQiTX4+/5Bd88BQYCcldXPg5dFjFt+FXGLjNdsOc71yCKvVi2lzTwC6Z+hvIXJtvKZAkX0kMjQzrv1J/6bcD2g6gq0uy3pwdO4t2z/ATojHzx+DEX0ATWxx3Bs2Yp7eKsq7F/sXprWXWk8CAdubJ2YKKeP0HfQ==;
- User-agent: Thunderbird Daily
Bonjour,
the https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Rabin_algorithm is
an algorithm for computing square roots on prime numbers or prime powers.
It's description makes it mostly trivial to implement using Mod()
operations but I was wondering if it was possible to use more higher
level functions like factor() or even nfroots() ?
And at the end use polcoeff() ?
Though in reality I admit I don't understand how to perform some steps
by hand…
Cordialement,