Wikipedia:Reference desk/Archives/Computing/2024 July 16
| Computing desk | ||
|---|---|---|
| < July 15 | << Jun | July | Aug >> | July 17 > |
| Welcome to the Wikipedia Computing Reference Desk Archives |
|---|
| The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
July 16
edit- Moved to here from the Mathematics section of the Reference desk — --Lambiam 13:37, 16 July 2024 (UTC)
As far I understand it correctly, GF(Integer) is used to declare a finite field which can for example be used for declaring an elliptic curve (this is what I want to do).
But why using a very large composite number (2 or 3 thousands bits long) seems to take too much time to feasible ? How to declare a dummy elliptic curve without using GF() ? 2A01:E0A:401:A7C0:9CB:33F3:E8EB:8A5D (talk) 10:09, 16 July 2024 (UTC)
- It appears you are referring to order or prime power, such as the 5 when using "GF(5)". If that is less than 2^16, it uses the C++ library which is efficient and fast. If it is larger than that, it uses an internal representation of polynomials over smaller fields, which is much slower. Perhaps that is what you are witnessing. 12.116.29.106 (talk) 14:09, 16 July 2024 (UTC)
- It s defnitely fast enough when you try a 512bit field. The problem is on very larger prime fields. 2A01:E0A:401:A7C0:A4D7:7E07:B3CA:86FA (talk) 17:09, 16 July 2024 (UTC)