tpke: fix Vandermonde method naming

Author: txhsl

antimev/util.go

@@ -34,7 +34,7 @@ func getScaler(size int, threshold int) int {
 // searchDLCM tries to find a minimum value of scaler for the given matrix.
 func searchDLCM(matrix [][]int, l, pos, offset, size, threshold int) int {
 	if pos == threshold {
-		d, coeff := tpke.Feldman(matrix)
+		d, coeff := tpke.Vandermonde(matrix)
 		g := d
 		for i := 0; i < len(coeff); i++ {
 			g = gcd(g, coeff[i])

crypto/tpke/encryption.go

@@ -124,7 +124,7 @@ type workerResult struct {
 }
 
 // AggregateAndDecrypt tries to aggregate DecryptionShares and decrypts CipherTexts with verification
-// This method takes a batch of ordered CipherTexts, DecryptionShares and a matrix for Feldman
+// This method takes a batch of ordered CipherTexts, DecryptionShares and a matrix for Vandermonde
 // The size of DecryptionShare array should be len(message)*len(ciphertext)
 // Each row of the input matrix should be [1, i, i^2, ..., i^(threshold-1)], i is the dkg key index
 // The message amount should be larger than threshold, otherwise the result will be wrong
@@ -139,7 +139,7 @@ func AggregateAndDecrypt(cts []*CipherText, matrix [][]int, shares [][]*Decrypti
 	}
 
 	// Be aware of the integer overflow when the size and threshold of tpke grow big
-	d, coeff := Feldman(matrix)
+	d, coeff := Vandermonde(matrix)
 	d = scaler / d
 	results := make([]*bls12381.G1Affine, len(cts))
 	// Compute M=C-d1/d

crypto/tpke/signature.go

@@ -86,7 +86,7 @@ func (s *SignatureShare) Bytes() []byte {
 }
 
 // AggregateSigShares tries to aggregate SignatureShare to a BLS signature.
-// This method takes a slice of [SignatureShare] and a matrix for Feldman.
+// This method takes a slice of [SignatureShare] and a matrix for Vandermonde.
 // The size of [SignatureShare] slice should be equal to len(message).
 // Each row of the input matrix should be [1, i, i^2, ..., i^(threshold-1)], where i
 // is the dkg key index. The message amount should be larger than threshold,
@@ -96,7 +96,7 @@ func AggregateSigShares(matrix [][]int, shares []*SignatureShare, scaler int) (*
 		return nil, ErrTPKELengthMismatch
 	}
 	// Be aware of the integer overflow when the size and threshold grow big
-	d, coeff := Feldman(matrix)
+	d, coeff := Vandermonde(matrix)
 	d = scaler / d
 	// Compute d1
 	denominator := big.NewInt(int64(abs(d)))

crypto/tpke/util.go

@@ -207,7 +207,7 @@ func polyAdd(p1 []*big.Int, p2 []*big.Int) []*big.Int {
 	}
 }
 
-func Feldman(matrix [][]int) (int, []int) {
+func Vandermonde(matrix [][]int) (int, []int) {
 	// Compute D, D1
 	d, coeff := determinant(matrix, len(matrix))
 	g := d