Method for managing a cache memory of an electronic computer, this method comprising the following steps during the execution, by this computer, of a process that has to process a word: a) receiving (100, 130) a request containing an address of the word to be read or to be written, this address comprising: - a line tag (T r), - a set address (@ Si,r), this set address belonging to a first set of s different values, wherein the number s is an integer greater than two, b) transforming (104, 134) the received set address into a transformed set address using a bijective transformation function that permutes at least two values of the first set, c) selecting (106, 136) one or more line tags recorded in the cache memory at the transformed set address, d) comparing (108, 138) the received line tag with the selected line tag or tags on the basis of the transformed set address, in order to determine whether one of these selected line tags corresponds to the received line tag, e) when none of the selected tags corresponds to the received line tag, triggering (118, 142) a cache error and providing the word from a superordinate memory, and when, by contrast, one of the selected line tags corresponds to the received line tag, reading or writing the word from or to the cache memory within the line associated with the line tag that corresponds to the received line tag, f) modifying (86; 286) the transformation function, this modification of the transformation function being repeated multiple times during the execution of the process such that, during the same execution of the process, the transformation function successively associates, over time, multiple different transformed set addresses with one and the same set address liable to be received, characterized in that: - the transformation function is parameterized by a parameter q such that the transformed set address obtained in step f) depends both on the received set address and on the value of this parameter q, and for all nonzero values of the parameter q, the transformation function permutes at least 50% of the set addresses, and - during each execution of step f), a new value of the parameter q is generated in order to modify the transformation function. a) receiving (100, 130) a request containing an address of the word to be read or to be written, this address comprising: - a line tag (T r), - a set address (@ Si,r), this set address belonging to a first set of s different values, wherein the number s is an integer greater than two, - a line tag (T r), - a set address (@ Si,r), this set address belonging to a first set of s different values, wherein the number s is an integer greater than two, b) transforming (104, 134) the received set address into a transformed set address using a bijective transformation function that permutes at least two values of the first set, c) selecting (106, 136) one or more line tags recorded in the cache memory at the transformed set address, d) comparing (108, 138) the received line tag with the selected line tag or tags on the basis of the transformed set address, in order to determine whether one of these selected line tags corresponds to the received line tag, e) when none of the selected tags corresponds to the received line tag, triggering (118, 142) a cache error and providing the word from a superordinate memory, and when, by contrast, one of the selected line tags corresponds to the received line tag, reading or writing the word from or to the cache memory within the line associated with the line tag that corresponds to the received line tag, f) modifying (86; 286) the transformation function, this modification of the transformation function being repeated multiple times during the execution of the process such that, during the same execution of the process, the transformation function successively associates, over time, multiple different transformed set addresses with one and the same set address liable to be received, characterized in that: - the transformation function is parameterized by a parameter q such that the transformed set address obtained in step f) depends both on the received set address and on the value of this parameter q, and for all nonzero values of the parameter q, the transformation function permutes at least 50% of the set addresses, and - during each execution of step f), a new value of the parameter q is generated in order to modify the transformation function. - the transformation function is parameterized by a parameter q such that the transformed set address obtained in step f) depends both on the received set address and on the value of this parameter q, and for all nonzero values of the parameter q, the transformation function permutes at least 50% of the set addresses, and - during each execution of step f), a new value of the parameter q is generated in order to modify the transformation function.