Removed the 20% estimate on faster bignum routines
This was not accurate since this was mostly based on total runtime of an eapol_test run. The real improvement in the bignum routines is much larger (mayby twice as fast as before).
This commit is contained in:
parent
b95394c66f
commit
187bc466a3
1 changed files with 1 additions and 2 deletions
|
@ -309,8 +309,7 @@ CONFIG_PEERKEY=y
|
||||||
#endif
|
#endif
|
||||||
# At the cost of about 4 kB of additional binary size, the internal LibTomMath
|
# At the cost of about 4 kB of additional binary size, the internal LibTomMath
|
||||||
# can be configured to include faster routines for exptmod, sqr, and div to
|
# can be configured to include faster routines for exptmod, sqr, and div to
|
||||||
# speed up DH and RSA calculation considerably (around 20% time removed on
|
# speed up DH and RSA calculation considerably
|
||||||
# Pentium 4)
|
|
||||||
#CONFIG_INTERNAL_LIBTOMMATH_FAST=y
|
#CONFIG_INTERNAL_LIBTOMMATH_FAST=y
|
||||||
|
|
||||||
# Include NDIS event processing through WMI into wpa_supplicant/wpasvc.
|
# Include NDIS event processing through WMI into wpa_supplicant/wpasvc.
|
||||||
|
|
Loading…
Reference in a new issue