Control method and device for controlling authenticity of codes resulting from application of a bijective algorithm to messages

Abstract

A device (CD) is intended for controlling authenticity of a code received with a message by an electronic device (ED 2 ) and resulting from application to this message of a bijective algorithm with at least one predetermined key. This device (CD) has i) a first computation means (CM 1 ) arranged for applying partly this bijective algorithm with this predetermined key, from a starting step to a chosen intermediate step, to the received message, in order to get a first result, ii) a second computation means (CM 2 ) arranged for applying partly in a reverse manner the bijective algorithm with the predetermined key, from an ending step to this chosen intermediate step, to the received code while using the received message, in order to get a second result, and iii) a comparison means (CM 3 ) arranged for comparing these first and second results and for outputting an information representative of the authenticity of the received code when the first and second results are identical.

Claims

1 . A method for controlling authenticity of a code received with a message by an electronic device (ED 2 ) and resulting from application to said message of a bijective algorithm with at least one predetermined key, comprising: (i) applying partly said bijective algorithm with said predetermined key, from a starting step to a chosen intermediate step, to said received message, in order to get a first result, (ii) applying partly in a reverse manner said bijective algorithm with said predetermined key, from an ending step to said chosen intermediate step, to said received code while using said received message, in order to get a second result, and (iii) considering that said received code is authentic if said first and second results are identical. 2 . A method according to claim 1 , wherein said intermediate step varies from one application to another one. 3 . A method according to claim 2 , wherein said intermediate step varies randomly from one application to another one. 4 . A method according to claim 1 , wherein, in the case where said bijective algorithm comprises N successive parts that must be respectively applied to N blocks of data resulting from division of said received message and each combined with the result of the application of the preceding algorithm part to the preceding block, the method further comprises dividing said received message in step (i), and an intermediate step of selecting the end of a n-th algorithm part. 5 . A method according to claim 1 , wherein, in the case where said bijective algorithm comprises N successive parts that must be respectively applied to N blocks of data resulting from division of said received message and each combined with the result of the application of the preceding algorithm part to the preceding block, the method further comprises dividing said received message in step (i), and an intermediate step of selecting an intermediate sub part of a n-th algorithm part as intermediate step. 6 . A method according to claim 4 , wherein in steps (i) and (ii) comprises application of only a ciphering or cryptographic algorithm or a reverse version of said ciphering or cryptographic algorithm with a first part of the predetermined key in every algorithm part differing from the N-th one, and in that in step (ii) comprises applying first said reverse version of said ciphering or cryptographic algorithm with said first part of the predetermined key to said received code, to get a first intermediate result, then applying said ciphering or cryptographic algorithm with a second part of said predetermined key to said first intermediate result, to get a second intermediate result, then applying again said reverse version of the ciphering or cryptographic algorithm with said first part of the predetermined key to said second intermediate result, to get a third intermediate result, and finally dissociating said N-th block of data of said received message from said third intermediate result to get the result of the reverse version of the N-th algorithm part. 7 . A method according to claim 6 , wherein said ciphering or cryptographic algorithm is chosen from a group comprising at least a simple Data Encryption Standard algorithm, a triple Data Encryption Standard algorithm, an Advanced Encryption Standard algorithm, and a RSA algorithm. 8 . A control device (CD) for controlling authenticity of a code received with a message by an electronic device (ED 2 ) and resulting from application to said message of a bijective algorithm with at least one predetermined key, comprising i) a first computation means (CM 1 ) arranged for applying partly said bijective algorithm with said predetermined key, from a starting step to a chosen intermediate step, to said received message, in order to get a first result, ii) a second computation means (CM 2 ) arranged for applying partly in a reverse manner said bijective algorithm with said predetermined key, from an ending step to said chosen intermediate step, to said received code while using said received message, in order to get a second result, and iii) a comparison means (CM 3 ) arranged for comparing said first and second results and for outputting an information representative of the authenticity of said received code when said first and second results are identical. 9 . The control device according to claim 8 , further comprising a control means (CM 4 ) arranged for varying said intermediate step from one application to another one. 10 . The control device according to claim 9 , wherein said control means (CM 4 ) is arranged for varying randomly said intermediate step from one application to another one. 11 . The control device according to claim 8 , further comprising a control means (CM 4 ) arranged for dividing said received message into N blocks of data in the case where said bijective algorithm comprises N successive parts that must be respectively applied to N blocks of data resulting from division of said received message and each combined with the result of the application of the preceding algorithm part to the preceding block, and for choosing the end of a n-th algorithm part as intermediate step. 12 . The control device according to claim 8 , further comprising a control means (CM 4 ) arranged for dividing said received message into N blocks of data in the case where said bijective algorithm comprises N successive parts that must be respectively applied to N blocks of data resulting from division of said received message and each combined with the result of the application of the preceding algorithm part to the preceding block, and for choosing an intermediate sub part of a n-th algorithm part as intermediate step. 13 . The control device according to claim 11 , wherein said first (CM 1 ) and second (CM 2 ) computation means are arranged for applying only a ciphering or cryptographic algorithm or a reverse version of said ciphering or cryptographic algorithm with a first part of the predetermined key in every algorithm part differing from the N-th one, and said second computation means (CM 2 ) is arranged for applying said reverse version of said ciphering or cryptographic algorithm with said first part of the predetermined key to said received code, to get a first intermediate result, then for applying said ciphering or cryptographic algorithm with a second part of said predetermined key to said first intermediate result, to get a second intermediate result, then for applying again said reverse version of the ciphering or cryptographic algorithm with said first part of the predetermined key to said second intermediate result, to get a third intermediate result, and finally for dissociating said N-th block of data of said received message from said third intermediate result to get the result of the reverse version of the N-th algorithm part. 14 . The control device according to claim 13 , wherein said ciphering or cryptographic algorithm is chosen from a group comprising at least a simple Data Encryption Standard algorithm, a triple Data Encryption Standard algorithm, an Advanced Encryption Standard algorithm, and a RSA algorithm. 15 . An electronic device (ED 2 ), comprising a control device (CD) for controlling authenticity of a code received with a message by an electronic device (ED 2 ) and resulting from application to said message of a bijective algorithm with at least one predetermined key, the control device comprising i) a first computation means (CM 1 ) arranged for applying partly said bijective algorithm with said predetermined key, from a starting step to a chosen intermediate step, to said received message, in order to get a first result, ii) a second computation means (CM 2 ) arranged for applying partly in a reverse manner said bijective algorithm with said predetermined key, from an ending step to said chosen intermediate step, to said received code while using said received message, in order to get a second result, and iii) a comparison means (CM 3 ) arranged for comparing said first and second results and for outputting an information representative of the authenticity of said received code when said first and second results are identical. 16 . The electronic device (ED 2 ) of claim 15 wherein the control device further comprises a control means (CM 4 ) arranged for varying said intermediate step from one application to another one. 17 . The electronic device (ED 2 ) of claim 16 wherein said control means (CM 4 ) is arranged for varying randomly said intermediate step from one application to another one. 18 . The electronic device (ED 2 ) of claim 15 wherein the control device further comprises a control means (CM 4 ) arranged for dividing said received message into N blocks of data in the case where said bijective algorithm comprises N successive parts that must be respectively applied to N blocks of data resulting from division of said received message and each combined with the result of the application of the preceding algorithm part to the preceding block, and for choosing the end of a n-th algorithm part as intermediate step. 19 . The electronic device (ED 2 ) of claim 15 wherein the control device further comprises a control means (CM 4 ) arranged for dividing said received message into N blocks of data in the case where said bijective algorithm comprises N successive parts that must be respectively applied to N blocks of data resulting from division of said received message and each combined with the result of the application of the preceding algorithm part to the preceding block, and for choosing an intermediate sub part of a n-th algorithm part as intermediate step. The electronic device (ED 2 ) of claim 18 wherein said first (CM 1 ) and second (CM 2 ) computation means are arranged for applying only a ciphering or cryptographic algorithm or a reverse version of said ciphering or cryptographic algorithm with a first part of the predetermined key in every algorithm part differing from the N-th one, and said second computation means (CM 2 ) is arranged for applying said reverse version of said ciphering or cryptographic algorithm with said first part of the predetermined key to said received code, to get a first intermediate result, then for applying said ciphering or cryptographic algorithm with a second part of said predetermined key to said first intermediate result, to get a second intermediate result, then for applying again said reverse version of the ciphering or cryptographic algorithm with said first part of the predetermined key to said second intermediate result, to get a third intermediate result, and finally for dissociating said N-th block of data of said received message from said third intermediate result to get the result of the reverse version of the N-th algorithm part.
TECHNICAL FIELD [0001] The present invention relates to electronic devices or products using authenticated received messages, and more precisely to authentication control of codes associated to received messages. BACKGROUND OF THE INVENTION [0002] As it is known by the man skilled in the art, some electronic devices generate messages that are intended to be transmitted to other electronic devices, for instance for controlling functions and/or rights (such as access or credits). To avoid a non-authorized electronic device to transmit a non-authorized message, a bijective algorithm can be applied with at least one predetermined key to this message before transmission. This bijective algorithm may comprise a ciphering or cryptographic algorithm that is successively applied to N blocks of data resulting from the division of the message, for instance. [0003] The result of this application is a code, which is generally called MAC (“Message Authentication Code”). This code and the associated message are transmitted to the concerned electronic device. To authenticate this received code, the electronic device applies the same bijective algorithm with the same predetermined key to the received message in order to get a reference code. If this reference code is identical to the received code, the latter is considered as authentic and the message can be used, otherwise the message is rejected. [0004] Unfortunately, such a bijective algorithm may be attacked by an attacker to get each predetermined key it uses and therefore becoming capable of transmitting any authorized message. So, this attacker may transmit successively the same message with different codes to an electronic device to make it compute reference codes that it will have to compare respectively to the received codes, and then may deduce each predetermined key from these successive comparisons and from physical effect variations occurring into the attacked electronic device. It is recalled that some internal operations or processes may be recognized by characteristic physical effects, such as a specific power consumption, a specific temperature or a specific electromagnetic interaction, for instance. [0005] Attacks based on power consumption analysis (generally called DPA (“Differential Power Analysis”)) may be performed either on starting steps of the bijective algorithm or on ending steps of the bijective algorithm. The first ones (generally called “DPA by the beginning”) are relatively easy to block, for instance with specific countermeasures. The second ones (generally called “DPA by the end”) are much more difficult to block. They may be carried out when the attacker knows the code (or submitted MAC) that is received by the attacked electronic device, because he becomes capable of learning the result of the application of the ciphering or cryptographic algorithm that is used into the bijective algorithm. This second type of attacks is facilitated by the fact that the computed reference code is compared byte by byte to the received code (or submitted MAC). SUMMARY OF THE INVENTION [0006] So, an objective of the invention is to overcome the above described drawbacks at least partly by authenticating the received codes without computing reference codes. [0007] More precisely, the invention provides a method, intended for controlling authenticity of a code received with a message by an electronic device and resulting from application to this message of a bijective algorithm with at least one predetermined key, and comprising the steps of: (i) applying partly this bijective algorithm with this predetermined key, from a starting step to a chosen intermediate step, to the received message, in order to get a first result, (ii) applying partly in a reverse manner this bijective algorithm with this predetermined key, from an ending step to this chosen intermediate step, to the received code while using the received message, in order to get a second result, and (iii) considering that the received code is authentic if these first and second results are identical. [0011] The control method according to the invention may include additional characteristics considered separately or combined, and notably: the intermediate step may vary from one application to another one, possibly in a random manner; in the case where the bijective algorithm comprises N successive parts that must be respectively applied to N blocks of data resulting from division of the received message and each combined with the result of the application of the preceding algorithm part to the preceding block, one may proceed first to the division of the received message in step (i), and one may choose the end of a n-th algorithm part as intermediate step, or in a variant one may choose an intermediate sub part of a n-th algorithm part as intermediate step; in steps (i) and (ii) one may apply only a ciphering or cryptographic algorithm or a reverse version of this ciphering or cryptographic algorithm with a first part of the predetermined key in every algorithm part differing from the N-th one. In this case, in step (ii) one may apply first the reverse version of the ciphering or cryptographic algorithm with the first part of the predetermined key to the received code, to get a first intermediate result, then one may apply the ciphering or cryptographic algorithm with a second part of the predetermined key to the first intermediate result, to get a second intermediate result, then one may apply again the reverse version of the ciphering or cryptographic algorithm with the first part of the predetermined key to the second intermediate result, to get a third intermediate result, and finally one may dissociate the N-th block of data of the received message from the third intermediate result to get the result of the reverse version of the N-th algorithm part; the ciphering or cryptographic algorithm may be chosen from a group comprising at least a simple Data Encryption Standard algorithm (DES), a triple Data Encryption Standard algorithm (TDES), an Advanced Encryption Standard algorithm (AES), and a RSA algorithm (Rivest Shamir Adleman). [0016] The invention also provides a control device, intended for controlling authenticity of a code received with a message by an electronic device and resulting from application to this message of a bijective algorithm with at least one predetermined key, and comprising: a first computation means arranged for applying partly this bijective algorithm with this predetermined key, from a starting step to a chosen intermediate step, to the received message, in order to get a first result, a second computation means arranged for applying partly in a reverse manner the bijective algorithm with the predetermined key, from an ending step to this chosen intermediate step, to the received code while using the received message, in order to get a second result, and a comparison means arranged for comparing these first and second results and for outputting an information representative of the authenticity of the received code when the first and second results are identical. [0020] The control device according to the invention may include additional characteristics considered separately or combined, and notably: it may comprise a control means arranged for varying the intermediate step from one application to another one, possibly in a random manner; it may comprise a control means arranged for dividing the received message into N blocks of data in the case where the bijective algorithm comprises N successive parts that must be respectively applied to N blocks of data resulting from division of the received message and each combined with the result of the application of the preceding algorithm part to the preceding block, and for choosing the end of a n-th algorithm part as intermediate step, or in a variant for choosing an intermediate sub part of a n-th algorithm part as intermediate step; its first and second computation means may be arranged for applying only a ciphering or cryptographic algorithm or a reverse version of the ciphering or cryptographic algorithm with a first part of the predetermined key in every algorithm part differing from the N-th one. In this case, its second computation means may be further arranged for applying the reverse version of the ciphering or cryptographic algorithm with the first part of the predetermined key to the received code, to get a first intermediate result, then for applying the ciphering or cryptographic algorithm with a second part of the predetermined key to the first intermediate result, to get a second intermediate result, then for applying again the reverse version of the ciphering or cryptographic algorithm with the first part of the predetermined key to the second intermediate result, to get a third intermediate result, and finally for dissociating the N-th block of data of the received message from the third intermediate result to get the result of the reverse version of the N-th algorithm part; the ciphering or cryptographic algorithm may be chosen from a group comprising at least a simple Data Encryption Standard algorithm (DES), a triple Data Encryption Standard algorithm (TDES), an Advanced Encryption Standard algorithm (AES), and a RSA algorithm (Rivest Shamir Adleman). [0025] The invention also provides an electronic device comprising a control device such as the one above introduced. [0026] This electronic device may be chosen from a group comprising at least a smart card, a memory card reader, a telecommunication device, and a portable memory means. BRIEF DESCRIPTION OF THE FIGURES [0027] Other features and advantages of the invention will become apparent on examining the detailed specifications hereafter and the appended drawings, wherein: [0028] FIG. 1 schematically and functionally illustrates a first electronic device coupled to a second electronic device comprising a third electronic device having a microprocessor comprising a control device according to the invention, and [0029] FIG. 2 schematically and functionally illustrates an example of algorithm that can be used in a control method implemented by a control device according to the invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT [0030] The appended drawings may serve not only to complete the invention, but also to contribute to its definition, if need be. [0031] The invention aims, notably, at offering a control method, and an associated control device CD, intended for controlling authenticity of codes received with associated messages by an electronic device ED 2 and resulting from application to these messages of a bijective algorithm with at least one predetermined key K. [0032] In the following description it will be considered that the electronic device ED 2 is a smart card. For instance, it may be a credit card or an electronic identity card or else an electronic passport. But the invention is not limited to this type of electronic device. It concerns a lot of secured devices, and notably card readers, software protection dongles, telecommunication devices (for instance smart phones, electronic tablets, or fixed or portable computers), portable memory means (for instance USB keys), and secure modules present in a machine-to-machine communication in smart-metering devices. [0033] In the example illustrated in FIG. 1 the electronic device ED 2 is located into another electronic device ED 3 which is capable, at least, of receiving data transmitted by still another electronic device ED 1 . [0034] For instance, the electronic device ED 3 is a card reader with a telecommunication module, and the electronic device ED 1 is a fixed or portable computer (or any other type of telecommunication equipment (or device)). [0035] The electronic device ED 1 generates messages to be transmitted to the electronic device ED 3 and comprises a computation module CM 4 arranged for applying a chosen bijective algorithm with at least one predetermined key K to each generated message to produce a code that will be transmitted with the associated message. [0036] In the following description it will be considered that the bijective algorithm comprises a ciphering or cryptographic algorithm that is successively applied to N blocks of data Bn (n=1 to N), each resulting from the division of the message to be transmitted. [0037] This ciphering or cryptographic algorithm may be the so called simple Data Encryption Standard algorithm (or DES). But, it could be also a triple Data Encryption Standard algorithm (or TDES), or an Advanced Encryption Standard algorithm (or AES), or else a RSA algorithm (Rivest Shamir Adleman), for instance. [0038] For instance, the computation module CM 4 is arranged for dividing each generated message into N blocks of data Bn, having the same number M of bits (for instance M=8 bytes (i.e. 64 bits) and N=16), then for executing the first part PA 1 of the bijective algorithm. This first part PA 1 may consist in combining (CN) the first block of data B 1 (n=1) with a predetermined value PV to get a first value to which is applied a ciphering algorithm CA, for instance DES, with a first part K 1 of at least one predetermined key K. The application of the DES CA provides a result RP 1 , which is also the result of the execution of the first part PA 1 . Then the computation module CM 4 combines (CN) the second block of data B 2 (n=2) with the result RP 1 to get a value to which is applied the DES CA with the first part K 1 of the predetermined key K. The application of the DES CA provides a result RP 2 , which is also the result of the execution of the second part PA 2 . The computation module CM 4 proceeds in the same manner for each block of data Bn, with 2≦n≦N-1. Finally, the computation module CM 4 combines (CN) the N-th block of data BN (n=N) with the result RPN- 1 of the execution of the N-1-th part PAN- 1 to get a value to which is applied the DES CA with the first part K 1 of the predetermined key K, which gives another value to which is applied the reverse version CA −1 of the DES CA (DES −1 ) with a second part K 2 of the predetermined key K (which is the complementary part of the first part K 1 ), which gives still another value to which is applied the DES CA with the first part K 1 of the predetermined key K. The last application of the DES CA provides a result RPN, which is also the result of the execution of the N-th part PAN. This last result RPN is the code (or MAC) of the generated message to which has been applied the bijective algorithm. Once the electronic device ED 1 has this code and the associated message at its disposal, it may transmit them to the electronic device ED 3 , here for authentication control by the electronic device ED 2 . [0039] In the non-limiting example illustrated in FIG. 1 , the electronic device ED 2 comprises a microprocessor MP which comprises a control device CD according to the invention. [0040] It is important to note that the control device CD is not mandatorily located into the microprocessor MP (or any equivalent means, such as integrated circuits, for instance). Indeed, it may be a device that is coupled to the microprocessor MP and may access to the received messages and associated codes. Such a control device CD may be also located into another device of the electronic device ED 2 or ED 3 . [0041] So a control device CD can be made of software modules, at least partly, or of electronic circuit(s) or hardware modules, or else of a combination of hardware and software modules (in this last case the control device CD comprises also software interfaces allowing interworking between its hardware and software modules). In case where it is made of software modules it can be stored in a memory means or in any computer software product which can be read by an electronic device. [0042] As illustrated in FIG. 1 , a control device CD, according to the invention, comprises at least first CM 1 and second CM 2 computation means and a comparison means CM 3 . [0043] The first computation means CM 1 is arranged for applying partly the same bijective algorithm that the one executed by the computation module CM 4 with the same predetermined key K, from a starting step to a chosen intermediate step, to a message received by the electronic device ED 2 , in order to get a first result FR. [0044] The second computation means CM 2 is arranged for applying partly in a reverse manner the same bijective algorithm with the same predetermined key K, from an ending step to the chosen intermediate step, to the code RC received with the considered message while using this considered message, in order to get a second result SR. [0045] In other words, the first computation means CM 1 executes a part of the bijective algorithm in a classical way, i.e. from its beginning (or starting step), which consists in combining the first block of data B 1 of the received message with the predetermined value PV to get a first value, until it reaches a chosen intermediate step, while the second computation means CM 2 executes a complementary part of the bijective algorithm in a reverse way, i.e. from its end (or ending step), which consists in applying a reverse version CA −1 of the ciphering or cryptographic algorithm CA (here DES −1 , for instance) with the first part K 1 of the predetermined key K to the received code RC (associated to the concerned message) to get a first intermediate result, until it reaches the chosen intermediate step. The executed algorithm being bijective, if the received code RC is authentic, the first result FR must be necessarily identical to the second result SR. A received code RC is considered as authentic if it is the result of the application of the bijective algorithm with the predetermined key K to the associated message by the computation module CM 4 . [0046] The comparison means CM 3 is arranged for comparing the first FR and second SR results (computed by the first CM 1 and second CM 2 computation means for a received message and the associated received code RC), and for outputting an information which is representative of the authenticity of this received code RC when these first FR and second SR results are identical. [0047] Thus, the reference code is never computed and does not appear in the computations except when the received code RC has been considered has authentic. [0048] Moreover an attacker can no more carried out DPA by the end as the received code RC is an entry of the bijective algorithm. [0049] More, the final comparison, which is the sensitive operation, being performed with two computed intermediate results, the attacker cannot choose anyone of these two computed intermediate results. So, the security is notably improved. [0050] Still more, the final comparison being not performed with a computed reference code, a byte considered as incorrect during this final comparison cannot indicate which byte of the received code RC is incorrect. So there is no need to perform the final comparison in random order. [0051] A non-limiting example of algorithm, which can be implemented by a control device CD according to the invention, is illustrated in FIG. 2 . In this example one considers that the chosen intermediate step is the end of the second algorithm part PA 2 . So, the first result FR is the result RP 2 of the execution of the second algorithm part PA 2 , while the second result SR is the result RP 3 of the execution in a reverse manner of the third algorithm part PA 3 . [0052] More precisely, in this example once a received message has been divided into N blocks of data Bn, having the same number M of bits (for instance M=8 bytes (i.e. 64 bits) and N=16), the first computation means CM 1 executes the first part PA 1 of the bijective algorithm. [0053] As illustrated in FIG. 1 , the control device CD may comprise a control means CM 4 arranged for dividing each received message into N blocks of data Bn. [0054] The first part PA 1 may consist in combining (CN) the first block of data B 1 with the predetermined value PV to get a first value to which is applied the ciphering algorithm CA (here DES, for instance), with the first part K 1 of the predetermined key K. The application of the DES CA provides a result RP 1 , which is also the result of the execution of the first part PA 1 . Then the first computation means CM 1 combines (CN) the second block of data B 2 with the result RP 1 to get a value to which is applied the DES CA with the first part K 1 of the predetermined key K. The application of the DES CA provides a result RP 2 , which is also the result of the execution of the second part PA 2 and the first result FR in this example. [0055] In parallel (but it could be also after) the second computation means CM 2 executes the N-th part PAN of the bijective algorithm in a reverse manner. So, it (CM 2 ) applies the reverse version CA −1 of the ciphering algorithm CA (here DES −1 ) with the first part K 1 of the predetermined key K to the received code RC, to get a first intermediate result, then it applies the DES CA with the second part K 2 of the predetermined key K (which is the complementary part of the first part K 1 ) to this first intermediate result, to get a second intermediate result, then it applies again the reverse version CA −1 of the ciphering algorithm CA (here DES −1 ) with the first part K 1 of the predetermined key K to this second intermediate result, to get a third intermediate result, and finally for dissociating (CN −1 ) the N-th block of data BN of the received message from this third intermediate result to get the result RPN of the reverse version of the N-th algorithm part PAN. [0056] One means here by “dissociating” the reverse function CN −1 of the combination CN (here carried out in the first PA 1 and second PA 2 algorithm parts). [0057] Then the second computation means CM 2 executes the N-1-th part PAN- 1 of the bijective algorithm in a reverse manner. So, it (CM 2 ) applies the reverse version CA −1 of the ciphering algorithm CA (here DES −1 ) with the first part K 1 of the predetermined key K to the result RPN, to get a value from which it dissociates (CN −1 ) the N-1-th block of data BN- 1 of the received message to get the result RPN- 1 of the reverse version of the N-1-th algorithm part PAN- 1 . The second computation means CM 2 proceeds in the same manner for each block of data Bn, with 3≦n≦N-1, to get the second result SR at the end of the application of the reverse version of the third algorithm part PA 3 (with SR=RP 3 ). [0058] Then this second result SR is compared with the first result FR by the comparison means CM 3 . [0059] In the above described example of algorithm, the intermediate step is the end of a n-th algorithm part PAn (here n=2, for instance), with n greater than 1 and smaller than N (2≦n≦N-1). But, this is not mandatory. Indeed, the intermediate step may be an intermediate sub part of a n-th algorithm part PAn (with 2≦n≦N-1). For instance, this intermediate sub part may be the end of a combination CN in a n-th algorithm part PAn (for the first computation means CM 1 ) or the end of the application of a reverse version CA −1 of the ciphering algorithm CA (here DES −1 ) in this n-th algorithm part PAn (for the second computation means CM 2 ). [0060] The control means CM 4 may be arranged for choosing the intermediate step where the first CM 1 and second CM 2 computation means must stop their respective computations. [0061] It is important to note that the choice of the intermediate step, where the first CM 1 and second CM 2 computation means must stop their respective computations, can be predetermined. But this choice may advantageously varies, possibly in a random manner, from one application (or execution) of the bijective algorithm to another one. The control means CM 4 may be in charge of this choice. [0062] The invention can also be considered in terms of a control method for an electronic device ED 2 . Such a method may be implemented by means of a control device CD such as the one above described with reference to FIGS. 1 and 2 . Therefore, only its main characteristics will be mentioned hereafter. The control method according to the invention comprises the steps of: (i) applying partly a bijective algorithm with a predetermined key K, from a starting step to a chosen intermediate step, to a received message, in order to get a first result, (ii) applying partly in a reverse manner this bijective algorithm with this predetermined key K, from an ending step to this chosen intermediate step, to the code RC received with the message while using this received message, in order to get a second result, and (iii) considering that this received code RC is authentic if these first and second results are identical. [0066] These first (i), second (ii) and third (iii) steps may be respectively carried out by the first computation means CM 1 , the second computation means CM 2 and the comparison means CM 3 . [0067] The invention is not limited to the embodiments of control method, control device and electronic device described above, only as examples, but it encompasses all alternative embodiments which may be considered by one skilled in the art within the scope of the claims hereafter.

Description

Topics

Download Full PDF Version (Non-Commercial Use)

Patent Citations (0)

    Publication numberPublication dateAssigneeTitle

NO-Patent Citations (0)

    Title

Cited By (0)

    Publication numberPublication dateAssigneeTitle