Abstract: In the recent years it has been shown how most dangerous attacks against cryptographic systems target the vulnerabilities of the implementations. Among them, fault attacks have proved to be a serious threat. Several countermeasures have been proposed that address this issue by relying on some form of redundancy. In this talk we will discuss a recent approach based on temporal approach inspired by the double-data-rate computation template. We will present its principles, the benefits in terms of error coverage and its implementation costs, and the problems arising for its testability.