Find all functions $ f: \mathbb{N^{*}}\to \mathbb{N^{*}}$ satisfying
\[ \left(f^{2}\left(m\right)+f\left(n\right)\right) \mid \left(m^{2}+n\right)^{2}\]
for any two positive integers $ m$ and $ n$.

[i]Remark.[/i] The abbreviation $ \mathbb{N^{*}}$ stands for the set of all positive integers:
$ \mathbb{N^{*}}=\left\{1,2,3,...\right\}$.
By $ f^{2}\left(m\right)$, we mean $ \left(f\left(m\right)\right)^{2}$ (and not $ f\left(f\left(m\right)\right)$).

[i]Proposed by Mohsen Jamali, Iran[/i]
1. We start by substituting \( m = 1 \) into the given functional equation:
   \[
   \left(f^2(1) + f(n)\right) \mid \left(1^2 + n\right)^2 = (1 + n)^2
   \]
   This implies:
   \[
   f^2(1) + f(n) \mid (1 + n)^2
   \]
   Since \( f: \mathbb{N^*} \to \mathbb{N^*} \), \( f(1) \) is a positive integer. Let \( f(1) = a \). Then:
   \[
   a^2 + f(n) \mid (1 + n)^2
   \]

2. Next, we consider the case when \( n = 1 \):
   \[
   a^2 + f(1) \mid (1 + 1)^2 = 4
   \]
   Since \( f(1) = a \), we have:
   \[
   a^2 + a \mid 4
   \]
   The possible values of \( a \) that satisfy this condition are \( a = 1 \) because:
   \[
   1^2 + 1 = 2 \quad \text{(which does not divide 4)}
   \]
   \[
   2^2 + 2 = 6 \quad \text{(which does not divide 4)}
   \]
   \[
   3^2 + 3 = 12 \quad \text{(which does not divide 4)}
   \]
   \[
   4^2 + 4 = 20 \quad \text{(which does not divide 4)}
   \]
   Therefore, the only possible value is \( a = 1 \). Hence, \( f(1) = 1 \).

3. Now, we substitute \( m = p-1 \) and \( n = 1 \) where \( p \) is a prime number:
   \[
   \left(f^2(p-1) + f(1)\right) \mid \left((p-1)^2 + 1\right)^2
   \]
   Since \( f(1) = 1 \), we have:
   \[
   \left(f^2(p-1) + 1\right) \mid \left(p^2 - 2p + 2\right)^2
   \]

4. Let \( f(p-1) = b \). Then:
   \[
   b^2 + 1 \mid (p^2 - 2p + 2)^2
   \]
   We need to find \( b \) such that \( b^2 + 1 \) divides \( (p^2 - 2p + 2)^2 \). Since \( p \) is a prime number, we can choose \( p \) to be arbitrarily large. This implies that \( b \) must be such that \( b^2 + 1 \) is a divisor of \( (p^2 - 2p + 2)^2 \) for all large \( p \).

5. To satisfy the divisibility condition for all large \( p \), we must have:
   \[
   b^2 + 1 = p^2 - 2p + 2
   \]
   This implies:
   \[
   b^2 + 1 = p^2 - 2p + 2
   \]
   However, this equation does not hold for all large \( p \). Therefore, the only possible solution is \( b = p-1 \).

6. Hence, we conclude that \( f(p-1) = p-1 \). By induction, we can generalize this result to all positive integers \( n \):
   \[
   f(n) = n
   \]

The final answer is \( \boxed{ f(n) = n } \).