System for improving accurate analysis of litigation cases
By utilizing the login and upload/storage modules of the litigation case management platform, and employing QR code and mobile phone security number conversion technologies, the platform addresses the issue of privacy concerns regarding the application of laws, regulations, and litigation cases by non-professionals, thus achieving secure login and privacy protection for case content.
Patent Information
- Application Number
- CN202511307632.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2024-09-14
- Filing Date
- 2025-09-14
- Publication Date
- 2026-02-06
AI Technical Summary
Non-legal professionals often find it difficult to effectively apply laws and regulations to protect their rights, and the privacy of litigation case content is difficult to guarantee, posing a risk of leakage.
By utilizing the login and upload/storage modules of the litigation case management platform, and employing QR code and mobile phone number conversion technology, combined with pixel transformation and number system conversion, secure login and storage of mobile phone numbers are achieved, ensuring the security of case content.
It enables secure login for non-professionals and protects the privacy of case content, preventing platform data from being stolen and ensuring accurate analysis and privacy security of litigation cases.
Smart Images

Figure CN121479841A_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the technical field of information security, in particular to a litigation case precision analysis system. BACKGROUND
[0002] Individuals and various groups of organizations pay more and more attention to using legal weapons to protect their own rights and interests. However, due to the normative and rigorous nature of laws and regulations, non-law professionals are difficult to truly apply laws and regulations to maintain their own rights, and therefore hope to be able to obtain professional legal services from legal practitioners, especially the best team or individual of lawyers, so as to truly realize the use of laws to maintain and protect their own legal rights. In the process of maintaining legal rights and interests, the privacy of the case of the parties should be protected to prevent the leakage of the case content. SUMMARY
[0003] The present application aims at at least solving the technical problems existing in the prior art, and particularly innovatively provides a litigation case precision analysis system.
[0004] In order to achieve the above-mentioned purpose of the present application, the present application provides a litigation case precision analysis system, comprising a litigation case management platform login module and a litigation case uploading and storing module.
[0005] The litigation case management platform login module is used for logging into the litigation case management platform; the following steps are included in the litigation case management platform login module:
[0006] S1-1, judging whether a get information code trigger signal is received:
[0007] If the client (mobile phone) receives the get information code trigger signal, an eleven-digit mobile phone number input in the login interface is obtained;
[0008] If the client does not receive the get information code trigger signal, step S1-1 is executed;
[0009] S1-2, converting the mobile phone number obtained in step S1-1 into a mobile phone security number; the following steps are included in step S1-2:
[0010] S1-2-1, converting the mobile phone number obtained in step S1-1 into a binary mobile phone number;
[0011] S1-2-2, generating a QR two-dimensional code from the mobile phone number obtained in step S1-1;
[0012] S1-2-3, sequentially adding the binary mobile phone number from left to right and from top to bottom into the black dots of the QR two-dimensional code in the order from left to right; the last added black dot is taken as a stop position;
[0013] S1-2-4, cut the first row to the stop position row of the QR two-dimensional graphic code to obtain the cut two-dimensional graphic code;
[0014] S1-2-5, add a string of 0s and / or 1s to the white dots of the cut two-dimensional graphic code until the stop position; where the string of 0s and / or 1s can be a string of all 1s, a string of all 0s, or a string of 1s and 0s, for example 11010000100111011100001, the number of digits should be varied according to the actual situation.
[0015] S1-2-6: Obtain the numbers in the white and black dots in order from left to right and from top to bottom; this gives you the phone security number.
[0016] S1-2-7, clear all numbers from the cut 2D graphic code; obtain the cleared 2D graphic code;
[0017] S1-3, Upload the mobile security number and the cleared QR code to the litigation case management platform;
[0018] S1-4: After receiving the mobile security number and the clear QR code sent by the client, the litigation case management platform converts the mobile security number into a mobile phone number; step S1-4 includes the following steps:
[0019] S1-4-1, add the received mobile security number to the received clear QR code in order from left to right and from top to bottom;
[0020] S1-4-2, obtain the numbers in the black dots of the cleared two-dimensional graphic code in the order from left to right and from top to bottom; then you can get the platform's number string;
[0021] S1-4-3, convert the obtained platform number string into a decimal mobile phone number; this decimal mobile phone number is the mobile phone number; it also includes the following steps:
[0022] S1-4-4, Generate the mobile phone number from step S1-4-3 into a platform QR code;
[0023] S1-4-5, Obtain the platform row number in the received clear 2D graphic code;
[0024] S1-4-6, cut the first row to the platform row number in the platform QR two-dimensional graphic code to obtain the platform cut two-dimensional graphic code;
[0025] S1-4-7, Determine whether the platform's cut 2D graphic code matches the received clear 2D graphic code:
[0026] If the platform cut two-dimensional code is consistent with the received clear two-dimensional code, then the decimal mobile phone number in step S1-4-3 is the mobile phone number;
[0027] If the platform cut two-dimensional code is not consistent with the received clear two-dimensional code, there is an error; return to step S1-1;
[0028] S1-5, determine whether the mobile phone number in step S1-4 exists in the litigation case management platform:
[0029] If the mobile phone number does not exist in the litigation case management platform, store the mobile phone number in the litigation case management platform, and register the mobile phone number; execute the next step;
[0030] If the mobile phone number exists in the litigation case management platform, execute the next step;
[0031] S1-6, the litigation case management platform randomly generates a six-digit information code, sends the randomly generated information code to the mobile phone number, and forms a check pair with the mobile phone number and the randomly generated information code; the check pair exists for 5-10 minutes, and after the time period is exceeded, the information code in the check pair is deleted or the check pair is deleted.
[0032] S1-7, determine whether a login litigation case management platform trigger signal is received:
[0033] If the client receives a login litigation case management platform trigger signal, obtain the eleven-digit mobile phone number and the six-digit information code input in the login interface;
[0034] If the client does not receive a login litigation case management platform trigger signal, execute step S1-7 or S1-1;
[0035] S1-8, convert the mobile phone number obtained in step S1-7 to a mobile phone security number; in step S1-8, the following steps are included:
[0036] S1-8-1, convert the mobile phone number obtained in step S1-8 to a binary mobile phone number;
[0037] S1-8-2, generate a QR two-dimensional code for the mobile phone number obtained in step S1-8;
[0038] S1-8-3, sequentially add the binary mobile phone number to the black dots of the QR two-dimensional code from left to right and from top to bottom in order from left to right; the last added black dot is used as a stop position;
[0039] S1-8-4, cut the first row to the stop position row in the QR two-dimensional code to obtain a cut two-dimensional code;
[0040] S1-8-5, add a number string of 0 or / and 1 to the white points of the cut two-dimensional graphic code until the stop position; wherein the number string of 0 or / and 1 can be a number string of all 1s or a number string of all 0s or a number string of 1s and 0s combined, such as 11010000100111011100001, and the number of bits can be changed according to actual conditions.
[0041] S1-8-6, obtain the numbers in the white points and black points in the order from left to right and from top to bottom; that is, obtain the mobile phone security number;
[0042] S1-8-7, remove all the numbers in the cut two-dimensional graphic code; obtain the cleared two-dimensional graphic code;
[0043] S1-9, upload the mobile phone security number, the cleared two-dimensional graphic code and the information code to the litigation case management platform;
[0044] S1-10, after the litigation case management platform receives the mobile phone security number, the cleared two-dimensional graphic code and the information code sent by the client, convert the mobile phone security number into a mobile phone number; in step S1-10, the following steps are included:
[0045] S1-10-1, add the received mobile phone security number in the order from left to right to the received cleared two-dimensional graphic code in the order from left to right and from top to bottom;
[0046] S1-10-2, obtain the numbers in the black points of the cleared two-dimensional graphic code in the order from left to right and from top to bottom; that is, obtain the platform number string;
[0047] S1-10-3, convert the obtained platform number string into a decimal mobile phone number; the decimal mobile phone number is the mobile phone number; further including the following steps:
[0048] S1-10-4, generate the mobile phone number in step S1-10-3 into a platform QR two-dimensional graphic code;
[0049] S1-10-5, obtain the number of platform rows in the received cleared two-dimensional graphic code;
[0050] S1-10-6, cut the first row to the number of platform rows in the platform QR two-dimensional graphic code to obtain a platform cut two-dimensional graphic code;
[0051] S1-10-7, determine whether the platform cut two-dimensional graphic code is consistent with the received cleared two-dimensional graphic code:
[0052] If the platform cut two-dimensional graphic code is consistent with the received cleared two-dimensional graphic code, the decimal mobile phone number in step S1-10-3 is the mobile phone number.
[0053] If the platform cuts the two-dimensional graphic code and the received clear two-dimensional graphic code are inconsistent, there is an error; return to step S1-1;
[0054] S1-11, Using the mobile phone number from step S1-10, find the information code in the verification pair, and determine whether the information code obtained from the verification pair using the mobile phone number from step S1-10 is the same as the information code obtained in step S1-10:
[0055] If the information code in the verification pair obtained by searching the mobile phone number in step S1-10 is the same as the information code obtained in step S1-10, then the login to the litigation case management platform is successful; at this time, delete the information code in the verification pair or delete the verification pair.
[0056] Otherwise, logging into the litigation case management platform will fail. Proceed to step S1-7 or S1-1.
[0057] The litigation case upload and storage module is used to upload collected case images to the litigation case management platform for storage after logging in.
[0058] In a preferred embodiment of the present invention, step S1-2-2 is to generate a binary mobile phone number as a QR two-dimensional graphic code;
[0059] Step S1-4-3 consists of the following steps:
[0060] S1-4-3, Generate the platform digital string in step S1-4-2 into a platform QR two-dimensional graphic code;
[0061] S1-4-4, obtain the platform row number in the received clear 2D graphic code;
[0062] S1-4-5, cut the first row to the platform row number in the platform QR two-dimensional graphic code to obtain the platform cut two-dimensional graphic code;
[0063] S1-4-6, Determine whether the platform's cut 2D graphic code matches the received clear 2D graphic code:
[0064] If the platform cuts the two-dimensional graphic code and receives the clear two-dimensional graphic code, the obtained platform number string will be converted into a decimal mobile phone number; this decimal mobile phone number is the mobile phone number.
[0065] If the platform cuts the two-dimensional graphic code and the received clear two-dimensional graphic code are inconsistent, there is an error; return to step S1-1;
[0066] Step S1-8-2 involves generating a QR code from the binary mobile phone number obtained in step S1-8-1.
[0067] Step S1-10-3 consists of the following steps:
[0068] S1-10-3, Generate the platform digital string in step S1-10-2 into a platform QR two-dimensional graphic code;
[0069] S1-10-4, Obtain the platform row number in the received clear 2D graphic code;
[0070] S1-10-5, cut the first row to the platform row number in the platform QR two-dimensional graphic code to obtain the platform cut two-dimensional graphic code;
[0071] S1-10-6, Determine whether the platform's cut 2D graphic code matches the received clear 2D graphic code:
[0072] If the platform cuts the two-dimensional graphic code and receives the clear two-dimensional graphic code, the obtained platform number string will be converted into a decimal mobile phone number; this decimal mobile phone number is the mobile phone number.
[0073] If the platform cuts a 2D graphic code that is inconsistent with the received cleared 2D graphic code, an error exists; return to step S1-1; in a preferred embodiment of the present invention, the QR 2D graphic code in step S1-2-2 is transformed in position. The transformation can be a left-right mirror (symmetric) or a top-bottom mirror (symmetric), or a rotation of π / 2 or π or 3π / 2, or a combination thereof, such as first rotating π / 2 and then mirroring left-right, or first mirroring top-bottom and then rotating 3π / 2; the QR 2D graphic code after the transformation is the transformed QR 2D graphic code, let the transformed QR 2D graphic code be the QR 2D graphic code;
[0074] The position of the QR code in step S1-8-2 can also be changed;
[0075] In a preferred embodiment of the present invention, the black dots and white dots can be interchanged; for example:
[0076] S1-2-3, add the binary mobile phone number into the white dots of the QR code in a left-to-right and top-to-bottom order; the last white dot added is used as the stop position;
[0077] S1-2-5, add a string of numbers 0 and / or 1 to the black dots of the cut two-dimensional graphic code until the stop position;
[0078] S1-2-6: Obtain the numbers from the black and white dots in the order from left to right and from top to bottom; this gives you the phone security number.
[0079] S1-4-2, obtain the numbers in the cleared two-dimensional graphic code white dots in the order from left to right and top to bottom; then the platform number string can be obtained;
[0080] S1-8-3, add the binary mobile phone number into the white dots of the QR code in a left-to-right and top-to-bottom order; the last white dot added is used as the stop position;
[0081] S1-8-5, add a string of numbers 0 and / or 1 to the black dots of the cut two-dimensional graphic code until the stop position;
[0082] S1-8-6: Obtain the numbers from the black and white dots in the order from left to right and from top to bottom; this gives you the phone security number.
[0083] S1-10-2: Obtain the numbers in the cleared two-dimensional graphic code white dots in the order from left to right and from top to bottom; this will give you the platform's number string.
[0084] The same applies to the other steps;
[0085] In a preferred embodiment of the present invention, S1-2-6 involves obtaining the numbers from the white and black dots in a left-to-right, top-to-bottom order; that is, obtaining the mobile phone security number; and converting the mobile phone security number into... number system For positive integers greater than 10, we get The string in binary is the mobile phone security number.
[0086] S1-4-1 means that the received mobile security number is converted into binary and then added to the received clear QR code in a left-to-right and top-to-bottom order.
[0087] S1-8-6 involves obtaining the numbers from the white and black dots in a left-to-right, top-to-bottom order; this yields the mobile security number. The mobile security number is then converted... number system For positive integers greater than 10, we get The string in binary is the mobile phone security number.
[0088] S1-10-1 means that the received mobile security number is converted into binary and then added to the received clear QR code in a left-to-right and top-to-bottom order.
[0089] In a preferred embodiment of the present invention, S1-4-3 involves converting the obtained platform number string into a decimal mobile phone number; this decimal mobile phone number is the mobile phone number; and the mobile phone number is calculated using a pixel code calculation method. Second-rate:
[0090] ,
[0091] That is: ,
[0092] ,
[0093] ,
[0094] ,
[0095] ……,
[0096] ,when When taking 1, = ;
[0097] Indicates the first phone number; =1, 2, 3, ... ;
[0098] No. phone number It's a mobile phone number; you can use the first... The mobile phone number is converted to hexadecimal, decimal, or other bases, which shortens the number of digits. The mobile phone number stored through the above operation platform is not the eleven-digit mobile phone number entered, so even if the platform data is stolen, the security of the eleven-digit mobile phone number can be protected.
[0099] It can be the last digit of the mobile phone number, when When it is 0, let =10; Taking my own mobile phone number 139999999999 as an example:
[0100] ,
[0101] ,
[0102] ,
[0103] ,
[0104] ,
[0105] ,
[0106] ,
[0107] ,
[0108] .
[0109] Similarly, step S1-10-3 involves converting the obtained platform number string into a decimal mobile phone number; this decimal mobile phone number is the actual mobile phone number; the mobile phone number is then calculated using the pixel code calculation method. Second-rate.
[0110] The litigation case management platform login module is used to log in to the litigation case management platform; the login module includes the following steps:
[0111] S1-1, Determine if a trigger signal for obtaining the information code has been received:
[0112] If the client (mobile phone) receives a signal to obtain the information code, it will obtain the eleven-digit mobile phone number entered on the login page.
[0113] If the client does not receive the information acquisition code trigger signal, then proceed to step S1-1;
[0114] S1-2, convert the mobile phone number obtained in step S1-1 into a mobile security number; step S1-2 includes the following steps:
[0115] S1-2-1, Generate the mobile phone number obtained in step S1-1 into a QR code;
[0116] S1-2-2, add the number 0 to the white dot of the QR code and add the number 1 to the black dot of the QR code;
[0117] S1-2-3: Obtain the numbers from the white and black dots in the order from left to right and from top to bottom; this gives you the phone security number.
[0118] S1-3, Upload the mobile phone security number to the litigation case management platform;
[0119] S1-4: After receiving the mobile security number sent by the client, the litigation case management platform converts the mobile security number into a mobile number; step S1-4 includes the following steps:
[0120] S1-4-1, Get the number of digits in the received mobile security number;
[0121] S1-4-2, the square root of the number of digits in the mobile phone security number gives the number of horizontal and vertical pixels C:
[0122] C=c 1 / 2 Where c is the number of digits in the mobile security number, and C is the number of horizontal and vertical pixels;
[0123] S1-4-3 generates C×C pixels that are all black, based on the number of pixels in the horizontal and vertical directions, C.
[0124] S1-4-4, add the received mobile security number into the C×C pixel in order from left to right and from top to bottom;
[0125] S1-4-5, a pixel with 0 added to a C×C pixel area becomes a white pixel;
[0126] S1-4-6, clear the digits 0 and 1 in the C×C pixel points to obtain the two-dimensional graphic code of the mobile phone number;
[0127] S1-4-7, scan the QR code of the mobile phone number to get the mobile phone number;
[0128] S1-5, Determine if the mobile phone number in step S1-4 exists in the litigation case management platform:
[0129] If the mobile phone number does not exist in the litigation case management platform, then store the mobile phone number in the litigation case management platform and register the mobile phone number; proceed to the next step;
[0130] If the mobile phone number exists in the litigation case management platform, proceed to the next step;
[0131] S1-6, the litigation case management platform randomly generates a six-digit information code, sends the randomly generated information code to the mobile phone number, and forms a verification pair with the mobile phone number and the randomly generated information code; the verification pair exists for 5 minutes to 10 minutes, after which the information code in the verification pair or the verification pair is deleted.
[0132] S1-7, Determine if a login signal for the litigation case management platform has been received:
[0133] If the client receives a signal to log in to the litigation case management platform, it will retrieve the eleven-digit mobile phone number and six-digit information code entered on the login interface.
[0134] If the client does not receive a signal to log in to the litigation case management platform, proceed to step S1-7 or S1-1.
[0135] S1-8, convert the mobile phone number obtained in step S1-7 into a mobile security number; step S1-8 includes the following steps:
[0136] S1-8-1, Generate the mobile phone number obtained in step S1-1 into a QR two-dimensional graphic code;
[0137] S1-8-2, add the number 0 to the white dot of the QR code and add the number 1 to the black dot of the QR code;
[0138] S1-8-3: Obtain the numbers in the white and black dots in order from left to right and from top to bottom; this gives you the phone security number.
[0139] S1-9, Upload the mobile security number and information code to the litigation case management platform;
[0140] S1-10, After receiving the mobile security number and information code sent by the client, the litigation case management platform converts the mobile security number into a mobile phone number; step S1-10 includes the following steps:
[0141] S1-10-1, Get the number of digits in the received mobile security number;
[0142] S1-10-2, the square root of the number of digits in the mobile phone security number gives the number of horizontal and vertical pixels C:
[0143] C=c 1 / 2 Where c is the number of digits in the mobile security number, and C is the number of horizontal and vertical pixels;
[0144] S1-10-3 generates C×C black pixels based on the number of horizontal and vertical pixels C.
[0145] S1-10-4, add the received mobile security number into the C×C pixel in order from left to right and from top to bottom;
[0146] S1-10-5, adds 0 to a C×C pixel and turns it into a white pixel;
[0147] S1-10-6, clear the digits 0 and 1 in the C×C pixel points to obtain the two-dimensional graphic code of the mobile phone number;
[0148] S1-10-7, scan the QR code of the mobile phone number to get the mobile phone number;
[0149] S1-11, Using the mobile phone number from step S1-10, find the information code in the verification pair, and determine whether the information code obtained from the verification pair using the mobile phone number from step S1-10 is the same as the information code obtained in step S1-10:
[0150] If the information code in the verification pair obtained by searching the mobile phone number in step S1-10 is the same as the information code obtained in step S1-10, then the login to the litigation case management platform is successful; at this time, delete the information code in the verification pair or delete the verification pair.
[0151] Otherwise, logging into the litigation case management platform will fail. Proceed to step S1-7 or S1-1.
[0152] In a preferred embodiment of the present invention, step S1-2-1 is to convert the mobile phone number obtained in step S1-1 into a binary mobile phone number, and generate a QR code from the binary mobile phone number.
[0153] Step S1-4-7 involves scanning the two-dimensional graphic code of the mobile phone number to obtain the binary mobile phone number; then converting the binary mobile phone number into a decimal mobile phone number, which is the mobile phone number.
[0154] Step S1-8-1 involves converting the mobile phone number obtained in step S1-1 into a binary mobile phone number, and then generating a QR code from the binary mobile phone number.
[0155] Step S1-10-7 involves scanning the two-dimensional graphic code of the mobile phone number to obtain the binary mobile phone number; then converting the binary mobile phone number into a decimal mobile phone number, which is the mobile phone number.
[0156] In a preferred embodiment of the present invention, the QR two-dimensional graphic code in step S1-2-1 is transformed in position. The transformation can be a left-right mirror (symmetric) or a top-bottom mirror (symmetric), or a rotation of π / 2 or π or 3π / 2, or a combination thereof. For example, first rotate π and then mirror top-bottom, or first mirror left-right and then rotate π / 2. The QR two-dimensional graphic code after the transformation is called the transformed QR two-dimensional graphic code. Let the transformed QR two-dimensional graphic code be the QR two-dimensional graphic code.
[0157] The position of the QR code in step S1-8-2 can also be changed;
[0158] In a preferred embodiment of the present invention, 0 and 1 can be interchanged; for example:
[0159] S1-2-2, add the number 1 to the white dot of the QR code and add the number 0 to the black dot of the QR code;
[0160] S1-8-2, add the number 1 to the white dot of the QR code and add the number 0 to the black dot of the QR code;
[0161] In a preferred embodiment of the present invention, step S1-2-3 or / and step S1-8-3 can be from left to right or from top to bottom, or from top to bottom or from left to right; or from right to left or from top to bottom, etc., for a total of 8 variations;
[0162] In a preferred embodiment of the present invention, S1-2-3 involves obtaining the numbers from the white and black dots in a left-to-right, top-to-bottom order; that is, obtaining the mobile phone security number; and converting the mobile phone security number into... number system For positive integers greater than 10, we get The string in binary is the mobile phone security number.
[0163] S1-4-1 is to convert the received mobile security number into a binary mobile security number, which is the received mobile security number, and to obtain the number of digits of the received mobile security number;
[0164] S1-8-3 involves obtaining the numbers from the white and black dots in a left-to-right, top-to-bottom order; this yields the mobile security number. The mobile security number is then converted... number system For positive integers greater than 10, we get The string in binary is the mobile phone security number.
[0165] S1-10-1 is to convert the received mobile security number into a binary mobile security number, which is the received mobile security number, and to obtain the number of digits of the received mobile security number;
[0166] In a preferred embodiment of the present invention, S1-4-7 involves obtaining the mobile phone number by scanning the two-dimensional graphic code of the mobile phone number; and calculating the mobile phone number using a pixel code calculation method. Second-rate:
[0167] ,
[0168] That is: ,
[0169] ,
[0170] ,
[0171] ,
[0172] ……,
[0173] ,when When taking 1, = ;
[0174] Indicates the first phone number; =1, 2, 3, ... ;
[0175] No. phone number It's a mobile phone number; you can use the first... The mobile phone number is converted to hexadecimal, decimal, or other bases, which shortens the number of digits. The mobile phone number stored through the above operation platform is not the eleven-digit mobile phone number entered, so even if the platform data is stolen, the security of the eleven-digit mobile phone number can be protected.
[0176] It can be the last digit of the mobile phone number, when When it is 0, let =10; Taking my own mobile phone number 139999999999 as an example:
[0177] ,
[0178] ,
[0179] ,
[0180] ,
[0181] ,
[0182] ,
[0183] ,
[0184] ,
[0185] .
[0186] The same steps S1-10-7 are as follows: scan the two-dimensional graphic code of the mobile phone number to obtain the mobile phone number; calculate the mobile phone number using the pixel code calculation method. Second-rate.
[0187] The litigation case management platform login module is used to log in to the litigation case management platform; the login module includes the following steps:
[0188] S1-1, Determine if a trigger signal for obtaining the information code has been received:
[0189] If the client (mobile phone) receives a signal to obtain the information code, it will obtain the eleven-digit mobile phone number entered on the login page.
[0190] If the client does not receive the information acquisition code trigger signal, then proceed to step S1-1;
[0191] S1-2, convert the mobile phone number obtained in step S1-1 into a mobile security number; step S1-2 includes the following steps:
[0192] S1-2-1, Generate the mobile phone number obtained in step S1-1 into a QR code;
[0193] S1-2-2, add the number 0 to the white dot of the QR code and add the number 1 to the black dot of the QR code;
[0194] S1-2-3: Obtain the numbers from the white and black dots in the order from left to right and from top to bottom; this gives you the phone security number.
[0195] S1-3, Upload the mobile phone security number to the litigation case management platform;
[0196] S1-4: After receiving the mobile security number sent by the client, the litigation case management platform converts the mobile security number into a mobile number; step S1-4 includes the following steps:
[0197] S1-4-1, Get the number of digits in the received mobile security number;
[0198] S1-4-2, the square root of the number of digits in the mobile phone security number gives the number of horizontal and vertical pixels C:
[0199] C=c 1 / 2 Where c is the number of digits in the mobile security number, and C is the number of horizontal and vertical pixels;
[0200] S1-4-3 generates C×C pixels that are all black, based on the number of pixels in the horizontal and vertical directions, C.
[0201] S1-4-4, add the received mobile security number into the C×C pixel in order from left to right and from top to bottom;
[0202] S1-4-5, a pixel with 0 added to a C×C pixel area becomes a white pixel;
[0203] S1-4-6, clear the digits 0 and 1 in the C×C pixel points to obtain the two-dimensional graphic code of the mobile phone number;
[0204] S1-4-7, scan the QR code of the mobile phone number to get the mobile phone number;
[0205] S1-5, Determine if the mobile phone number in step S1-4 exists in the litigation case management platform:
[0206] If the mobile phone number does not exist in the litigation case management platform, then store the mobile phone number in the litigation case management platform and register the mobile phone number; proceed to the next step;
[0207] If the mobile phone number exists in the litigation case management platform, proceed to the next step;
[0208] S1-6, the litigation case management platform randomly generates a six-digit information code, sends the randomly generated information code to the mobile phone number, and forms a verification pair with the mobile phone number and the randomly generated information code; the verification pair exists for 5 minutes to 10 minutes, after which the information code in the verification pair or the verification pair is deleted.
[0209] S1-7, Determine if a login signal for the litigation case management platform has been received:
[0210] If the client receives a signal to log in to the litigation case management platform, it will retrieve the eleven-digit mobile phone number and six-digit information code entered on the login interface.
[0211] If the client does not receive a signal to log in to the litigation case management platform, proceed to step S1-7 or S1-1.
[0212] S1-8, convert the mobile phone number obtained in step S1-7 into a mobile security number; step S1-8 includes the following steps:
[0213] S1-8-1, Generate the mobile phone number obtained in step S1-1 into a QR two-dimensional graphic code;
[0214] S1-8-2, add the number 0 to the white dot of the QR code and add the number 1 to the black dot of the QR code;
[0215] S1-8-3: Obtain the numbers in the white and black dots in order from left to right and from top to bottom; this gives you the phone security number.
[0216] S1-9, Upload the mobile security number and information code to the litigation case management platform;
[0217] S1-10, After receiving the mobile security number and information code sent by the client, the litigation case management platform converts the mobile security number into a mobile phone number; step S1-10 includes the following steps:
[0218] S1-10-1, Get the number of digits in the received mobile security number;
[0219] S1-10-2, the square root of the number of digits in the mobile phone security number gives the number of horizontal and vertical pixels C:
[0220] C=c 1 / 2 Where c is the number of digits in the mobile security number, and C is the number of horizontal and vertical pixels;
[0221] S1-10-3 generates C×C black pixels based on the number of horizontal and vertical pixels C.
[0222] S1-10-4, add the received mobile security number into the C×C pixel in order from left to right and from top to bottom;
[0223] S1-10-5, adds 0 to a C×C pixel and turns it into a white pixel;
[0224] S1-10-6, clear the digits 0 and 1 in the C×C pixel points to obtain the two-dimensional graphic code of the mobile phone number;
[0225] S1-10-7, scan the QR code of the mobile phone number to get the mobile phone number;
[0226] S1-11, Using the mobile phone number from step S1-10, find the information code in the verification pair, and determine whether the information code obtained from the verification pair using the mobile phone number from step S1-10 is the same as the information code obtained in step S1-10:
[0227] If the information code in the verification pair obtained by searching the mobile phone number in step S1-10 is the same as the information code obtained in step S1-10, then the login to the litigation case management platform is successful; at this time, delete the information code in the verification pair or delete the verification pair.
[0228] Otherwise, logging into the litigation case management platform will fail. Proceed to step S1-7 or S1-1.
[0229] In a preferred embodiment of the present invention, the login module of the litigation case management platform is used to log in to the litigation case management platform using one's own mobile phone number and the information code received by the mobile phone number.
[0230] In a preferred embodiment of the present invention, the mobile phone number in the login module of the litigation case management platform is an eleven-digit mobile phone number.
[0231] In a preferred embodiment of the present invention, the mobile phone number in the login module of the litigation case management platform is composed of any combination of numeric characters 0 to 9, and the first digit is not 0.
[0232] In a preferred embodiment of the present invention, the information code in the login module of the litigation case management platform is a six-digit information code. Preferably, the first digit of the information code is not 0.
[0233] In a preferred embodiment of the present invention, the information code in the login module of the litigation case management platform is composed of any combination of numeric characters 0 to 9.
[0234] In a preferred embodiment of the present invention, the information code in the login module of the litigation case management platform is composed of any combination of lowercase characters a to z;
[0235] Alternatively, the information code in the login module of the litigation case management platform can be any combination of uppercase characters A to Z;
[0236] Alternatively, the information code in the login module of the litigation case management platform can be any combination of numeric characters 0-9 and lowercase characters a-z.
[0237] Alternatively, in the login module of the litigation case management platform, the information code can be any combination of numeric characters 0-9 and uppercase characters A-Z.
[0238] Alternatively, in the login module of the litigation case management platform, the information code can be any combination of numeric characters 0-9, lowercase characters a-z, and uppercase characters A-Z.
[0239] Alternatively, in the login module of the litigation case management platform, the information code can be any combination of lowercase characters a to z and uppercase characters A to Z.
[0240] In a preferred embodiment of the present invention, the case images collected in the litigation case upload and storage module are litigation case images taken with a mobile phone or / and litigation case images scanned with a scanner.
[0241] Alternatively, data can be uploaded to the litigation case management platform via 4G, 5G, or WiFi networks within the litigation case upload and storage module. Utilizing 4G, 5G, or WiFi networks enables efficient data uploads.
[0242] In a preferred embodiment of the present invention, the format of the case images in the litigation case upload and storage module is one of jpg, png, tif, bmp, webp or any combination thereof.
[0243] In a preferred embodiment of the present invention, in order to ensure the security of uploaded case images, the collected case images in the litigation case upload and storage module are subject to image confidentiality processing to achieve the security of image content.
[0244] In a preferred embodiment of the present invention, a litigation case query module is also included. The litigation case query module is used to view and download cases stored on the litigation case management platform. The module will perform image confidentiality processing on the case images to be downloaded to achieve the security of the image content.
[0245] In summary, by adopting the above technical solutions, this invention can securely log in to the security management platform and ensure the security of uploaded case content.
[0246] Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. Attached Figure Description
[0247] The above and / or additional aspects and advantages of the present invention will become apparent and readily understood from the description of the embodiments taken in conjunction with the following drawings, in which:
[0248] Figure 1 This is a schematic flowchart of the present invention.
[0249] Figure 2 This is a schematic diagram of the present invention.
[0250] Figure 3 This is a schematic diagram of the present invention.
[0251] Figure 4 This is a schematic diagram of the present invention.
[0252] Figure 5 This is a schematic diagram of the present invention.
[0253] Figure 6 This is a schematic diagram of the present invention.
[0254] Figure 7 This is a schematic diagram of the present invention.
[0255] Figure 8 This is a schematic diagram of the present invention.
[0256] Figure 9 This is a schematic diagram of the present invention.
[0257] Figure 10 This is a schematic diagram of the present invention.
[0258] Figure 11 This is a schematic diagram of the present invention.
[0259] Figure 12 This is a schematic diagram of the present invention.
[0260] Figure 13 This is a schematic diagram of the present invention. Detailed Implementation
[0261] Embodiments of the present invention are described in detail below. Examples of these embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and should not be construed as limiting the present invention.
[0262] This invention provides a system for improving the accuracy of litigation case analysis, such as... Figure 1 As shown, it includes a litigation case management platform login module and a litigation case upload and storage module;
[0263] The litigation case management platform login module is used to log in to the litigation case management platform;
[0264] The litigation case upload and storage module is used to upload collected case images to the litigation case management platform for storage after logging in.
[0265] In a preferred embodiment of the present invention, the login module of the litigation case management platform is used to log in to the litigation case management platform using one's own mobile phone number and the information code received by the mobile phone number.
[0266] In a preferred embodiment of the present invention, the mobile phone number in the login module of the litigation case management platform is an eleven-digit mobile phone number.
[0267] In a preferred embodiment of the present invention, the mobile phone number in the login module of the litigation case management platform is composed of any combination of numeric characters 0 to 9, and the first digit is not 0.
[0268] In a preferred embodiment of the present invention, the information code in the login module of the litigation case management platform is a six-digit information code.
[0269] In a preferred embodiment of the present invention, the information code in the login module of the litigation case management platform is composed of any combination of numeric characters 0 to 9.
[0270] In a preferred embodiment of the present invention, the information code in the login module of the litigation case management platform is composed of any combination of lowercase characters a to z;
[0271] Alternatively, the information code in the login module of the litigation case management platform can be any combination of uppercase characters A to Z;
[0272] Alternatively, the information code in the login module of the litigation case management platform can be any combination of numeric characters 0-9 and lowercase characters a-z.
[0273] Alternatively, in the login module of the litigation case management platform, the information code can be any combination of numeric characters 0-9 and uppercase characters A-Z.
[0274] Alternatively, in the login module of the litigation case management platform, the information code can be any combination of numeric characters 0-9, lowercase characters a-z, and uppercase characters A-Z.
[0275] Alternatively, in the login module of the litigation case management platform, the information code can be any combination of lowercase characters a to z and uppercase characters A to Z.
[0276] In a preferred embodiment of the present invention, the case images collected in the litigation case upload and storage module are litigation case images taken with a mobile phone or / and litigation case images scanned with a scanner.
[0277] Or / and upload the case to the litigation case management platform using a 4G, 5G, or WiFi network in the litigation case upload and storage module.
[0278] In a preferred embodiment of the present invention, the format of the case images in the litigation case upload and storage module is one of jpg, png, tif, bmp, webp or any combination thereof.
[0279] In a preferred embodiment of the present invention, in order to ensure the security of uploaded case images, the collected case images in the litigation case upload and storage module are subject to image confidentiality processing to achieve the security of image content.
[0280] In a preferred embodiment of the present invention, the method for logging into the litigation case management platform in the litigation case management platform login module includes the following steps:
[0281] S1-1, Determine if a trigger signal for obtaining the information code has been received:
[0282] If the client (mobile phone) receives a signal to obtain the information code, it will obtain the eleven-digit mobile phone number entered on the login page.
[0283] If the client does not receive the information acquisition code trigger signal, then proceed to step S1-1;
[0284] S1-2, Convert the mobile phone number obtained in step S1-1 into a mobile security number;
[0285] S1-3, Upload the mobile phone security number to the litigation case management platform;
[0286] S1-4, After receiving the mobile security number sent by the client, the litigation case management platform converts the mobile security number into a mobile number;
[0287] S1-5, Determine if the mobile phone number in step S1-4 exists in the litigation case management platform:
[0288] If the mobile phone number does not exist in the litigation case management platform, then store the mobile phone number in the litigation case management platform and register the mobile phone number; proceed to the next step;
[0289] If the mobile phone number exists in the litigation case management platform, proceed to the next step;
[0290] S1-6, the litigation case management platform randomly generates a six-digit information code, sends the randomly generated information code to the mobile phone number, and forms a verification pair with the mobile phone number and the randomly generated information code; the verification pair exists for 5 minutes to 10 minutes, after which the information code in the verification pair or the verification pair is deleted.
[0291] S1-7, Determine if a login signal for the litigation case management platform has been received:
[0292] If the client receives a signal to log in to the litigation case management platform, it will retrieve the eleven-digit mobile phone number and six-digit information code entered on the login interface.
[0293] If the client does not receive a signal to log in to the litigation case management platform, proceed to step S1-7 or S1-1.
[0294] S1-8, convert the mobile phone number obtained in step S1-7 into a mobile security number; and convert the information code obtained in step S1-7 into an information security code;
[0295] S1-9, Upload the mobile security number and information security code from step S1-8 to the litigation case management platform;
[0296] S1-10, After receiving the mobile security number and information security code, the litigation case management platform converts the mobile security number into a mobile number and the information security code into an information code;
[0297] S1-11, Using the mobile phone number from step S1-10, find the information code in the verification pair, and determine whether the information code obtained from the verification pair using the mobile phone number from step S1-10 is the same as the information code obtained in step S1-10:
[0298] If the information code in the verification pair obtained by searching the mobile phone number in step S1-10 is the same as the information code obtained in step S1-10, then the login to the litigation case management platform is successful; at this time, delete the information code in the verification pair or delete the verification pair.
[0299] Otherwise, logging into the litigation case management platform will fail. Proceed to step S1-7 or S1-1.
[0300] In a preferred embodiment of the present invention, the method for converting the mobile phone number obtained in step S1-1 into a mobile phone security number in step S1-2 is as follows:
[0301] S1-2-1, Treat the mobile phone number obtained in step S1-1 as a decimal number; define the character and numerical value representations as shown in Table 1.
[0302] Table 1 Character and Numeric Representations
[0303]
[0304] S1-2-2 converts a decimal mobile phone number to binary to obtain a binary mobile phone number;
[0305] S1-2-3, Count the number of digits in a binary mobile phone number, and match binary mobile phone numbers with the same number of digits. Calculate to obtain a new binary string;
[0306] S1-2-4, convert the new binary string to... number system For positive integers greater than 10, we get The string in binary is the mobile phone security number.
[0307] In a preferred embodiment of the present invention, in steps S1-2-3 It is a binary string with the first bit set to 1 and the rest set to 0.
[0308] In a preferred embodiment of the present invention, the method for obtaining the new binary string in step S1-2-3 is as follows:
[0309] ,
[0310] That is, if and ,or and hour, ;
[0311] if ,or hour, ;
[0312] in, This represents the first character in the new binary string. Bit character; =1, 2, 3, ... , The number of bits in a binary mobile phone number;
[0313] This represents the first digit in a binary mobile phone number. Bit character;
[0314] Represents the first character in a binary string. Bit character;
[0315] ,
[0316] Represents a new binary string;
[0317] This represents the first character in the new binary string;
[0318] This represents the second character in the new binary string;
[0319] This represents the 3rd character in the new binary string;
[0320] This represents the first character in the new binary string. Bit character; The number of bits in a binary mobile phone number;
[0321] In a preferred embodiment of the present invention, the method for converting the mobile security number into a mobile phone number in steps S1-4 is as follows:
[0322] S1-4-1 converts the mobile security number to a binary mobile security number;
[0323] S1-4-2, Count the number of digits in the binary mobile security number, and match the binary mobile security number with the same number of digits. Calculate to obtain a new binary string;
[0324] S1-4-3 converts the new binary string to decimal, and the resulting decimal string is the phone number.
[0325] In a preferred embodiment of the present invention, in step S1-4-2 It is a binary string with the first bit set to 1 and the rest set to 0.
[0326] In a preferred embodiment of the present invention, the method for obtaining the new binary string in step S1-4-2 is as follows:
[0327] ,
[0328] That is, if and ,or and hour, ;
[0329] if ,or hour, ;
[0330] in, This represents the first character in the new binary string. Bit character; =1, 2, 3, ... , Indicates the number of digits in a binary mobile phone security number;
[0331] This represents the first digit in the binary mobile phone security number. Bit character;
[0332] Represents the first character in a binary string. Bit character;
[0333] ,
[0334] Represents a new binary string;
[0335] This represents the first character in the new binary string;
[0336] This represents the second character in the new binary string;
[0337] This represents the 3rd character in the new binary string;
[0338] This represents the first character in the new binary string. Bit character; Indicates the number of digits in a binary mobile phone security number;
[0339] In a preferred embodiment of the present invention, the method for converting the mobile phone number obtained in steps S1-7 into a mobile phone security number in steps S1-8 is as follows:
[0340] S1-8-1, Treat the mobile phone number obtained in step S1-7 as a decimal number;
[0341] S1-8-2 converts a decimal mobile phone number to binary to obtain a binary mobile phone number;
[0342] S1-8-3, Count the number of digits in a binary mobile phone number, and match binary mobile phone numbers with the same number of digits. Calculate to obtain a new binary string;
[0343] S1-8-4, convert the new binary string to... number system For positive integers greater than 10, we get The string in binary is the mobile phone security number.
[0344] In a preferred embodiment of the present invention, in step S1-8-3 It is a binary string with the first bit set to 1 and the rest set to 0.
[0345] In a preferred embodiment of the present invention, the method for obtaining the new binary string in step S1-8-3 is as follows:
[0346] ,
[0347] That is, if and ,or and hour, ;
[0348] if ,or hour, ;
[0349] in, This represents the first character in the new binary string. Bit character; =1, 2, 3, ... , The number of bits in a binary mobile phone number;
[0350] This represents the first digit in a binary mobile phone number. Bit character;
[0351] Represents the first character in a binary string. Bit character;
[0352] ,
[0353] Represents a new binary string;
[0354] This represents the first character in the new binary string;
[0355] This represents the second character in the new binary string;
[0356] This represents the 3rd character in the new binary string;
[0357] This represents the first character in the new binary string. Bit character; The number of bits in a binary mobile phone number;
[0358] In a preferred embodiment of the present invention, the method for converting the information code obtained in steps S1-7 into an information security code in steps S1-8 is as follows:
[0359] S1-8-1, Treat the information code obtained in step S1-7 as decimal; at this time, the information code only contains the numeric characters 0-9. If the information code contains one of the uppercase characters A-Z or the lowercase characters a-z, treat the information code as hexadecimal. It is best to use a positive integer greater than 62.
[0360] S1-8-2 converts the decimal information code into binary to obtain the binary information code;
[0361] S1-8-3, Count the number of bits in the binary information code, and match the binary information codes with the same number of bits. Calculate to obtain a new binary information code string;
[0362] S1-8-4, convert the new binary information code string to... number system For positive integers greater than 10, we get The string in the binary system is the information security code.
[0363] In a preferred embodiment of the present invention, in step S1-8-3 It is a binary string with the first bit set to 1 and the rest set to 0.
[0364] In a preferred embodiment of the present invention, the method for obtaining the new binary information code string in step S1-8-3 is as follows:
[0365] ,
[0366] That is, if and ,or and hour, ;
[0367] if ,or hour, ;
[0368] in, This represents the first character in the new binary information code string. Bit character; =1, 2, 3, ... , The number of bits representing the binary information code;
[0369] The first character in the binary information code Bit character;
[0370] Represents the first character in a binary string. Bit character;
[0371] ,
[0372] This represents a new binary information code string;
[0373] This represents the first character in the new binary information code string;
[0374] This represents the second character in the new binary information code string;
[0375] This represents the 3rd character in the new binary information code string;
[0376] This represents the first character in the new binary information code string. Bit character; The number of bits representing the binary information code;
[0377] In a preferred embodiment of the present invention, the method for converting the mobile security number into a mobile phone number in steps S1-10 is as follows:
[0378] S1-10-1 converts the mobile security number into a binary mobile security number;
[0379] S1-10-2, Count the number of digits in the binary mobile security number, and match the binary mobile security number with the same number of digits. Calculate to obtain a new binary string;
[0380] S1-10-3 converts the new binary string to decimal, and the resulting decimal string is the phone number.
[0381] In a preferred embodiment of the present invention, in step S1-10-2 It is a binary string with the first bit set to 1 and the rest set to 0.
[0382] In a preferred embodiment of the present invention, the method for obtaining the new binary string in step S1-10-2 is as follows:
[0383] ,
[0384] That is, if and ,or and hour, ;
[0385] if ,or hour, ;
[0386] in, This represents the first character in the new binary string. Bit character; =1, 2, 3, ... , Indicates the number of digits in a binary mobile phone security number;
[0387] This represents the first digit in the binary mobile phone security number. Bit character;
[0388] Represents the first character in a binary string. Bit character;
[0389] ,
[0390] Represents a new binary string;
[0391] This represents the first character in the new binary string;
[0392] This represents the second character in the new binary string;
[0393] This represents the 3rd character in the new binary string;
[0394] This represents the first character in the new binary string. Bit character; Indicates the number of digits in a binary mobile phone security number;
[0395] In a preferred embodiment of the present invention, the method for converting the information security code into an information code in steps S1-10 is as follows:
[0396] S1-8-1 converts the information security code into binary to obtain the binary information security code;
[0397] S1-8-2, Count the number of bits in the binary information security code, and match the binary information security codes with the same number of bits. Calculate to obtain a new binary information security code string;
[0398] S1-8-3 converts the new binary information security code string into decimal, and the resulting decimal string is the information code.
[0399] In a preferred embodiment of the present invention, in step S1-8-2 It is a binary string with the first bit set to 1 and the rest set to 0.
[0400] In a preferred embodiment of the present invention, the method for obtaining the new binary information security code string in step S1-8-2 is as follows:
[0401] ,
[0402] That is, if and ,or and hour, ;
[0403] if ,or hour, ;
[0404] in, This represents the first character in the new binary information security code string. Bit character; =1, 2, 3, ... , The number of bits representing the binary information security code;
[0405] Represents the first in the binary information security code Bit character;
[0406] Represents the first character in a binary string. Bit character;
[0407] ,
[0408] This represents a new binary information security code string;
[0409] This represents the first character in the new binary information security code string;
[0410] This represents the second character in the new binary information security code string;
[0411] This represents the third character in the new binary information security code string;
[0412] This represents the first character in the new binary information security code string. Bit character; The number of bits representing the binary information security code;
[0413] It should be noted that the method for converting the mobile phone number to a mobile security number in step S1-2 is exactly the same as the method for converting the mobile phone number to a mobile security number in step S1-8 and the method for converting the information code to an information security code in step S1-8. This is the encryption process for the mobile phone number and the information code.
[0414] The method for converting the mobile security number to a mobile number in steps S1-4 is exactly the same as the method for converting the mobile security number to a mobile number in steps S1-10 and the method for converting the information security code to an information code in steps S1-10. This is the decryption process for the mobile number and the information code. The decryption process is the reverse operation of the encryption process.
[0415] For example, your mobile phone number is 13999999999, but there is no mobile phone number 13999999999 on the litigation case management platform.
[0416] First, enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login page;
[0417] The second step is that after clicking the "Get Information Code" virtual button on the login interface, the client receives the information code trigger signal and retrieves the eleven-digit mobile phone number 13999999999 entered on the login interface.
[0418] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0419] The fourth step is to generate a QR code for the mobile phone number 13999999999, as shown below. Figure 2 As shown;
[0420] Step 5: Add the binary mobile phone number 1101000010011101110000101111111111 to the black dots of the QR code in a left-to-right, top-to-bottom order; for example... Figure 3 As shown; the last black dot added is taken as the stopping position, which is the red position, as shown. Figure 4 As shown;
[0421] Step 6: Cut the QR code from row 1 to the stop position to obtain the cut QR code; for example... Figure 10 As shown;
[0422] Step 7: Add the number 1 to the white dot of the cut 2D graphic code until the stop position is reached; for example...Figure 6 As shown;
[0423] Step 8: Obtain the numbers from the white and black dots in the order from left to right and from top to bottom; that is, obtain the mobile security number 11010001101101011101111111101000111011111111111111111111111;
[0424] Step 9: Clear all numbers from the cut 2D graphic code; resulting in a cleared 2D graphic code; for example... Figure 5 As shown;
[0425] Step 10: Transfer the phone's security number 1101000110110111011111111010001110111111111111111111111111 and... Figure 5 The QR code shown is uploaded to the litigation case management platform;
[0426] Step 11: The litigation case management platform receives the mobile security number 110100011011011101111111101000111011111111111111111111111 and such from the client. Figure 5 After clearing the QR code as shown, add the received mobile security number 11010001101101110111111110100011101111111111111111111111111 in a left-to-right, top-to-bottom order to the received QR code; for example... Figure 7 As shown;
[0427] Step 12: Obtain the numbers from the black dots of the cleared two-dimensional graphic code in the order from left to right and top to bottom; this will give you the platform number string 1101000010011101110000101111111111;
[0428] Step 13: Convert the obtained platform number string 1101000010011101110000101111111111 into a decimal mobile phone number 13999999999; this decimal mobile phone number 13999999999 is the mobile phone number 13999999999.
[0429] Step 14: Since the mobile phone number 13999999999 does not exist in the litigation case management platform, the mobile phone number 13999999999 is stored in the litigation case management platform, and the registration of the mobile phone number 13999999999 is completed.
[0430] Step 15: The litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (13999999999, 240903) with the mobile phone number 13999999999 and the randomly generated information code 240903.
[0431] Step 16: Enter the six-digit information code 240903 in the information code input box on the login screen;
[0432] Step 17: When you click the "Login" virtual button on the login screen, the client receives a login trigger signal and retrieves the eleven-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login screen.
[0433] Step 18: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0434] Step 19: Generate a QR code for the mobile phone number 13999999999, as follows: Figure 2 As shown;
[0435] Step 20: Add the binary mobile phone number 1101000010011101110000101111111111 to the black dots of the QR code in a left-to-right, top-to-bottom order; for example... Figure 3 As shown; the last black dot added is taken as the stopping position, which is the red position, as shown. Figure 4 As shown;
[0436] Step 21: Cut the first row to the stop position row of the QR code to obtain the cut QR code.
[0437] Step 22: Add the number 1 to the white dot of the cut 2D graphic code until the stop position is reached; for example... Figure 6 As shown;
[0438] Step 23: Obtain the numbers in the white and black dots in the order from left to right and from top to bottom; that is, obtain the mobile phone security number 11010001101101011101111111101000111011111111111111111111111;
[0439] Step 24: Clear all numbers from the cut 2D graphic code; obtain the cleared 2D graphic code; for example... Figure 5 As shown;
[0440] Step 25: Transfer the mobile security number 110100011011011101111111101000111011111111111111111111111 and... Figure 5 The QR code shown is uploaded to the litigation case management platform;
[0441] Step 26: The litigation case management platform receives the mobile security number 110100011011011101111111101000111011111111111111111111111 and such from the client. Figure 5 After clearing the QR code as shown, add the received mobile security number 11010001101101110111111110100011101111111111111111111111111 in a left-to-right, top-to-bottom order to the received QR code; for example... Figure 7 As shown;
[0442] Step 27: Obtain the numbers from the black dots of the cleared two-dimensional graphic code in the order from left to right and from top to bottom; this will give you the platform number string 1101000010011101110000101111111111;
[0443] Step 28: Convert the obtained platform number string 1101000010011101110000101111111111 into a decimal mobile phone number 13999999999; this decimal mobile phone number 13999999999 is the mobile phone number 13999999999.
[0444] Step 29: Search for information code 240903 in the verification pair (13999999999, 240903) using the mobile phone number 13999999999. Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character representation of the mobile phone number and SMS code in the above method, the security of the mobile phone number and SMS code is ensured.
[0445] For example, if your mobile phone number is 13999999999, it will be recorded on the litigation case management platform.
[0446] First, enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login page;
[0447] The second step is that after clicking the "Get Information Code" virtual button on the login interface, the client receives the information code trigger signal and retrieves the eleven-digit mobile phone number 13999999999 entered on the login interface.
[0448] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0449] The fourth step is to generate a QR code for the mobile phone number 13999999999, as shown below. Figure 2 As shown;
[0450] Step 5: Add the binary mobile phone number 1101000010011101110000101111111111 to the black dots of the QR code in a left-to-right, top-to-bottom order; for example... Figure 3 As shown; the last black dot added is taken as the stopping position, which is the red position, as shown. Figure 4 As shown;
[0451] Step 6: Cut the first row to the stop position row of the QR code to obtain the cut QR code.
[0452] Step 7: Add the number 1 to the white dot of the cut 2D graphic code until the stop position is reached; for example... Figure 6 As shown;
[0453] Step 8: Obtain the numbers from the white and black dots in the order from left to right and from top to bottom; that is, obtain the mobile security number 11010001101101011101111111101000111011111111111111111111111;
[0454] Step 9: Clear all numbers from the cut 2D graphic code; resulting in a cleared 2D graphic code; for example... Figure 5 As shown;
[0455] Step 10: Transfer the phone's security number 1101000110110111011111111010001110111111111111111111111111 and... Figure 5 The QR code shown is uploaded to the litigation case management platform;
[0456] Step 11: The litigation case management platform receives the mobile security number 110100011011011101111111101000111011111111111111111111111 and such from the client.Figure 5 After clearing the QR code as shown, add the received mobile security number 11010001101101110111111110100011101111111111111111111111111 in a left-to-right, top-to-bottom order to the received QR code; for example... Figure 7 As shown;
[0457] Step 12: Obtain the numbers from the black dots of the cleared two-dimensional graphic code in the order from left to right and top to bottom; this will give you the platform number string 1101000010011101110000101111111111;
[0458] Step 13: Convert the obtained platform number string 1101000010011101110000101111111111 into a decimal mobile phone number 13999999999; this decimal mobile phone number 13999999999 is the mobile phone number 13999999999.
[0459] Step 14: Since the mobile phone number 13999999999 exists in the litigation case management platform, the litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (13999999999, 240903) with the mobile phone number 13999999999 and the randomly generated information code 240903.
[0460] Step 15: Enter the six-digit information code 240903 in the information code input box on the login screen;
[0461] Step 16: When you click the "Login" virtual button on the login screen, the client receives a login trigger signal and retrieves the eleven-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login screen.
[0462] Step 17: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0463] Step 18: Generate a QR code for the mobile phone number 13999999999, as follows: Figure 2 As shown;
[0464] Step 19: Add the binary mobile phone number 1101000010011101110000101111111111 to the black dots of the QR code in a left-to-right, top-to-bottom order; for example... Figure 3 As shown; the last black dot added is taken as the stopping position, which is the red position, as shown. Figure 4 As shown;
[0465] Step 20: Cut the first row to the stop position row of the QR code to obtain the cut QR code.
[0466] Step 21: Add the number 1 to the white dot of the cut 2D graphic code until the stop position is reached; for example... Figure 8 As shown;
[0467] Step 22: Obtain the numbers in the white and black dots in the order from left to right and from top to bottom; that is, obtain the mobile phone security number 11010001101101011101111111101000111011111111111111111111111;
[0468] Step 23: Clear all numbers from the cut 2D graphic code; obtain the cleared 2D graphic code; for example... Figure 5 As shown;
[0469] Step 24: Transfer the mobile security number 110100011011011101111111101000111011111111111111111111111 and... Figure 5 The QR code shown is uploaded to the litigation case management platform;
[0470] Step 25: The litigation case management platform receives the mobile security number 110100011011011101111111101000111011111111111111111111111 and such from the client. Figure 5 After clearing the QR code as shown, add the received mobile security number 11010001101101110111111110100011101111111111111111111111111 in a left-to-right, top-to-bottom order to the received QR code; for example... Figure 2 As shown;
[0471] Step 26: Obtain the numbers from the black dots of the cleared two-dimensional graphic code in the order from left to right and from top to bottom; this will give you the platform number string 1101000010011101110000101111111111;
[0472] Step 27: Convert the obtained platform number string 1101000010011101110000101111111111 into a decimal mobile phone number 13999999999; this decimal mobile phone number 13999999999 is the mobile phone number 13999999999.
[0473] Step 28: Search for information code 240903 in the verification pair (13999999999, 240903) using the mobile phone number 13999999999. Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character representation of the mobile phone number and SMS code in the above method, the security of the mobile phone number and SMS code is ensured.
[0474] For example, if your mobile phone number is 13999999999, it will be recorded on the litigation case management platform.
[0475] First, enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login page;
[0476] The second step is that after clicking the "Get Information Code" virtual button on the login interface, the client receives the information code trigger signal and retrieves the eleven-digit mobile phone number 13999999999 entered on the login interface.
[0477] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0478] The fourth step is to generate a QR code for the mobile phone number 13999999999, as shown below. Figure 3 As shown;
[0479] Step 5: Add the binary mobile phone number 1101000010011101110000101111111111 to the black dots of the QR code in a left-to-right, top-to-bottom order; for example... Figure 4 As shown; the last black dot added is taken as the stopping position, which is the red position, as shown. Figure 8 As shown;
[0480] Step 6: Cut the first row to the stop position row of the QR code to obtain the cut QR code.
[0481] Step 7: Add a string of 0s to the white dots of the cut 2D graphic code until the stop position is reached; for example... Figure 5 As shown;
[0482] Step 8: Obtain the numbers in the white and black dots in the order from left to right and from top to bottom; that is, obtain the mobile security number 11010000000100011101110000000000010000000110111010110101001.
[0483] Step 9: Clear all numbers from the cut 2D graphic code; resulting in a cleared 2D graphic code; for example... Figure 5 As shown;
[0484] Step 10: Transfer the mobile security number 11010000000100011101110000000000010000000110111010110101001 and... Figure 5 The QR code shown is uploaded to the litigation case management platform;
[0485] Step 11: The litigation case management platform receives the mobile security number 11010000000100011101110000000000010000000110111010110101001 from the client and... Figure 2 After clearing the QR code as shown, add the received mobile security number 11010000000100011101110000000000010000000110111010110101001 to the received QR code in order from left to right and from top to bottom.
[0486] Step 12: Obtain the numbers from the black dots of the cleared two-dimensional graphic code in the order from left to right and top to bottom; this will give you the platform number string 1101000010011101110000101111111111;
[0487] Step 13: Convert the obtained platform number string 1101000010011101110000101111111111 into a decimal mobile phone number 13999999999; this decimal mobile phone number 13999999999 is the mobile phone number 13999999999.
[0488] Step 14: Since the mobile phone number 13999999999 exists in the litigation case management platform, the litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (13999999999, 240903) with the mobile phone number 13999999999 and the randomly generated information code 240903.
[0489] Step 15: Enter the six-digit information code 240903 in the information code input box on the login screen;
[0490] Step 16: When you click the "Login" virtual button on the login screen, the client receives a login trigger signal and retrieves the eleven-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login screen.
[0491] Step 17: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0492] Step 18: Generate a QR code for the mobile phone number 13999999999, as follows: Figure 3 As shown;
[0493] Step 19: Add the binary mobile phone number 1101000010011101110000101111111111 to the black dots of the QR code in a left-to-right, top-to-bottom order; for example... Figure 4 As shown; the last black dot added is taken as the stopping position, which is the red position, as shown. Figure 9 As shown;
[0494] Step 20: Cut the first row to the stop position row of the QR code to obtain the cut QR code.
[0495] Step 21: Add a string of 0s to the white dots of the cut 2D graphic code until the stop position is reached; for example... Figure 5 As shown;
[0496] Step 22: Obtain the numbers in the white and black dots in the order from left to right and from top to bottom; that is, obtain the mobile security number 11010000000100011101110000000000010000000110111010110101001.
[0497] Step 23: Clear all numbers from the cut 2D graphic code; obtain the cleared 2D graphic code; for example... Figure 5As shown;
[0498] Step 24: Transfer the mobile security number 11010000000100011101110000000000010000000110111010110101001 and... Figure 5 The QR code shown is uploaded to the litigation case management platform;
[0499] Step 25: The litigation case management platform receives the mobile security number 1101000000010001110111000000000001000000110111010110101001 from the client and... Figure 2 After clearing the QR code as shown, add the received mobile security number 11010000000100011101110000000000010000000110111010110101001 to the received QR code in order from left to right and from top to bottom.
[0500] Step 26: Obtain the numbers from the black dots of the cleared two-dimensional graphic code in the order from left to right and from top to bottom; this will give you the platform number string 1101000010011101110000101111111111;
[0501] Step 27: Convert the obtained platform number string 1101000010011101110000101111111111 into a decimal mobile phone number 13999999999; this decimal mobile phone number 13999999999 is the mobile phone number 13999999999.
[0502] Step 28: Search for information code 240903 in the verification pair (13999999999, 240903) using the mobile phone number 13999999999. Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character representation of the mobile phone number and SMS code in the above method, the security of the mobile phone number and SMS code is ensured.
[0503] For example, if your mobile phone number is 13999999999, it will be recorded on the litigation case management platform.
[0504] First, enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login page;
[0505] The second step is that after clicking the "Get Information Code" virtual button on the login interface, the client receives the information code trigger signal and retrieves the eleven-digit mobile phone number 13999999999 entered on the login interface.
[0506] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0507] The fourth step is to generate a QR code for the mobile phone number 13999999999, as shown below. Figure 3 As shown;
[0508] Step 5: Add the binary mobile phone number 1101000010011101110000101111111111 to the black dots of the QR code in a left-to-right, top-to-bottom order; for example... Figure 4 As shown; the last black dot added is taken as the stopping position, which is the red position, as shown. Figure 9 As shown;
[0509] Step 6: Cut the first row to the stop position row of the QR code to obtain the cut QR code.
[0510] Step 7: Add the number string 11010000100111011100001 to the white dots of the cut 2D graphic code until the stop position is reached; for example... Figure 5 As shown;
[0511] Step 8: Obtain the numbers in the white and black dots in the order from left to right and from top to bottom; that is, obtain the mobile security number 110100011001010111011100001000000110110111111110101101011;
[0512] Step 9: Clear all numbers from the cut 2D graphic code; resulting in a cleared 2D graphic code; for example... Figure 5 As shown;
[0513] Step 10: Transfer the phone's security number 110100011001010111011100001000000110110111111110101101011 and... Figure 5 The QR code shown is uploaded to the litigation case management platform;
[0514] Step 11: The litigation case management platform receives the mobile security number 110100011001010111011100001000000110110111111110101101011 and such from the client. Figure 2 After clearing the QR code as shown, add the received mobile security number 110100011001010111011100001000000110110111111110101101011 to the received QR code in order from left to right and from top to bottom.
[0515] Step 12: Obtain the numbers from the black dots of the cleared two-dimensional graphic code in the order from left to right and top to bottom; this will give you the platform number string 1101000010011101110000101111111111;
[0516] Step 13: Convert the obtained platform number string 1101000010011101110000101111111111 into a decimal mobile phone number 13999999999; this decimal mobile phone number 13999999999 is the mobile phone number 13999999999.
[0517] Step 14: Since the mobile phone number 13999999999 exists in the litigation case management platform, the litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (13999999999, 240903) with the mobile phone number 13999999999 and the randomly generated information code 240903.
[0518] Step 15: Enter the six-digit information code 240903 in the information code input box on the login screen;
[0519] Step 16: When you click the "Login" virtual button on the login screen, the client receives a login trigger signal and retrieves the eleven-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login screen.
[0520] Step 17: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0521] Step 18: Generate a QR code for the mobile phone number 13999999999, as follows: Figure 2 As shown;
[0522] Step 19: Add the binary mobile phone number 1101000010011101110000101111111111 to the black dots of the QR code in a left-to-right, top-to-bottom order; for example... Figure 13 As shown; the last black dot added is taken as the stopping position, which is the red position, as shown. Figure 11 As shown;
[0523] Step 20: Cut the first row to the stop position row of the QR code to obtain the cut QR code.
[0524] Step 21: Add the number string 11010000100111011100001 to the white dots of the cut 2D graphic code until the stop position is reached; for example... Figure 12 As shown;
[0525] Step 22: Obtain the numbers in the white and black dots in the order from left to right and from top to bottom; that is, obtain the mobile security number 110100011001010111011100001000000110110111111110101101011;
[0526] Step 23: Clear all numbers from the cut 2D graphic code; obtain the cleared 2D graphic code; for example... Figure 13 As shown;
[0527] Step 24: Transfer the mobile security number 110100011001010111011100001000000110110111111110101101011 and... Figure 2 The QR code shown is uploaded to the litigation case management platform;
[0528] Step 25: The litigation case management platform receives the mobile security number 110100011001010111011100001000000110110111111110101101011 and such from the client. Figure 2 After clearing the QR code as shown, add the received mobile security number 110100011001010111011100001000000110110111111110101101011 to the received QR code in order from left to right and from top to bottom.
[0529] Step 26: Obtain the numbers from the black dots of the cleared two-dimensional graphic code in the order from left to right and from top to bottom; this will give you the platform number string 1101000010011101110000101111111111;
[0530] Step 27: Convert the obtained platform number string 1101000010011101110000101111111111 into a decimal mobile phone number 13999999999; this decimal mobile phone number 13999999999 is the mobile phone number 13999999999.
[0531] Step 28: Search for information code 240903 in the verification pair (13999999999, 240903) using the mobile phone number 13999999999. Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character representation of the mobile phone number and SMS code in the above method, the security of the mobile phone number and SMS code is ensured.
[0532] For example, if your mobile phone number is 13999999999, it will be recorded on the litigation case management platform.
[0533] First, enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login page;
[0534] The second step is that after clicking the "Get Information Code" virtual button on the login interface, the client receives the information code trigger signal and retrieves the eleven-digit mobile phone number 13999999999 entered on the login interface.
[0535] The third step is to generate a QR code from the mobile phone number 13999999999; for example... Figure 2 As shown;
[0536] 541; Xiangru Figure 2 In the QR code, adding the number 0 to the white dot and adding the number 1 to the black dot results in... Figure 2 As shown;
[0537] Step 5: Obtain the numbers from the white and black dots in order from left to right and from top to bottom; this gives you the phone security number: 11111110010110111111100000101110101000001101110101101001011101110100010001011101101110100100101010111011000001000111111110101010101011111110000000001110110010000000111111110101010101111111100000000011101100100000000110001101001011 101010111100110100110111000101110110001001110110000101110110111011110000000000011010001111101111110001010001101010000010110110000011110111010010001001010010111010111001110101011001101011001000010110000110100111111110011010101001100;
[0538] Step 6: Upload the mobile phone security number to the litigation case management platform;
[0539] Step 7: After receiving the mobile security number sent by the client, the litigation case management platform retrieves the received mobile security number. The number of bits in 10111100110100110111000101110110001001110110000101110110111011110000000000011010001111101111110001010001101010000010110111010010001001010010111010111001110101010110011010101000010110000110100111111110011010101001100001101001111111100110101001100 is 441 bits.
[0540] Step 8: Take the square root of 441 to get the number of horizontal and vertical pixels C, which is 21.
[0541] Step 9: Generate 21×21 black pixels based on the number of pixels in each direction (21 in total). Figure 13 As shown;
[0542] Step 10: Add the received mobile security numbers to the 21x21 pixel grid in a left-to-right, top-to-bottom order; for example... Figure 11 As shown;
[0543] Step 11: Add 0 to any pixel in the 21×21 pixel grid to make it a white pixel; for example... Figure 12 As shown;
[0544] Step 12: Clear the digits 0 and 1 from the 21×21 pixels to obtain the two-dimensional graphic code of the mobile phone number; for example... Figure 13 As shown;
[0545] Step 13, scan as follows Figure 2 The mobile phone number can be obtained by scanning the QR code shown.
[0546] Step 14: Since the mobile phone number 13999999999 exists in the litigation case management platform, the litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (13999999999, 240903) with the mobile phone number 13999999999 and the randomly generated information code 240903.
[0547] Step 15: Enter the six-digit information code 240903 in the information code input box on the login screen;
[0548] Step 16: When you click the "Login" virtual button on the login screen, the client receives a login trigger signal and retrieves the eleven-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login screen.
[0549] Step 17: Generate a QR code from the phone number; for example... Figure 2 As shown;
[0550] Step 18, towards Ru In the QR code, the white dot is incremented by the number 0, and the black dot is incremented by the number 1; ... In the QR code, adding the number 0 to the white dot and adding the number 1 to the black dot results in... As shown;
[0551] Step 19: Obtain the numbers from the white and black dots in order from left to right and from top to bottom; this yields the mobile security number: 11111110010110111111110000010111010100000110111010110100101110111010001000101110110111010010010101011101100000100011111111010101010101111111000000000111011001000000011111111010101010111111110000000001110110010000000011000110100101 110101011110011010011011100010111011000100111011000010111011011101111100000000000110100011111011111100010100011010100000101101100000111101110100100010010100101110101110011101011001101011001000010110000110100111111110011010101001100;
[0552] Step 20: Upload the mobile phone security number to the litigation case management platform;
[0553] Step 21: After receiving the mobile security number sent by the client, the litigation case management platform obtains that the received mobile security number is 441 digits long.
[0554] Step 22: Take the square root of 441 to get the number of horizontal and vertical pixels C, which is 21.
[0555] Step 23: Generate 21×21 black pixels based on the number of pixels in each direction (21). As shown;
[0556] Step 24: Add the received mobile security numbers to the 21x21 pixel grid in a left-to-right, top-to-bottom order; for example... As shown;
[0557] Step 25: Add 0 to the pixels in the 21×21 pixel grid to make them white pixels; for example... As shown;
[0558] Step 26: Clear the digits 0 and 1 from the 21×21 pixels to obtain the two-dimensional graphic code of the mobile phone number; for example... As shown;
[0559] Step 27, Scan as follows The mobile phone number can be obtained by scanning the QR code shown.
[0560] Step 28: Search for information code 240903 in the verification pair (13999999999, 240903) using the mobile phone number 13999999999. Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character representation of the mobile phone number and SMS code in the above method, the security of the mobile phone number and SMS code is ensured.
[0561] For example, if your mobile phone number is 13999999999, but the litigation case management platform does not have the mobile phone number 13999999999, then... Take sixty-two.
[0562] First, enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login page;
[0563] The second step is that after clicking the "Get Information Code" virtual button on the login interface, the client receives the information code trigger signal and retrieves the eleven-digit mobile phone number 13999999999 entered on the login interface.
[0564] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0565] The fourth step is to combine the binary mobile phone number 1101000010011101110000101111111111 with... Calculate the value 1000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;
[0566] Step 5: Convert the new binary string 1010111101100010001111010000000000 into the mobile security number cQwTCM; upload the mobile security number cQwTCM to the litigation case management platform.
[0567] Step 6: After receiving the mobile security number cQwTCM sent by the client, the litigation case management platform converts the mobile security number cQwTCM into a binary mobile security number 1010111101100010001111010000000000;
[0568] Step 7: Combine the binary mobile security number 1010111101100010001111010000000000 with... Calculate the value 10000000000000000000000000000000000 to get the new binary string 1101000010011101110000101111111111;
[0569] Step 8: Convert the new binary string 1101000010011101110000101111111111 into the mobile phone number 13999999999;
[0570] Step 9: Since the mobile phone number 13999999999 does not exist in the litigation case management platform, the mobile phone number 13999999999 is stored in the litigation case management platform, and the registration of the mobile phone number 13999999999 is completed.
[0571] Step 10: The litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (13999999999, 240903) with the mobile phone number 13999999999.
[0572] Step 11: Enter the six-digit information code 240903 in the information code input box on the login screen;
[0573] Step 12: When you click the "Login" virtual button on the login screen, the client receives a login trigger signal and retrieves the eleven-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login screen.
[0574] Step 13: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0575] Step fourteen: Combine the binary mobile phone number 1101000010011101110000101111111111 with... Calculate the value 1000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;
[0576] Step 15: Convert the new binary string 1010111101100010001111010000000000 into the mobile security number cQwTCM;
[0577] Step sixteen: Convert the obtained information code 240903 into binary information code 111010110100000111;
[0578] Step 17: Combine the binary information code 111010110100000111 with... Calculating the value 100000000000000000, we get a new binary string 100101001011111000;
[0579] Step 18: Convert the new binary string 100101001011111000 into the Information Security Code (DCE).
[0580] Step 19: Upload the mobile security number cQwTCM and information security code DCE to the litigation case management platform;
[0581] Step 20: After receiving the mobile security number cQwTCM and the information security code DCE, the litigation case management platform converts the mobile security number cQwTCM into the binary mobile security number 1010111101100010001111010000000000;
[0582] Step 21: Combine the binary mobile security number 1010111101100010001111010000000000 with... Calculate the value 10000000000000000000000000000000000 to get the new binary string 1101000010011101110000101111111111;
[0583] Step 22: Convert the new binary string 11010000100111011100001011111111111 into the mobile phone number 13999999999;
[0584] Step 23: Convert the DCE information security code into the binary information security code 100101001011111000;
[0585] Step 24: Combine the binary information security code 100101001011111000 with... The value 1000000000000000000 is used to calculate the new binary information security code string 111010110100000111;
[0586] Step 25: Convert the new binary information security code string 111010110100000111 into information code 240903;
[0587] Step 26: Search for information code 240903 in the verification pair (13999999999, 240903) using the mobile phone number 13999999999. Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character representation of the mobile phone number and SMS code in the above method, the security of the mobile phone number and SMS code is ensured.
[0588] For example, if your mobile phone number is 13999999999, and this mobile phone number exists on the litigation case management platform, then... Take ninety-two.
[0589] First, enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login page;
[0590] The second step is that after clicking the "Get Information Code" virtual button on the login interface, the client receives the information code trigger signal and retrieves the eleven-digit mobile phone number 13999999999 entered on the login interface.
[0591] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0592] The fourth step is to combine the binary mobile phone number 1101000010011101110000101111111111 with... Calculate the value 1000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;
[0593] Step 5: Convert the new binary string 1010111101100010001111010000000000 into the mobile security number 1)q?p^; upload the mobile security number 1)q?p^ to the litigation case management platform;
[0594] Step 6: After receiving the mobile security number 1)q?p^ sent by the client, the litigation case management platform converts the mobile security number 1)q?p^ into a binary mobile security number 1010111101100010001111010000000000;
[0595] Step 7: Combine the binary mobile security number 1010111101100010001111010000000000 with... Calculate the value 10000000000000000000000000000000000 to get the new binary string 1101000010011101110000101111111111;
[0596] Step 8: Convert the new binary string 1101000010011101110000101111111111 into the mobile phone number 13999999999;
[0597] Step 9: Since the mobile phone number 13999999999 exists in the litigation case management platform, the litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (13999999999, 240903) with the mobile phone number 13999999999 and the randomly generated information code 240903.
[0598] Step 10: Enter the six-digit information code 240903 in the information code input box on the login screen;
[0599] Step 11: When you click the "Login" virtual button on the login screen, the client receives a login trigger signal and retrieves the eleven-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login screen.
[0600] Step 12: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0601] Step 13: Combine the binary mobile phone number 1101000010011101110000101111111111 with... Calculate the value 1000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;
[0602] Step fourteen: Convert the new binary string 1010111101100010001111010000000000 into the mobile phone security number 1)q?p^;
[0603] Step 15: Convert the obtained information code 240903 into binary information code 111010110100000111;
[0604] Step sixteen: Combine the binary information code 111010110100000111 with... Calculating the value 100000000000000000, we get a new binary string 100101001011111000;
[0605] Step 17: Convert the new binary string 100101001011111000 into the information security code hQ;
[0606] Step 18: Upload the mobile security number 1)q?p^ and information security code hQ to the litigation case management platform;
[0607] Step 19: After receiving the mobile security number 1)q?p^ and the information security code hQ, the litigation case management platform converts the mobile security number 1)q?p^ into the binary mobile security number 1010111101100010001111010000000000;
[0608] Step 20: Combine the binary mobile security number 1010111101100010001111010000000000 with... Calculate the value 10000000000000000000000000000000000 to get the new binary string 1101000010011101110000101111111111;
[0609] Step 21: Convert the new binary string 11010000100111011100001011111111111 into the mobile phone number 13999999999;
[0610] Step 22: Convert the information security code hQ into the binary information security code 100101001011111000;
[0611] Step 23: Combine the binary information security code 100101001011111000 with... The value 1000000000000000000 is used to calculate the new binary information security code string 111010110100000111;
[0612] Step 24: Convert the new binary information security code string 111010110100000111 into information code 240903;
[0613] Step 25: Search for information code 240903 in the verification pair (13999999999, 240903) using the mobile phone number 13999999999. Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character representation of the mobile phone number and SMS code in the above method, the security of the mobile phone number and SMS code is ensured.
[0614] For example, if your mobile phone number is 13999999999, and this mobile phone number exists on the litigation case management platform, then... Take sixteen.
[0615] First, enter the eleven-digit mobile phone number 13999999999 in the mobile phone number input box on the login page;
[0616] The second step is that after clicking the "Get Information Code" virtual button on the login interface, the client receives the information code trigger signal and retrieves the eleven-digit mobile phone number 13999999999 entered on the login interface.
[0617] The third step is to convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0618] The fourth step is to combine the binary mobile phone number 1101000010011101110000101111111111 with... Calculate the value 1000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;
[0619] Step 5: Convert the new binary string 1010111101100010001111010000000000 into the mobile security number 2bd88f400; upload the mobile security number 2bd88f400 to the litigation case management platform.
[0620] Step 6: After receiving the mobile security number 2bd88f400 sent by the client, the litigation case management platform converts the mobile security number 2bd88f400 into a binary mobile security number 1010111101100010001111010000000000;
[0621] Step 7: Combine the binary mobile security number 1010111101100010001111010000000000 with... Calculate the value 10000000000000000000000000000000000 to get the new binary string 1101000010011101110000101111111111;
[0622] Step 8: Convert the new binary string 1101000010011101110000101111111111 into the mobile phone number 13999999999;
[0623] Step 9: Since the mobile phone number 13999999999 exists in the litigation case management platform, the litigation case management platform randomly generates a six-digit information code 240903, sends the randomly generated information code 240903 to the mobile phone number 13999999999, and forms a verification pair (13999999999, 240903) with the mobile phone number 13999999999 and the randomly generated information code 240903.
[0624] Step 10: Enter the six-digit information code 240903 in the information code input box on the login screen;
[0625] Step 11: When you click the "Login" virtual button on the login screen, the client receives a login trigger signal and retrieves the eleven-digit mobile phone number 13999999999 and the six-digit information code 240903 entered on the login screen.
[0626] Step 12: Convert the obtained mobile phone number 13999999999 into a binary mobile phone number 1101000010011101110000101111111111;
[0627] Step 13: Combine the binary mobile phone number 1101000010011101110000101111111111 with... Calculate the value 1000000000000000000000000000000000 to get a new binary string 1010111101100010001111010000000000;
[0628] Step 14: Convert the new binary string 1010111101100010001111010000000000 into the mobile security number 2bd88f400;
[0629] Step 15: Convert the obtained information code 240903 into binary information code 111010110100000111;
[0630] Step sixteen: Combine the binary information code 111010110100000111 with... Calculating the value 100000000000000000, we get a new binary string 100101001011111000;
[0631] Step 17: Convert the new binary string 100101001011111000 into the information security code 252f8;
[0632] Step 18: Upload the mobile security number 2bd88f400 and information security code 252f8 to the litigation case management platform;
[0633] Step 19: After receiving the mobile security number 2bd88f400 and the information security code 252f8, the litigation case management platform converts the mobile security number 2bd88f400 into the binary mobile security number 1010111101100010001111010000000000;
[0634] Step 20: Combine the binary mobile security number 1010111101100010001111010000000000 with... Calculate the value 10000000000000000000000000000000000 to get the new binary string 1101000010011101110000101111111111;
[0635] Step 21: Convert the new binary string 11010000100111011100001011111111111 into the mobile phone number 13999999999;
[0636] Step 22: Convert the information security code 252f8 into the binary information security code 100101001011111000;
[0637] Step 23: Combine the binary information security code 100101001011111000 with... The value 1000000000000000000 is used to calculate the new binary information security code string 111010110100000111;
[0638] Step 24: Convert the new binary information security code string 111010110100000111 into information code 240903;
[0639] Step 25: Search for information code 240903 in the verification pair (13999999999, 240903) using the mobile phone number 13999999999. Since the information code 240903 in the verification pair (13999999999, 240903) obtained by searching for the mobile phone number 13999999999 is the same as the obtained information code 240903, the login to the litigation case management platform is successful. By changing the character representation of the mobile phone number and SMS code in the above method, the security of the mobile phone number and SMS code is ensured. The login and image processing method of this invention is not limited to application in lawyers' case management, but can also be applied to teachers' exam paper management, and also to the management of personal privacy photos.
[0640] In a preferred embodiment of the present invention, the method for uploading collected case images to the litigation case management platform for storage in the litigation case upload and storage module includes the following steps:
[0641] S21, Determine whether the captured image is a color image:
[0642] If the captured image is a color image, determine the depth (bits) of the color image and convert the color image to grayscale; proceed to the next step.
[0643] If the captured image is a grayscale image, determine the depth (number of bits) of the grayscale image and proceed to the next step;
[0644] S22, convert the pixel values of all pixels in the image to binary to obtain binary pixel values;
[0645] S23, convert all binary pixel values to binary pixel values with the same number of bits as the depth;
[0646] S24, calculate the changed binary pixel value by combining all binary pixel values with the pixel sequence code;
[0647] S25, Generate the changed image based on all the changed binary pixel values;
[0648] S26, Upload the pixel code and modified image to the litigation case management platform;
[0649] S27. After receiving the pixel code and the modified image, the litigation case management platform uses the received pixel code and the modified image to obtain the image to be stored.
[0650] S28, store the images to be stored in the litigation case management platform.
[0651] In a preferred embodiment of the present invention, the method for converting a color image to a grayscale image in step S21 is as follows:
[0652] ,
[0653] in, Indicates at pixel point Pixel value at;
[0654] Indicates at pixel point The pixel value of the red channel;
[0655] Indicates at pixel point The pixel value of the green channel;
[0656] Indicates at pixel point The pixel value of the blue channel; =1, 2, 3, ... , =1, 2, 3, ... , Indicates the number of pixels in the horizontal direction. Indicates the number of vertical pixels.
[0657] This represents a function that extracts the integer part.
[0658] Constraints:
[0659] ;
[0660] ;
[0661] ;
[0662] ;
[0663] Here, , , .
[0664] In a preferred embodiment of the present invention, the method for converting all binary pixel values to binary pixel values with the same number of depth bits in step S23 is as follows:
[0665] If the number of bits in the binary pixel value is less than the number of bits in the depth, add 0s to the front of the binary pixel value so that the number of bits after adding 0s is equal to the number of bits in the depth.
[0666] In a preferred embodiment of the present invention, the pixel code is calculated in step S26 as follows:
[0667] ,
[0668] in, Represents pixel code;
[0669] The pixel code is calculated using MD5, which produces a 128-bit binary value. During transmission, to shorten the number of bits in the pixel code, it can be converted to hexadecimal, 90-bit, or other binary formats for transmission.
[0670] Represents a string representing pixel values;
[0671] ,
[0672] in, Represents a string representing pixel values;
[0673] Indicates at pixel point The decimal pixel value at that location;
[0674] Indicates at pixel point The decimal pixel value at that location;
[0675] Indicates at pixel point The decimal pixel value at that location;
[0676] Indicates at pixel point The decimal pixel value at that location;
[0677] Indicates at pixel point The decimal pixel value at that location;
[0678] Indicates at pixel point The decimal pixel value at that location;
[0679] Indicates at pixel point The decimal pixel value at that location;
[0680] Indicates at pixel point The decimal pixel value at that location;
[0681] Indicates at pixel point The decimal pixel value at that location;
[0682] Indicates at pixel point The decimal pixel value at that location;
[0683] Indicates at pixel point The decimal pixel value at that location;
[0684] Indicates at pixel point The decimal pixel value at that location;
[0685] Indicates at pixel point The decimal pixel value at that location;
[0686] Indicates at pixel point The decimal pixel value at that location;
[0687] Indicates at pixel point The decimal pixel value at that location;
[0688] Indicates at pixel point The decimal pixel value at that location;
[0689] In a preferred embodiment of the present invention, the method for calculating the pixel sequence code in step S24 is as follows:
[0690] Take the last pixel from left to right in sequence. The bit character is the pixel sequence code. The size is the depth in bits;
[0691] In a preferred embodiment of the present invention, the method for calculating the changed binary pixel value in step S24 is as follows:
[0692] ,
[0693] That is, if ,or ,but ;
[0694] if and ,or and ,but ;
[0695] in, The number of binary pixels that have changed is the first one. The character of the position;
[0696] Represents the first pixel in the binary pixel value The character of the position;
[0697] Indicates the first pixel in the pixel sequence code The character of the position;
[0698] =1, 2, 3, ... , Indicates the number of pixels in the horizontal direction;
[0699] =1, 2, 3, ... , Indicates the number of pixels in the vertical direction;
[0700] =1, 2, 3, ... ; The size is the depth in bits;
[0701] In a preferred embodiment of the present invention, the method for obtaining the image to be stored using the received pixel code and the modified image in step S27 includes the following steps:
[0702] S271, Determine the depth bit depth of the received modified image;
[0703] S272, convert the pixel values of all pixels in the image to binary to obtain binary pixel values;
[0704] S273, converts all binary pixel values to binary pixel values with the same number of bits as the depth;
[0705] S274, calculate all binary pixel values and pixel sequence codes to obtain the recovered binary pixel values;
[0706] S275, Generate a recovered image based on all recovered binary pixel values; this recovered image is the image to be stored.
[0707] In a preferred embodiment of the present invention, step S275 is to generate a restored image based on all the recovered binary pixel values;
[0708] The pixel code is calculated based on the recovered image. If the calculated pixel code is the same as the received pixel code, then the recovered image is the image to be stored; otherwise, the recovered image is not the image to be stored.
[0709] In a preferred embodiment of the present invention, step S275 is to generate a restored image based on all the recovered binary pixel values;
[0710] Calculate the pixel code based on the recovered image, and convert the pixel code into a hexadecimal pixel code, a 90-binary pixel code, or a pixel code in another base. If the converted hexadecimal pixel code, 90-binary pixel code, or other base pixel code is the same as the received pixel code, then the recovered image is the image to be stored; otherwise, the recovered image is not the image to be stored.
[0711] In a preferred embodiment of the present invention, the method for converting all binary pixel values to binary pixel values with the same number of depth bits in step S273 is as follows:
[0712] If the number of bits in the binary pixel value is less than the number of bits in the depth, add 0s to the front of the binary pixel value so that the number of bits after adding 0s is equal to the number of bits in the depth.
[0713] In a preferred embodiment of the present invention, the method for calculating the pixel sequence code in step S274 is as follows:
[0714] Take the last digit from the received pixel code in order from left to right. The bit character is the pixel sequence code. The size is the depth in bits;
[0715] In a preferred embodiment of the present invention, the method for calculating the recovered binary pixel value in step S274 is as follows:
[0716] ,
[0717] That is, if ,or ,but ;
[0718] if and ,or and ,but ;
[0719] in, This represents the recovered binary pixel value of the first pixel. The character of the position;
[0720] Represents the first pixel in the binary pixel value The character of the position;
[0721] Indicates the first pixel in the pixel sequence code The character of the position;
[0722] =1, 2, 3, ... , Indicates the number of pixels in the horizontal direction;
[0723] =1, 2, 3, ... , Indicates the number of pixels in the vertical direction;
[0724] =1, 2, 3, ... ; The size is the depth in bits;
[0725] In a preferred embodiment of the present invention, the pixel code calculation method in step S275 is as follows:
[0726] ,
[0727] in, Represents pixel code;
[0728] The method for calculating pixel codes; MD5 can be used for calculation, and the result is a 128-bit binary value;
[0729] Represents a string representing pixel values;
[0730] ,
[0731] in, Represents a string representing pixel values;
[0732] Indicates at pixel point The decimal pixel value at that location;
[0733] Indicates at pixel point The decimal pixel value at that location;
[0734] Indicates at pixel point The decimal pixel value at that location;
[0735] Indicates at pixel point The decimal pixel value at that location;
[0736] Indicates at pixel point The decimal pixel value at that location;
[0737] Indicates at pixel point The decimal pixel value at that location;
[0738] Indicates at pixel point The decimal pixel value at that location;
[0739] Indicates at pixel point The decimal pixel value at that location;
[0740] Indicates at pixel point The decimal pixel value at that location;
[0741] Indicates at pixel point The decimal pixel value at that location;
[0742] Indicates at pixel point The decimal pixel value at that location;
[0743] Indicates at pixel point The decimal pixel value at that location;
[0744] Indicates at pixel point The decimal pixel value at that location;
[0745] Indicates at pixel point The decimal pixel value at that location;
[0746] Indicates at pixel point The decimal pixel value at that location;
[0747] Indicates at pixel point The decimal pixel value at that location;
[0748] It should be noted that converting a grayscale image into an altered image can be seen as a forward operation; while converting a received altered image into a restored image can be seen as a reverse operation.
[0749] For example, the captured image is a color image with a depth of 8 bits, a horizontal pixel count of 4, and a vertical pixel count of 3. The decimal RGB three-channel pixel values of this color image are shown in Table 2.
[0750] Table 2 Decimal RGB Three-Channel Pixel Values
[0751]
[0752] The first step is to use the formula The color images were converted to grayscale images, as shown in Table 3.
[0753] Table 3 Decimal Single-Channel Pixel Values
[0754] 120 145 167 118 43 49 37 91 170 68 165 79
[0755] The second step is to convert the pixel values of all pixels in the image into binary, as shown in Table 4.
[0756] Table 4 Binary Single-Channel Pixel Values
[0757] 1111000 10010001 10100111 1110110 101011 110001 100101 1011011 10101010 1000100 10100101 1001111
[0758] The third step is to convert all binary pixel values to 8-bit binary pixel values, since the depth bit depth of the color image is 8 bits, as shown in Table 5.
[0759] Table 5 Eight-bit binary single-channel pixel values
[0760] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111
[0761] The fourth step is to obtain the pixel value string Pixelstring=120145167118434937911706816579 based on the pixel values of the gray image.
[0762] Step 5: According to the pixel code calculation formula, obtain the pixel code PixelNO=PixelNOcalculateway(120145167118434937911706816579)=001100101011000110010111000000110000100101100010100100101000011011100110100000110100011100000110000011000000001100100010101110001010101010.
[0763] Step 6: Following the order from left to right, the last 1st to the 8th character from the pixel code 001100101011000110010111000001100001001010010010100001101110011010000011010001110000011000000001100100010101110001010101010. These characters, 00101010, are the pixel sequence code.
[0764] Step 7: Calculate the changed binary pixel values by combining all eight-bit binary pixel values with the pixel sequence code 00101010, as shown in Table 6.
[0765] Table 6. Changed binary pixel values
[0766] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101
[0767] Step 8: All the changed binary pixel values are used to generate the changed image. The corresponding decimal pixel values for the changed image are shown in Table 7.
[0768] Table 7. Changing the decimal pixel values corresponding to the image
[0769] 82 187 141 92 1 27 15 113 128 110 143 101
[0770] Step 9: Upload the pixel code 0011001010110001100101110000001100001001011000101001010000110111001101000001101000111000001100000011001000101011100010101010 and the modified image to the litigation case management platform.
[0771] Step 10: After receiving the pixel code 00110010101100011001011100000011000010010110001010010010100001101110011010000011010001110000011000000110010001010111000101010 and the modified image, the litigation case management platform converts the pixel values of all pixels in the modified image into binary, as shown in Table 8.
[0772] Table 8 Binary Pixel Values
[0773] 1010010 10111011 10001101 1011100 1 11011 1111 1110001 10000000 1101110 10001111 1100101
[0774] Step 11: Since the depth bit depth of the received modified image is 8 bits, the bit depth of all binary pixel values is converted to 8-bit binary pixel values, as shown in Table 9.
[0775] Table 9 Eight-bit binary pixel values
[0776] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101
[0777] Step 12: Extract the last 1 to the last 8 characters (00101010) from the received pixel code 001100101011000110010111000001100001001001001000011011100110100001101000111000011000000011001000101011100010101010. This is the pixel sequence code.
[0778] Step 13: Calculate all eight-bit binary pixel values with the pixel sequence code 00101010 to obtain the recovered binary pixel values, as shown in Table 10.
[0779] Table 10 Recovered binary pixel values
[0780] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111
[0781] Step fourteen: All recovered binary pixel values are used to generate a recovered image, which is the image to be stored. This recovered image is then stored on the litigation case management platform. The above steps only involve uploading and storing a single litigation case image, and are applicable to a massive number of litigation case images.
[0782] For example, the captured image is a color image with a depth of 8 bits, a horizontal pixel count of 4, and a vertical pixel count of 3. The decimal RGB three-channel pixel values of this color image are shown in Table 11.
[0783] Table 11 Decimal RGB Three-Channel Pixel Values
[0784]
[0785] The first step is to use the formula The color images were converted to grayscale images, as shown in Table 12.
[0786] Table 12 Decimal Single-Channel Pixel Values
[0787] 120 145 167 118 43 49 37 91 170 68 165 79
[0788] The second step is to convert the pixel values of all pixels in the image into binary, as shown in Table 13.
[0789] Table 13 Binary Single-Channel Pixel Values
[0790] 1111000 10010001 10100111 1110110 101011 110001 100101 1011011 10101010 1000100 10100101 1001111
[0791] The third step is to convert all binary pixel values to 8-bit binary pixel values, since the depth bit depth of the color image is 8 bits, as shown in Table 14.
[0792] Table 14 Eight-bit binary single-channel pixel values
[0793] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111
[0794] The fourth step is to obtain the pixel value string Pixelstring=120145167118434937911706816579 based on the pixel values of the gray image.
[0795] Step 5: According to the pixel code calculation formula, obtain the pixel code PixelNO=PixelNOcalculateway(120145167118434937911706816579)=001100101011000110010111000000110000100101100010100100101000011011100110100000110100011100000110000011000000001100100010101110001010101010.
[0796] Step 6: Following the order from left to right, the last 1st to the 8th character from the pixel code 001100101011000110010111000001100001001010010010100001101110011010000011010001110000011000000001100100010101110001010101010. These characters, 00101010, are the pixel sequence code.
[0797] Step 7: Calculate the changed binary pixel values by combining all eight-bit binary pixel values with the pixel sequence code 00101010, as shown in Table 15.
[0798] Table 15 Changes in binary pixel values
[0799] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101
[0800] Step 8: All the changed binary pixel values are used to generate the changed image. The decimal pixel values corresponding to the changed image are shown in Table 16.
[0801] Table 16 Changing the decimal pixel values corresponding to the image
[0802] 82 187 141 92 1 27 15 113 128 110 143 101
[0803] Step 9: Upload the pixel code 0011001010110001100101110000001100001001011000101001010000110111001101000001101000111000001100000011001000101011100010101010 and the modified image to the litigation case management platform.
[0804] Step 10: After receiving the pixel code 00110010101100011001011100000011000010010110001010010010100001101110011010000011010001110000011000000110010001010111000101010 and the modified image, the litigation case management platform converts the pixel values of all pixels in the modified image into binary, as shown in Table 17.
[0805] Table 17 Binary Pixel Values
[0806] 1010010 10111011 10001101 1011100 1 11011 1111 1110001 10000000 1101110 10001111 1100101
[0807] Step 11: Since the depth bit depth of the received modified image is 8 bits, the bit depth of all binary pixel values is converted to 8-bit binary pixel values, as shown in Table 18.
[0808] Table 18 Eight-bit binary pixel values
[0809] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101
[0810] Step 12: Extract the last 1 to the last 8 characters (00101010) from the received pixel code 001100101011000110010111000001100001001001001000011011100110100001101000111000011000000011001000101011100010101010. This is the pixel sequence code.
[0811] Step 13: Calculate all eight-bit binary pixel values with the pixel sequence code 00101010 to obtain the recovered binary pixel values, as shown in Table 19.
[0812] Table 19 Recovered Binary Pixel Values
[0813] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111
[0814] Step 14: All recovered binary pixel values are used to generate a restored image. The decimal pixel values corresponding to the restored image are shown in Table 20.
[0815] Table 20. Decimal pixel values corresponding to the recovered images
[0816] 120 145 167 118 43 49 37 91 170 68 165 79
[0817] Step 15: Based on the decimal pixel values of the recovered image, obtain the pixel value string Pixelstring=120145167118434937911706816579;
[0818] Step 16: According to the pixel code calculation formula, obtain the pixel code PixelNO'=PixelNOcalculateway(120145167118434937911706816579)=001100101011000110010111000000110000100101100010100100101000011011100110100000110100011100000110000011000000001100100010101110001010101010.
[0819] Step 17: Since the calculated pixel code 00110010101100011001011100000011000010010110001010010100001101110011010000011010001110000110000011000000001100100010101110001010101010 and the received pixel code 0011001010110001 The images 1001011100000011000010010110001010010010100001101110011010000011010001110000011000000011001000101011100010101010 are identical. Therefore, the recovered image is the same as the image to be stored. This ensures the accuracy of the recovered image. The recovered image is then stored on the litigation case management platform.
[0820] For example, the captured image is a color image with a depth of 8 bits, a horizontal pixel count of 4, and a vertical pixel count of 3. The decimal RGB three-channel pixel values of this color image are shown in Table 21.
[0821] Table 21 Decimal RGB Three-Channel Pixel Values
[0822]
[0823] The first step is to use the formula The color images were converted to grayscale images, as shown in Table 22.
[0824] Table 22 Decimal Single-Channel Pixel Values
[0825] 120 145 167 118 43 49 37 91 170 68 165 79
[0826] The second step is to convert the pixel values of all pixels in the image into binary, as shown in Table 23.
[0827] Table 23 Binary Single-Channel Pixel Values
[0828] 1111000 10010001 10100111 1110110 101011 110001 100101 1011011 10101010 1000100 10100101 1001111
[0829] The third step is to convert all binary pixel values to 8-bit binary pixel values, since the depth bit depth of the color image is 8 bits, as shown in Table 24.
[0830] Table 24 Eight-bit binary single-channel pixel values
[0831] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111
[0832] The fourth step is to obtain the pixel value string Pixelstring=120145167118434937911706816579 based on the pixel values of the gray image.
[0833] Step 5: According to the pixel code calculation formula, obtain the pixel code PixelNO = PixelNOcalculateway(120145167118434937911706816579) = 0011001010110001100101110000001100001001011000101001001010000110111001101000001101000111000001100000011001000101011100010101010. Then convert the pixel code to a sixty-binary pixel code 1xEM3HmzCky44k6JD2fb3Y.
[0834] Step 6: Following the order from left to right, the last 1st to the 8th character from the pixel code 001100101011000110010111000001100001001010010010100001101110011010000011010001110000011000000001100100010101110001010101010. These characters, 00101010, are the pixel sequence code.
[0835] Step 7: Calculate the changed binary pixel values by combining all eight-bit binary pixel values with the pixel sequence code 00101010, as shown in Table 25.
[0836] Table 25 Changes in binary pixel values
[0837] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101
[0838] Step 8: All the changed binary pixel values are used to generate the changed image. The decimal pixel values corresponding to the changed image are shown in Table 26.
[0839] Table 26 Changing the decimal pixel values corresponding to the image
[0840] 82 187 141 92 1 27 15 113 128 110 143 101
[0841] Step 9: Upload the pixel code 1xEM3HmzCky44k6JD2fb3Y and the modified image to the litigation case management platform.
[0842] Step 10: After receiving the pixel code 1xEM3HmzCky44k6JD2fb3Y and the changed image, the litigation case management platform converts the pixel values of all pixels in the changed image into binary, as shown in Table 27.
[0843] Table 27 Binary Pixel Values
[0844] 1010010 10111011 10001101 1011100 1 11011 1111 1110001 10000000 1101110 10001111 1100101
[0845] Step 11: Since the depth bit depth of the received modified image is 8 bits, the bit depth of all binary pixel values is converted to 8-bit binary pixel values, as shown in Table 28.
[0846] Table 28 Eight-bit binary pixel values
[0847] 01010010 10111011 10001101 01011100 00000001 00011011 00001111 01110001 10000000 01101110 10001111 01100101
[0848] Step 12: Convert the received pixel code 1xEM3HmzCky44k6JD2fb3Y into binary pixel code 110010101100011001011100000011000010010110001010010010100001101110011010000011010001110000011000000110010001010111000101010, according to... The pixel sequence code is obtained by taking the last 1 to the 8th character from the binary pixel code 110010101100011001011100000011000010010110001001010000110111001101000001101000111000001100000000110010001010111000101010.
[0849] Step 13: Calculate all eight-bit binary pixel values with the pixel sequence code 00101010 to obtain the recovered binary pixel values, as shown in Table 29.
[0850] Table 29 Recovered Binary Pixel Values
[0851] 01111000 10010001 10100111 01110110 00101011 00110001 00100101 01011011 10101010 01000100 10100101 01001111
[0852] Step 14: All recovered binary pixel values are used to generate a recovered image. The decimal pixel values corresponding to the recovered image are shown in Table 30.
[0853] Table 30 Decimal pixel values corresponding to the restored images
[0854] 120 145 167 118 43 49 37 91 170 68 165 79
[0855] Step 15: Based on the decimal pixel values of the recovered image, obtain the pixel value string Pixelstring=120145167118434937911706816579;
[0856] Step 16: According to the pixel code calculation formula, obtain the pixel code PixelNO'=PixelNOcalculateway(120145167118434937911706816579)=001100101011000110010111000000110000100101100010100100101000011011100110100000110100011100000110000011000000001100100010101110001010101010.
[0857] Step sixteen: Convert the calculated pixel code 0011001010110001100101110000001100001001011001010010010100001101110011010000011010001110000011000001100000000110010001010111000101010 into a sixty-binary pixel code 1xEM3HmzCky44k6JD2fb3Y.
[0858] Step 17: Since the converted hexahedral pixel code 1xEM3HmzCky44k6JD2fb3Y is the same as the received pixel code 1xEM3HmzCky44k6JD2fb3Y, the recovered image is the image to be stored. The recovered image is then stored on the litigation case management platform.
[0859] In a preferred embodiment of the present invention, a litigation case query module is also included. This module is used to view and download cases stored on the litigation case management platform. The downloaded case images undergo image confidentiality processing to ensure the security of the image content. The method for processing the downloaded case images is the same as the method for uploading the collected case images to the litigation case management platform. The client's method for parsing the downloaded case images is the same as the method used by the litigation case management platform to parsing the images after they have been modified.
[0860] Although embodiments of the invention have been shown and described, those skilled in the art will understand that various changes, modifications, substitutions and alterations can be made to these embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
Claims
1. A system for improving the accuracy of litigation case analysis, characterized in that, This includes a login module for the litigation case management platform and a litigation case upload and storage module; The litigation case management platform login module is used to log in to the litigation case management platform; the login module includes the following steps: S1-1, Determine if a trigger signal for obtaining the information code has been received: If the client receives a signal to obtain the information code, it will retrieve the eleven-digit mobile phone number entered on the login page. If the client does not receive the information acquisition code trigger signal, then proceed to step S1-1; S1-2, convert the mobile phone number obtained in step S1-1 into a mobile security number; step S1-2 includes the following steps: S1-2-1, Convert the mobile phone number obtained in step S1-1 into a binary mobile phone number; S1-2-2, Generate the mobile phone number obtained in step S1-1 into a QR code; S1-2-3, add the binary mobile phone number into the black dots of the QR code in a left-to-right and top-to-bottom order; the last black dot added is used as the stop position; S1-2-4, cut the first row to the stop position row of the QR two-dimensional graphic code to obtain the cut two-dimensional graphic code; S1-2-5, add a string of numbers 0 and / or 1 to the white dots of the cut two-dimensional graphic code until the stop position; S1-2-6: Obtain the numbers in the white and black dots in the order from left to right and from top to bottom; this is how you get the phone security number. S1-2-7, clear all numbers from the cut 2D graphic code; obtain the cleared 2D graphic code; S1-3, Upload the mobile security number and the cleared QR code to the litigation case management platform; S1-4: After receiving the mobile security number and the clear QR code sent by the client, the litigation case management platform converts the mobile security number into a mobile phone number; step S1-4 includes the following steps: S1-4-1, add the received mobile security number to the received clear QR code in order from left to right and from top to bottom; S1-4-2, obtain the numbers in the black dots of the cleared two-dimensional graphic code in the order from left to right and from top to bottom; then you can get the platform number string; S1-4-3 converts the obtained platform number string into a decimal mobile phone number; this decimal mobile phone number is the mobile phone number. S1-5, Determine if the mobile phone number in step S1-4 exists in the litigation case management platform: If the mobile phone number does not exist in the litigation case management platform, then store the mobile phone number in the litigation case management platform and register the mobile phone number; proceed to the next step; If the mobile phone number exists in the litigation case management platform, proceed to the next step; S1-6, The litigation case management platform randomly generates a six-digit information code, sends the randomly generated information code to the mobile phone number, and uses the mobile phone number and the randomly generated information code to form a verification pair; S1-7, Determine if a login signal for the litigation case management platform has been received: If the client receives a signal to log in to the litigation case management platform, it will retrieve the eleven-digit mobile phone number and six-digit information code entered on the login interface. If the client does not receive a signal to log in to the litigation case management platform, proceed to step S1-7 or S1-1. S1-8, Convert the mobile phone number obtained in step S1-7 into a mobile security number; S1-9, Upload the mobile security number, the cleared QR code, and the information code to the litigation case management platform; S1-10, After receiving the mobile security number, clearing QR code, and information code sent by the client, the litigation case management platform converts the mobile security number into a mobile phone number; S1-11, Using the mobile phone number from step S1-10, find the information code in the verification pair, and determine whether the information code obtained from the verification pair using the mobile phone number from step S1-10 is the same as the information code obtained in step S1-10: If the information code in the verification pair obtained by searching the mobile phone number in step S1-10 is the same as the information code obtained in step S1-10, then the login to the litigation case management platform is successful; at this time, delete the information code in the verification pair or delete the verification pair. Otherwise, login to the litigation case management platform will fail; proceed to step S1-7 or S1-1. The litigation case upload and storage module is used to upload collected case images to the litigation case management platform for storage after logging in.
2. The system for improving the accuracy of litigation case analysis according to claim 1, characterized in that, The login module of the litigation case management platform allows users to log in to the platform using their mobile phone number and the information code received on that number. Or / and steps S1-8 include the following steps: S1-8-1, Convert the mobile phone number obtained in step S1-8 into a binary mobile phone number; S1-8-2, Generate the mobile phone number obtained in step S1-8 into a QR code; S1-8-3: Add the binary mobile phone number into the black dots of the QR code in a left-to-right and top-to-bottom order; use the last black dot added as the stop position. S1-8-4, cut the first row to the stop position row of the QR two-dimensional graphic code to obtain the cut two-dimensional graphic code; S1-8-5, add a string of numbers 0 and / or 1 to the white dots of the cut two-dimensional graphic code until the stop position; S1-8-6: Obtain the numbers in the white and black dots in order from left to right and from top to bottom; this gives you the phone security number. S1-8-7, clear all numbers from the cut 2D graphic code; obtain the cleared 2D graphic code; Or / and steps S1-8 include the following steps: S1-8-1, Convert the mobile phone number obtained in step S1-8 into a binary mobile phone number; S1-8-2, Generate the mobile phone number obtained in step S1-8 into a QR code; S1-8-3: Add the binary mobile phone number into the black dots of the QR code in a left-to-right and top-to-bottom order; use the last black dot added as the stop position. S1-8-4, cut the first row to the stop position row of the QR two-dimensional graphic code to obtain the cut two-dimensional graphic code; S1-8-5, add a string of numbers 0 and / or 1 to the white dots of the cut two-dimensional graphic code until the stop position; S1-8-6: Obtain the numbers in the white and black dots in order from left to right and from top to bottom; this gives you the phone security number. S1-8-7, clear all numbers from the cut two-dimensional graphic code; obtain the cleared two-dimensional graphic code.
3. The system for improving the accuracy of litigation case analysis according to claim 1, characterized in that, The mobile phone number in the login module of the litigation case management platform is an eleven-digit mobile phone number.
4. The system for improving the accuracy of litigation case analysis according to claim 1, characterized in that, In the login module of the litigation case management platform, the mobile phone number is composed of any combination of numeric characters 0 to 9, and the first character is not 0.
5. The system for improving the accuracy of litigation case analysis according to claim 1, characterized in that, The information code in the login module of the litigation case management platform is a six-digit information code.
6. The system for improving the accuracy of litigation case analysis according to claim 1, characterized in that, In the login module of the litigation case management platform, the information code is composed of any combination of numeric characters 0 to 9.
7. The system for improving the accuracy of litigation case analysis according to claim 1, characterized in that, The case images collected in the litigation case upload and storage module are litigation case images taken with a mobile phone or / and litigation case images scanned by a scanner; Or / and upload the litigation case to the litigation case management platform using a 4G network, 5G network, or WiFi network in the litigation case upload and storage module; Or / and the format of the case images in the litigation case upload and storage module is one of jpg, png, tif, bmp, webp or any combination thereof.
8. The system for improving the accuracy of litigation case analysis according to claim 1, characterized in that, In the litigation case upload and storage module, to ensure the security of uploaded case images, the collected case images are subject to image confidentiality processing to achieve the security of image content.
9. The system for improving the accuracy of litigation case analysis according to claim 1, characterized in that, It also includes a litigation case query module, which is used to view and download cases stored on the litigation case management platform. The module will protect the images of the cases to be downloaded by making them confidential, thus ensuring the security of the image content.