Fix format

Author: anhthii

common/constant_time.go

@@ -51,11 +51,11 @@ func IsConstantTimeEnabled() bool {
 // 2. The same code used internally by crypto/rsa and crypto/ecdsa
 // 3. Highly optimized with architecture-specific assembly
 type CTModInt struct {
-	mod         *bigmod.Modulus
-	modBigInt   *big.Int
+	mod        *bigmod.Modulus
+	modBigInt  *big.Int
 	inverseExp []byte // Exponent for modular inverse: p-2 (prime) or phi(n)-1 (composite)
-	byteLen     int
-	bytePool    sync.Pool
+	byteLen    int
+	bytePool   sync.Pool
 }
 
 // NewCTModInt creates a constant-time modular context using bigmod.
@@ -76,7 +76,7 @@ func NewCTModInt(mod *big.Int) *CTModInt {
 		mod:        m,
 		modBigInt:  new(big.Int).Set(mod),
 		inverseExp: modMinusTwo.Bytes(),
-		byteLen:     byteLen,
+		byteLen:    byteLen,
 		bytePool: sync.Pool{
 			New: func() interface{} {
 				return make([]byte, byteLen)
@@ -206,10 +206,10 @@ func NewCTModIntWithPhi(mod, phiN *big.Int) *CTModInt {
 
 	byteLen := len(modBytes)
 	return &CTModInt{
-		mod:         m,
-		modBigInt:   new(big.Int).Set(mod),
+		mod:        m,
+		modBigInt:  new(big.Int).Set(mod),
 		inverseExp: phiMinusOne.Bytes(), // Use phi(n)-1 instead of n-2
-		byteLen:     byteLen,
+		byteLen:    byteLen,
 		bytePool: sync.Pool{
 			New: func() interface{} {
 				return make([]byte, byteLen)

crypto/paillier/paillier.go

@@ -50,7 +50,7 @@ type (
 		P, Q *big.Int
 
 		// cached M = N^(-1) mod PhiN, lazily computed
-		m    *big.Int
+		m     *big.Int
 		mOnce sync.Once
 	}