RFID card identity authentication method based on WISP, terminal, system, medium and product
By combining dynamic time-series matching and cosine similarity calculation of WISP triaxial acceleration information in RFID cards, the problem of easily replaceable driver identity in traditional vehicle-to-everything (V2X) networks has been solved, achieving high-precision driver identity authentication and enhancing the security and reliability of V2X networks.
Patent Information
- Application Number
- CN202410750853.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-06-12
- Publication Date
- 2025-12-12
AI Technical Summary
In traditional vehicle-to-everything (V2X) driver identity management, drivers can substitute for each other to swipe cards to evade supervision. Existing technologies, such as using a mobile phone's six-axis sensor, are not applicable to traditional RFID cards, and WISP's gesture judgment accuracy is limited and easily imitated.
The WISP-based RFID card authentication method is adopted. By acquiring the identity information in the RFID card and the WISP triaxial acceleration information when the card is swiped, and performing normalization processing, the dynamic time series DTW matching algorithm and cosine similarity calculation are used to accurately match the driver's biological behavioral characteristics.
It significantly enhances the anti-counterfeiting capabilities of the authentication process, accurately identifying the driver's identity even with slight changes in card swiping speed, thus improving the security and accuracy of vehicle network identity verification.
Smart Images

Figure CN121126345A_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the field of Internet of Things, in particular to a WISP-based RFID card identity authentication method, terminal, medium and product. BACKGROUND
[0002] Traditional driver identity management of Internet of Vehicles relies on driver's identity verification by swiping RFID card before driving, to ensure that the driver's identity matches the vehicle use record and the driver's attendance. However, this approach has loopholes, i.e. drivers can replace each other to swipe the card to evade supervision. Although existing technologies attempt to strengthen verification in other ways, for example, an existing technology proposes a method of automatically switching NFC card by using the six-axis sensor of the mobile phone to judge the card swiping posture, but this is not applicable to traditional RFID cards without built-in sensors. In addition, existing research has explored the application of WISP in judging the card swiping posture to increase security, but due to the limited accuracy of posture judgment, it is easy to be imitated and cannot fundamentally solve the problem. SUMMARY
[0003] The present application provides a WISP-based RFID card identity authentication method, terminal, system, medium and product, aiming to strengthen the security management of driver identity in the Internet of Vehicles environment and quickly and accurately identify the driver's identity. In order to achieve the above purpose, on the one hand, a WISP-based RFID card identity authentication method is provided, which comprises the following steps:
[0004] S1, when the cardholder of the RFID card swipes the card, acquiring the first identity information stored in the RFID card and the first WISP three-axis acceleration information of the cardholder when swiping the card detected by the WISP acceleration sensor;
[0005] S2, comparing the acquired first identity information and first WISP three-axis acceleration information with the second identity information and second WISP three-axis acceleration information of the owner of the RFID card collected and stored in advance when swiping the card; if the first identity information matches the second identity information and the first WISP three-axis acceleration information matches the second WISP three-axis acceleration information, it is determined that the cardholder of the RFID card passes the identity verification by swiping the card.
[0006] Preferably, the identity verification method is:
[0007] After collecting the second WISP three-axis acceleration information of the owner of the RFID card when swiping the card, it further comprises: performing predetermined normalization processing on the second WISP three-axis acceleration information to obtain and store the corresponding first normalized acceleration sequence B1(t);
[0008] after acquiring the first WISP triaxial acceleration information of the cardholder when swiping the card, further comprising:
[0009] performing the predetermined normalization processing on the first WISP triaxial acceleration information to obtain and store a corresponding second normalized acceleration sequence B0(t);
[0010] performing dynamic sequence matching on the B1(t) and B0(t) using a dynamic time sequence (DTW) matching algorithm to obtain a one-to-one corresponding third acceleration sequence C1(t) and a fourth acceleration sequence C0(t) after matching;
[0011] calculating the cosine similarity D between the C0(t) and the C1(t), and when the cosine similarity meets a predetermined threshold condition, determining that the first WISP triaxial acceleration information and the second WISP triaxial acceleration information match.
[0012] Preferably, the WISP-based RFID card identity authentication method, wherein the normalization processing on the first WISP triaxial acceleration information or the second WISP triaxial acceleration information comprises:
[0013] calculating a resultant acceleration A(t) of the corresponding triaxial acceleration according to the first WISP triaxial acceleration information or the second WISP triaxial acceleration information:
[0014]
[0015] wherein t represents the current time, ax(t), ay(t), and az(t) represent the acceleration data of the x, y, and z axes at the current time t, respectively;
[0016] determining the normalized acceleration sequence B(t) using the following formula according to the value of the resultant acceleration A(t), wherein B(t) includes B1(t) or B0(t):
[0017]
[0018] wherein Amin is the minimum A(t) value in a predetermined sampling time period, and Amax is the maximum A(t) value in the predetermined sampling time period.
[0019] Preferably, the WISP-based RFID card identity authentication method, wherein the step of performing dynamic sequence matching on the B1(t) and B0(t) using a dynamic time sequence (DTW) matching algorithm to obtain a one-to-one corresponding third acceleration sequence C1(t) and a fourth acceleration sequence C0(t) after matching comprises:
[0020] After dynamic sequence matching of the B1(t) and the B0(t) is performed by using a dynamic time sequence (DTW) matching algorithm, the sequence is adjusted according to the corresponding relationship between the points in the matched B0(t) and the points in the B1(t), wherein:
[0021] (1) for any sequence point B0(t1) in the B0(t) that corresponds to multiple points in the B1(t), the first arithmetic mean value of the data of all the B1(t) points corresponding to the B0(t1) is calculated, and the first arithmetic mean value corresponds to the value of the B0(t1) in the B0(t);
[0022] (2) for the B1(t2) sequence point in the B0(t) that corresponds to one B1(t) point in the B1(t), the second arithmetic mean value of all the data points in the B0(t) corresponding to the B1(t2) is calculated, and the second arithmetic mean value corresponds to the value of the B1(t2) in the B1(t);
[0023] (3) for the sequence points in the B0(t) and the B1(t) that correspond to each other, the original one-to-one correspondence is retained and no processing is performed;
[0024] The sequence points obtained after the adjustment are arranged in order to generate the C0(t) corresponding to the B0(t) and the C1(t) corresponding to the B1(t).
[0025] Preferably, the RFID card identity verification method, wherein the first identity information and the first WISP three-axis acceleration information are obtained by the WISP-compatible RFID reader.
[0026] In another aspect, a vehicle-mounted terminal is provided, comprising a memory and a processor, the memory stores at least one program, and the at least one program is executed by the processor to implement the steps of the WISP-based RFID card identity authentication method as described in any of the above.
[0027] In yet another aspect, a WISP-based RFID card identity authentication system is provided, characterized in that the system comprises a vehicle-mounted supervision terminal and a WISP-compatible RFID reader; wherein:
[0028] The WISP-compatible RFID reader is configured to obtain the first identity information stored in the RFID card and the first WISP three-axis acceleration information of the cardholder when the card is swiped by the WISP acceleration sensor when the cardholder swipes the card, and send the obtained first identity information and first WISP three-axis acceleration information to the vehicle-mounted supervision terminal.
[0029] The vehicle-mounted supervision terminal is configured to receive the first identity information and the first WISP three-axis acceleration information transmitted by the compatible WISP RFID reader, and compare the acquired first identity information and the first WISP three-axis acceleration information with the second identity information and the second WISP three-axis acceleration information of the owner of the RFID card collected and stored in advance and when the card is swiped; if the first identity information matches the second identity information and the first WISP three-axis acceleration information matches the second WISP three-axis acceleration information, it is determined that the cardholder of the RFID card passes the card swiping identity verification.
[0030] In another aspect, a computer-readable storage medium is provided, characterized in that at least one program is stored in the storage medium, and the at least one program is executed by a processor to implement the steps of the WISP-based RFID card identity authentication method according to any one of the above aspects.
[0031] In another aspect, a computer program product is provided, including a computer program, characterized in that the computer program is executed by a processor to implement the steps of the WISP-based RFID card identity authentication method according to any one of the above aspects.
[0032] The above technical solutions have one or more of the following technical effects:
[0033] (1) On the basis of traditional RFID information verification, biological behavior characteristics are added for verification, especially the acceleration data when the driver swipes the card, and the collected acceleration data is normalized to ensure that different force swiping actions do not affect the judgment of biological behavior characteristics. These data vary due to individual behavior habits and are difficult to replicate, thus significantly enhancing the anti-counterfeiting capability of the authentication process.
[0034] (2) By collecting and analyzing the three-axis acceleration data on the RFID card at the moment when the driver swipes the card, the biological behavior characteristics of the driver are reflected using these data. This biological behavior characteristic is similar to gait analysis and has the characteristics of high personalization and difficulty to imitate.
[0035] (3) The cosine similarity calculation method is used to compare the normalized and aligned biological behavior characteristic sequences to accurately determine whether the current swiping behavior matches the pre-recorded driver behavior characteristics. This method can accurately identify the driver's identity even if there is a slight change in the swiping speed. (4) Combining the Internet of Things and RFID technology not only optimizes basic applications such as supply chain management and asset tracking, but also provides a more intelligent and secure identity verification solution in the field of Internet of Vehicles, which helps to build a more efficient and reliable transportation and logistics system. BRIEF DESCRIPTION OF DRAWINGS
[0036] Figure 1 A flow chart of a WISP-based RFID card identity authentication method according to an embodiment of the present application;
[0037] Figure 2 A flow chart of a WISP-based RFID card identity authentication method according to an embodiment of the present application;
[0038] Figure 3 A schematic diagram of the corresponding relationship between the first normalized acceleration sequence B1(t) and the second normalized acceleration sequence B0(t) in a WISP-based RFID card identity authentication method according to an embodiment of the present application. DETAILED DESCRIPTION
[0039] To further illustrate the embodiments, the present application provides accompanying drawings. These drawings are part of the disclosure of the present application, mainly used to illustrate the embodiments, and can be used to explain the operating principle of the embodiments in conjunction with the related description of the specification. Those of ordinary skill in the art should be able to understand other possible implementations and advantages of the present application in conjunction with these contents. The components in the drawings are not drawn to scale, and similar component symbols are generally used to represent similar components.
[0040] The present application will be further described in conjunction with the accompanying drawings and specific embodiments.
[0041] Embodiment one:
[0042] In order to strengthen the driver identity security management in the Internet of Vehicles environment, and quickly and accurately identify the driver identity, the present application provides a WISP-based RFID card identity authentication method. Of course, the WISP-based RFID card identity authentication method according to the embodiments of the present application is applicable to any scene using RFID cards for identity authentication.
[0043] Figure 1 A flow chart of a WISP-based RFID card identity authentication method according to an embodiment of the present application. As Figure 1 The WISP-based RFID card identity authentication method according to the embodiments of the present application includes the following steps:
[0044] S1, when the cardholder of the RFID card swipes the card, the first identity information stored in the RFID card and the first WISP three-axis acceleration information of the cardholder when swiping the card detected by the WISP acceleration sensor are acquired;
[0045] S2, comparing the acquired first identity information and first WISP three-axis acceleration information with the pre-acquired and stored second identity information of the RFID card owner and the second WISP three-axis acceleration information at the time of card swiping; if the first identity information matches the second identity information and the first WISP three-axis acceleration information matches the second WISP three-axis acceleration information, it is determined that the card swiping person of the RFID card passes the card swiping identity verification.
[0046] Embodiment two:
[0047] Figure 2 A flowchart of an RFID card identity authentication method based on WISP according to an embodiment of the present application. The identity authentication method of this embodiment is applied to the identity verification of a driver, and the driver identity is accurately matched by comparing the biological behavior characteristics such as WISP three-axis acceleration information.
[0048] In a specific implementation, when the above-mentioned identity authentication method of the embodiment of the present application is applied to the identity verification of a driver, the above-mentioned method can be realized through a vehicle-mounted terminal.
[0049] Embodiment three:
[0050] In a specific implementation, for the scenario of driver identity verification, when the driver RFID card information is pre-recorded on the Internet of Vehicles supervision terminal, the three-axis acceleration data on the RFID card at the time of card swiping is synchronously collected based on the enhanced function provided by WISP. The three-axis acceleration data is normalized and then stored after processing. After the driver information is recorded in the system, when the driver logs in before driving, the vehicle-mounted terminal verifies the information of the RFID itself, and also collects the three-axis acceleration data at the time of card swiping based on WISP. The three-axis acceleration data is processed by the same normalization method as in the recording information stage, and then is aligned and processed by DTW algorithm with the recording information, and then is compared by the cosine similarity method. The current characteristics are compared with the characteristics recorded when the driver identity is recorded. If the behavior characteristics are determined to be the same, it is considered that the card swiping operation is by the driver himself, and the authentication is passed. Otherwise, it may be a non-self operation of card swiping by others, and it is prompted that the card swiping should be by the person himself. In this way, the card swiping by others can be effectively prevented.
[0051] In this embodiment, after the second WISP three-axis acceleration information of the RFID card owner at the time of card swiping is collected, it further includes: performing predetermined normalization processing on the second WISP three-axis acceleration information to obtain and store the corresponding first normalized acceleration sequence B1(t);
[0052] After the first WISP three-axis acceleration information of the card swiping person at the time of card swiping is acquired, it further includes:
[0053] The first WISP three-axis acceleration information is subjected to predetermined normalization processing to obtain and store corresponding second normalized acceleration sequence B0(t);
[0054] The dynamic time sequence DTW matching algorithm is adopted to perform dynamic sequence matching on B1(t) and B0(t) to obtain one-to-one corresponding third acceleration sequence C1(t) and fourth acceleration sequence C0(t) after matching.
[0055] The cosine similarity D between C0(t) and C1(t) is calculated, and when the cosine similarity satisfies a predetermined threshold condition, it is determined that the first WISP three-axis acceleration information and the second WISP three-axis acceleration information are matched.
[0056] In a specific implementation, when the cosine similarity D is greater than a predetermined similarity threshold, it is determined that the cosine similarity satisfies the predetermined threshold condition; preferably, the predetermined similarity threshold is a positive number less than 1 and greater than or equal to 0.8.
[0057] In a specific implementation, the normalization processing method adopted for the WISP three-axis acceleration data includes:
[0058] The resultant acceleration A(t) of the three-axis acceleration is calculated:
[0059]
[0060] Among them, t represents the current time, ax(t), ay(t), and az(t) represent the acceleration data of the x, y, and z axes at the current time t, respectively. Using the resultant acceleration for comparison can initially avoid the influence of different card gestures.
[0061] The A(t) sequence is further normalized to the B(t) sequence to avoid the influence of the weight of the card swiping action on the biological behavior characteristics such as the movement characteristics:
[0062]
[0063] Among them, Amin is the minimum A(t) value in a predetermined sampling time period, and Amax is the maximum A(t) value in a predetermined sampling time period.
[0064] According to whether the processed WISP three-axis acceleration is first WISP three-axis acceleration information or second WISP three-axis acceleration information, B(t) corresponds to B1(t) or B0(t), respectively.
[0065] In embodiments of the present invention, before comparing the currently collected identity and acceleration information with pre-stored identity and acceleration information for correlation features, dynamic time series (DTW) matching is used to prevent local variations in the speed of card swiping from affecting biometric behavioral characteristics. DTW is a well-known sequence matching algorithm, and its detailed process will not be elaborated here. Embodiments of the present invention utilize the DTW algorithm for dynamic sequence matching of card swiping acceleration values. After completing the matching process, cosine similarity calculation is then performed.
[0066] By matching the two sequences B1(t) previously entered and collected by the RFID card owner (e.g., the driver) and B0(t) obtained during the current card swipe, the influence of local relative speed can be eliminated. Figure 3 As shown, after DTW processing, the original data based on B0(t) will have multiple correspondences with B1(t), specifically:
[0067] (1) For any sequence point B0(t1) in B0(t) that satisfies that one point corresponds to multiple points in B1(t), calculate the first arithmetic mean of the data of all the corresponding B1(t) points. The first arithmetic mean corresponds to the value of the B0(t1) point in B0(t).
[0068] (2) For the B1(t2) sequence points in B0(t) that satisfy multiple point pairs in B1(t) of a point in B1(t), calculate the second arithmetic mean of all data points in B0(t) corresponding to point B1(t2). The second arithmetic mean corresponds to the value of point B1(t2) in B1(t).
[0069] (3) For the sequence points in B0(t) and B1(t) that satisfy the one-to-one correspondence, retain the original one-to-one correspondence and do not process it;
[0070] Arrange the adjusted sequence points in order to generate C0(t) corresponding to B0(t) and C1(t) corresponding to B1(t).
[0071] Among them, such as Figure 3 The upper and lower point sequences correspond to the original data sequences B0(t) and B1(t) mentioned above, respectively; the dashed lines between the upper and lower points connect the corresponding points. Figure 3 The various correspondences mentioned above are shown.
[0072] Calculate the cosine similarity D between C0(t) and C1(t). The cosine similarity D is the cosine of the angle between the two vectors. The cosine similarity of two vectors with the same direction is 1.
[0073]
[0074] Wherein the numerator is the inner product of two vectors, and the denominator is the product of the modulus of two vectors.
[0075] According to the value of D, whether the behavior characteristics such as the acceleration characteristics of movement of the same driver is determined. -3 When 1-D>θ, it is determined that the card swiping behavior of the driver is significantly different, and the driver and the card are not consistent in identity, otherwise, when 1-D≤θ, it is determined that the card and the driver are consistent in identity, and the card swiping authentication is passed.
[0076] Embodiment four:
[0077] The application further provides an RFID card identity authentication system based on WISP, wherein the system comprises a vehicle-mounted supervision terminal and a WISP-compatible RFID reader, and wherein:
[0078] The WISP-compatible RFID reader is configured to acquire the first identity information stored in the RFID card and the first WISP three-axis acceleration information of the card swiping person detected by the WISP acceleration sensor when the card swiping person swipes the card, and send the acquired first identity information and the first WISP three-axis acceleration information to the vehicle-mounted supervision terminal.
[0079] The vehicle-mounted supervision terminal is configured to receive the first identity information and the first WISP three-axis acceleration information sent by the WISP-compatible RFID reader, and compare the acquired first identity information and the first WISP three-axis acceleration information with the second identity information of the owner of the RFID card and the second WISP three-axis acceleration information when the card is swiped, which are collected and stored in advance; if the first identity information matches the second identity information and the first WISP three-axis acceleration information matches the second WISP three-axis acceleration information, it is determined that the card swiping person passes the card swiping identity authentication.
[0080] Embodiment five:
[0081] The application further provides a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to realize the steps of the method of the above-mentioned embodiments.
[0082] The modules / units integrated by the computer units, if realized in the form of software function units and sold or used as independent products, can be stored in a computer readable storage medium. Based on such understanding, all or part of the processes in the above-mentioned embodiment methods can also be completed by a computer program instructing related hardware, and the computer program can be stored in a computer readable storage medium. The computer program can realize the steps of each method embodiment when executed by a processor. The computer program includes computer program code, which can be in the form of source code, object code, executable files or some intermediate forms, etc. The computer readable medium can include any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM) and software distribution medium, etc. It should be noted that the content included in the computer readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction.
[0083] Embodiment six:
[0084] The application also provides a computer program product, comprising a computer program which, when executed by a processor, implements the steps of the method as described above.
[0085] Although the present application has been specifically shown and described with respect to preferred embodiments, it will be understood by those skilled in the art that various changes in form and details can be made therein without departing from the spirit and scope of the application as defined in the appended claims.
Claims
1. A WISP-based RFID card authentication method, characterized in that, The method includes the following steps: S1, when the cardholder of the RFID card swipes the card, the first identity information stored in the RFID card and the first WISP triaxial acceleration information detected by the WISP acceleration sensor when the cardholder swipes the card are obtained; S2, compare the acquired first identity information and first WISP triaxial acceleration information with the pre-collected and stored second identity information of the RFID card owner and the second WISP triaxial acceleration information at the time of card swiping; if the first identity information matches the second identity information and the first WISP triaxial acceleration information matches the second WISP triaxial acceleration information, then determine that the RFID card holder has passed the card swiping authentication.
2. The RFID card authentication method as described in claim 1, characterized in that, After collecting the second WISP triaxial acceleration information of the RFID card owner when swiping the card, the method further includes: performing a predetermined normalization process on the second WISP triaxial acceleration information to obtain and store the corresponding first normalized acceleration sequence B1(t); After obtaining the first WISP three-axis acceleration information when the cardholder swipes the card, the method further includes: The first WISP triaxial acceleration information is subjected to the predetermined normalization process to obtain and store the corresponding second normalized acceleration sequence B0(t); The dynamic time series matching algorithm (DTW) is used to perform dynamic sequence matching on B1(t) and B0(t) to obtain the matched one-to-one corresponding third acceleration sequence C1(t) and fourth acceleration sequence C0(t). Calculate the cosine similarity D between C0(t) and C1(t). When the cosine similarity meets a predetermined threshold condition, determine that the first WISP triaxial acceleration information matches the second WISP triaxial acceleration information.
3. The RFID card authentication method as described in claim 1, characterized in that, Normalization of the first WISP triaxial acceleration information or the second WISP triaxial acceleration information includes: Calculate the resultant acceleration A(t) of the corresponding triaxial accelerations based on the first WISP triaxial acceleration information or the second WISP triaxial acceleration information: Where t represents the current time, and ax(t), ay(t), and az(t) represent the acceleration data of the x, y, and z axes at the current time t, respectively. Based on the value of the resultant acceleration A(t), the normalized acceleration sequence B(t) is determined using the following formula, where B(t) includes either B1(t) or B0(t), where: Where Amin is the minimum A(t) value within the predetermined sampling time period, and Amax is the maximum A(t) value within the predetermined sampling time period.
4. The RFID card authentication method as described in claim 1, characterized in that, The steps of using the Dynamic Time Series (DTW) matching algorithm to dynamically match B1(t) and B0(t) to obtain the matched one-to-one corresponding third acceleration sequence C1(t) and fourth acceleration sequence C0(t) include: After performing dynamic sequence matching on B1(t) and B0(t) using the Dynamic Time Series (DTW) matching algorithm, the sequences are adjusted based on the correspondence between points in B0(t) and points in B1(t) after matching, wherein: (1) For any sequence point B0(t1) in B0(t) that satisfies that one point corresponds to multiple points in B1(t), calculate the first arithmetic mean of the data of all the corresponding B1(t) points. The first arithmetic mean corresponds to the value of the B0(t1) point in B0(t). (2) For the B1(t2) sequence points in B0(t) that satisfy multiple point pairs in B1(t) of a point in B1(t), calculate the second arithmetic mean of all data points in B0(t) corresponding to point B1(t2), and the second arithmetic mean corresponds to the value of point B1(t2) in B1(t); (3) For the sequence points in B0(t) and B1(t) that satisfy the one-to-one correspondence, retain the original one-to-one correspondence and do not process it; The sequence points obtained after the adjustment are arranged in order to generate C0(t) corresponding to B0(t) and C1(t) corresponding to B1(t).
5. The RFID card authentication method as described in claim 1, characterized in that, The first identity information and the first WISP triaxial acceleration information are obtained by using a WISP-compatible RFID reader.
6. A vehicle-mounted terminal, characterized in that, It includes a memory and a processor, the memory storing at least one program, the at least one program being executed by the processor to implement the steps of the WISP-based RFID card authentication method as described in any one of claims 1 to 5.
7. An RFID card authentication system based on WISP, characterized in that, The system includes an on-board monitoring terminal and a WISP-compatible RFID reader / writer, wherein: The WISP-compatible RFID reader is used to acquire the first identity information stored in the RFID card and the first WISP triaxial acceleration information detected by the WISP acceleration sensor when the cardholder swipes the RFID card, and to send the acquired first identity information and first WISP triaxial acceleration information to the vehicle monitoring terminal. The vehicle-mounted monitoring terminal is used to receive the first identity information and the first WISP triaxial acceleration information sent by the WISP-compatible RFID reader, and compare the acquired first identity information and the first WISP triaxial acceleration information with the second identity information of the RFID card owner and the second WISP triaxial acceleration information at the time of card swiping, which are pre-collected and stored; if the first identity information matches the second identity information and the first WISP triaxial acceleration information matches the second WISP triaxial acceleration information, then it is determined that the RFID card holder has passed the card swiping authentication.
8. A computer-readable storage medium, characterized in that, The storage medium stores at least one program, which is executed by a processor to implement the steps of the WISP-based RFID card authentication method as described in any one of claims 1 to 5.
9. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the steps of the WISP-based RFID card authentication method as described in any one of claims 1 to 5.