Search results
Jump to navigation
Jump to search
- 10 KB (1,637 words) - 16:03, 17 December 2008
- '''Discrete logarithm''' is a problem of finding logarithms in a [[finite field]]. Given a field definition (such definitions always include some operation5 KB (772 words) - 17:15, 6 August 2013
- ...''Y'') of 2<sup>''m''</sup>-tuples, each corresponding to subsets of the [[finite field]] GF(2<sup>''m''</sup>) in some fixed way.2 KB (268 words) - 15:42, 29 October 2008
- 18 KB (3,028 words) - 17:12, 25 August 2013
- 20 KB (3,304 words) - 17:11, 25 August 2013
- | title = Non-Secret Encryption Using a Finite Field52 KB (8,332 words) - 05:49, 8 April 2024