Summary: A new construction of Cartesian authentication codes is proposed from the set knowledge. Their parameters are derived, and the probabilities of success for the impersonation attack, the substitution attack and order \(r\) spoofing attack the opponent are also computed. These results extend the theorem given in 1997 by Wang Yongchuan and Yang Yixian.