From d1fb60cda80ee5158fd6fd091d0e1c8395e01271 Mon Sep 17 00:00:00 2001 From: "Jorge Manuel B. S. Vicetto" Date: Sun, 22 Mar 2009 04:10:56 +0000 Subject: Removing hawking as a maintainer since he was retired. (Portage version: 2.2_rc26/cvs/Linux x86_64) --- dev-libs/libtommath/ChangeLog | 8 ++- dev-libs/libtommath/metadata.xml | 109 +++++++++++++++++++-------------------- 2 files changed, 60 insertions(+), 57 deletions(-) (limited to 'dev-libs/libtommath') diff --git a/dev-libs/libtommath/ChangeLog b/dev-libs/libtommath/ChangeLog index 1306e9636a90..4b13c0ce7ec0 100644 --- a/dev-libs/libtommath/ChangeLog +++ b/dev-libs/libtommath/ChangeLog @@ -1,6 +1,10 @@ # ChangeLog for dev-libs/libtommath -# Copyright 1999-2008 Gentoo Foundation; Distributed under the GPL v2 -# $Header: /var/cvsroot/gentoo-x86/dev-libs/libtommath/ChangeLog,v 1.24 2008/09/25 14:44:03 hawking Exp $ +# Copyright 1999-2009 Gentoo Foundation; Distributed under the GPL v2 +# $Header: /var/cvsroot/gentoo-x86/dev-libs/libtommath/ChangeLog,v 1.25 2009/03/22 04:10:56 jmbsvicetto Exp $ + + 22 Mar 2009; Jorge Manuel B. S. Vicetto + metadata.xml: + Removing hawking as a maintainer since he was retired. 25 Sep 2008; Ali Polatel metadata.xml: Add myself to metadata.xml. diff --git a/dev-libs/libtommath/metadata.xml b/dev-libs/libtommath/metadata.xml index edd7b2dbcb54..f3c2191d88c1 100644 --- a/dev-libs/libtommath/metadata.xml +++ b/dev-libs/libtommath/metadata.xml @@ -1,62 +1,61 @@ -no-herd - - hawking@gentoo.org - Ali Polatel - - -LibTomMath is a free open source portable number theoretic multiple-precision -integer library written entirely in C. (phew!). The library is designed to -provide a simple to work with API that provides fairly efficient routines that -build out of the box without configuration. + no-herd + + maintainer-needed@gentoo.org + + + LibTomMath is a free open source portable number theoretic multiple-precision + integer library written entirely in C. (phew!). The library is designed to + provide a simple to work with API that provides fairly efficient routines that + build out of the box without configuration. -The library builds out of the box with GCC 2.95 [and up] as well as Visual C++ -v6.00 [with SP5] without configuration. The source code is arranged to make it -easy to dive into a particular area very quickly. The code is also littered with -comments [This is one of the on going goals] that help explain the algorithms and -their implementations. Ideally the code will serve as an educational tool in the -future for CS students studying number theory. + The library builds out of the box with GCC 2.95 [and up] as well as Visual C++ + v6.00 [with SP5] without configuration. The source code is arranged to make it + easy to dive into a particular area very quickly. The code is also littered with + comments [This is one of the on going goals] that help explain the algorithms and + their implementations. Ideally the code will serve as an educational tool in the + future for CS students studying number theory. -The library provides a vast array of highly optimized routines from various -branches of number theory. + The library provides a vast array of highly optimized routines from various + branches of number theory. - * Simple Algebraic - o Addition - o Subtraction - o Multiplication - o Squaring - o Division - * Digit Manipulation - o Shift left/right whole digits (mult by 2b by moving digits) - o Fast multiplication/division by 2 and 2k for k>1 - o Binary AND, OR and XOR gates - * Modular Reductions - o Barrett Reduction (fast for any p) - o Montgomery Reduction (faster for any odd p) - o DR Reduction (faster for any restricted p see manual) - o 2k Reduction (fast reduction modulo 2p - k) - o The exptmod logic can use any of the four reduction algorithms when -appropriate with a single function call. - * Number Theoretic - o Greatest Common Divisor - o Least Common Multiple - o Jacobi Symbol Computation (falls back to Legendre for prime moduli) - o Multiplicative Inverse - o Extended Euclidean Algorithm - o Modular Exponentiation - o Fermat and Miller-Rabin Primality Tests, utility function such as -is_prime and next_prime - * Miscellaneous - o Root finding over Z - o Pseudo-random integers - o Signed and Unsigned comparisons - * Optimizations - o Fast Comba based Multiplier, Squaring and Montgomery routines. - o Montgomery, Diminished Radix and Barrett based modular -exponentiation. - o Karatsuba and Toom-Cook multiplication algorithms. - o Many pointer aliasing optimiztions throughout the entire library. - + * Simple Algebraic + o Addition + o Subtraction + o Multiplication + o Squaring + o Division + * Digit Manipulation + o Shift left/right whole digits (mult by 2b by moving digits) + o Fast multiplication/division by 2 and 2k for k>1 + o Binary AND, OR and XOR gates + * Modular Reductions + o Barrett Reduction (fast for any p) + o Montgomery Reduction (faster for any odd p) + o DR Reduction (faster for any restricted p see manual) + o 2k Reduction (fast reduction modulo 2p - k) + o The exptmod logic can use any of the four reduction algorithms when + appropriate with a single function call. + * Number Theoretic + o Greatest Common Divisor + o Least Common Multiple + o Jacobi Symbol Computation (falls back to Legendre for prime moduli) + o Multiplicative Inverse + o Extended Euclidean Algorithm + o Modular Exponentiation + o Fermat and Miller-Rabin Primality Tests, utility function such as + is_prime and next_prime + * Miscellaneous + o Root finding over Z + o Pseudo-random integers + o Signed and Unsigned comparisons + * Optimizations + o Fast Comba based Multiplier, Squaring and Montgomery routines. + o Montgomery, Diminished Radix and Barrett based modular + exponentiation. + o Karatsuba and Toom-Cook multiplication algorithms. + o Many pointer aliasing optimiztions throughout the entire library. + -- cgit v1.2.3-65-gdbad