CN108847050B - Data processing system and method for preventing high concurrency by sharing parking space - Google Patents

Data processing system and method for preventing high concurrency by sharing parking space Download PDF

Info

Publication number
CN108847050B
CN108847050B CN201810908794.XA CN201810908794A CN108847050B CN 108847050 B CN108847050 B CN 108847050B CN 201810908794 A CN201810908794 A CN 201810908794A CN 108847050 B CN108847050 B CN 108847050B
Authority
CN
China
Prior art keywords
module
parking space
parking
identification code
quantum
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810908794.XA
Other languages
Chinese (zh)
Other versions
CN108847050A (en
Inventor
宋怀春
何光雨
陈志良
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hunan Xiaozha Technology Co ltd
Original Assignee
Hunan Xiaozha Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hunan Xiaozha Technology Co ltd filed Critical Hunan Xiaozha Technology Co ltd
Priority to CN201810908794.XA priority Critical patent/CN108847050B/en
Publication of CN108847050A publication Critical patent/CN108847050A/en
Application granted granted Critical
Publication of CN108847050B publication Critical patent/CN108847050B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/14—Traffic control systems for road vehicles indicating individual free spaces in parking areas
    • G08G1/149—Traffic control systems for road vehicles indicating individual free spaces in parking areas coupled to means for restricting the access to the parking space, e.g. authorization, access barriers, indicative lights
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/02—Reservations, e.g. for tickets, services or events
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07F—COIN-FREED OR LIKE APPARATUS
    • G07F17/00—Coin-freed apparatus for hiring articles; Coin-freed facilities or services
    • G07F17/0042—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for hiring of objects

Landscapes

  • Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Operations Research (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Lock And Its Accessories (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a data processing system and a method for preventing high concurrence of shared parking spaces, belonging to a shared parking data processing domain, the invention identifies parking through an encrypted identification code by setting the form of the encrypted identification code, and simultaneously, the secret key of each encrypted identification code is single, so that a user cannot be preempted by people in advance after reserving a parking space, and simultaneously, the encrypted identification code on a control end is directly identified through a user end, thereby reducing the data processing at the stage of the server, well preventing the problem of data concurrence, simultaneously, through a subimage encryption technology, not only can represent a gray level image, but also can represent a color RGB image, and the invention is convenient to use, wherein the invention totally carries out 2 stepsn+4 random phase shifts, so there are 2 in totaln+4 keys transformed randomly, the key space is quite large, and it is difficult for an attacker to get the correct keys, just as each encryption is random.

Description

Data processing system and method for preventing high concurrency by sharing parking space
Technical Field
The invention relates to the field of shared parking data processing, in particular to a data processing system and a method for preventing high concurrence of shared parking spaces.
Background
Along with the increasing year-by-year keeping quantity of automobiles, the contradiction that the planning and setting of urban roads and parking spaces cannot meet the increasing travel parking requirements is also highlighted day by day; a series of social problems such as disordered parking, no parking space found in peak hours, congestion caused by parking space finding and the like are brought to urban managers and consumers. At present, policies, planning and reconstruction and extension for solving the problems of city congestion and parking difficulty are implemented in many cities in China, for example: the single-double number restriction system, the vehicle restriction board, the non-local vehicles are prohibited to drive into some areas with busy traffic, the public traffic is developed greatly, and the like, but the basic current situations of difficult urban parking and traffic jam can not be solved fundamentally.
According to the statistics of government departments and urban traffic related departments, the number of urban parking lots and the number of parking spaces are limited, namely the parking spaces are far smaller than the total amount of automobiles, and the parking requirements of current users cannot be met. This causes urban traffic congestion and is becoming more and more serious; in order to meet the increasing traffic demand, the need to improve the traffic conditions and the utilization efficiency of facilities in cities as soon as possible is urgent. According to the current development trend, according to the conjecture of professional people, the requirement on the parking lot is certainly increased due to the rapid increase of the number of private cars, and the current parking lot cannot meet the current parking requirement, so that the parking economy has a good development prospect. Along with the enlargement of the scale of the parking lot and the increase of the parking spaces, the effective management of the parking lot is more and more important, so that a set of efficient-operation intelligent parking lot management system is necessary to be developed according to the current demand on the parking lot.
The existing parking sharing systems are all in the relationship of user-server-parking space lock, so that the pressure of an intermediate server is increased, the system is very slow due to frequent blockage, or the system is directly rushed, and the user experience is very poor for the corresponding parking users on duty and off duty, and the requirements of the users cannot be met. It is therefore desirable to design a shared parking system that prevents high concurrency.
Disclosure of Invention
The invention aims to provide a data processing system and a data processing method for preventing high concurrency of shared parking spaces, and solves the technical problems that the existing parking space shared reservation system is often blocked, the system processes data slowly or the system is crashed.
In order to achieve the above object, the present invention provides a data processing method for preventing high concurrence by sharing a parking space, comprising the following steps:
step 1: a user initiates a parking space reservation request through a vehicle reservation and renting module and inputs specific parking place and time information;
step 2: the parking space reservation data processing module receives the request to search a corresponding proper parking space from the parking space reservation server module and returns the corresponding proper parking space to the reserved car renting module;
and step 3: the user selects the parking space through the reserved car renting module and returns the information of the selected parking space to the parking space reservation data processing module;
and 4, step 4: the parking space reservation data processing module transmits the determined reserved parking space data to the parking space reservation server module for storage and transmits the reserved parking space data to the parking encryption identification code generating module to generate an encryption identification code;
and 5: the parking encryption identification code generation module generates an encryption identification code and a secret key according to the determined reserved parking space, and transmits the unique secret key of the encryption identification code to the reserved car renting module and the encryption identification code to the parking space lock controller module;
step 6: a parking person arrives at a corresponding reserved parking space, clicks the parking space lock display screen module to park and unlock, the parking space lock controller module transmits the encrypted identification code to the parking space lock display screen module, and the identification code identification parking module identifies the encrypted identification code;
and 7: the identification code recognition parking module acquires a secret key from the car booking and transmits the secret key to the parking stall lock controller module through wireless to perform reverse decryption and encryption identification codes;
and 8: the parking space lock controller module controls the parking space lock open-close lock module to put down the parking space lock to park after decryption is successful, and the decryption is returned again after the decryption is unsuccessful;
and step 9: the user needs to pick up the car, the user identifies the decrypted identification code for payment through the identification code identification parking module, and the parking space lock controller module controls the parking space lock opening and closing lock module to put down the parking space lock to pick up the car.
Further, the specific process of generating the encrypted identification code in step 5 is as follows:
step 5.1: the parking encryption identification code generation module generates a two-dimensional code for the time and the place of the reserved parking space to form a two-dimensional code picture;
step 5.2: and encrypting the two-dimensional code image by an image quantum encryption method to obtain an encrypted two-dimensional code.
Further, the specific method of the image quantum encryption method in the step 5.2 is as follows:
firstly, a quantum image is subjected to the first 2 by utilizing a multi-quantum bit gaten-1+2 random phase transformations, then one quantum Fourier transformation, and then the second 2n-1And (5) performing +2 times of random phase transformation, and finally performing one time of inverse quantum Fourier transformation to obtain an encrypted image.
Further, the first 2 is performed on the quantum image by using the multi-quantum bit gaten-1The implementation process of +2 times of random phase transformation and one time of quantum Fourier transformation is as follows:
due to quantum ground state | j>＝|jn…j2j1>Can be written as | j>＝|jn…j2>|j1>Let | l>＝|jn…j2>Thus, the NASS quantum image representation can be rewritten as:
Figure GDA0002633331640000031
wherein
Figure GDA0002633331640000032
Representing the image at coordinate | l>|j1>Color information of (d);
then, random phase transformation is realized by utilizing a multi-quantum bit controlled gate
Figure GDA0002633331640000033
Wherein
Figure GDA0002633331640000034
a∈{0,1,…,2n-1-1}，ωaIs a random key randomly distributed between 0 and 2 pi; order to
Figure GDA0002633331640000035
Then use is made of gates controlled with n qubits
Figure GDA0002633331640000036
A can be realized by applying A to a quantum image represented by formula (1) to obtain
Figure GDA0002633331640000037
Thereby will be
Figure GDA0002633331640000038
In total 2n-1Adding a random key to the quantum image; order to
Figure GDA0002633331640000041
Where b is equal to {0,1}, ξbIs a random key randomly distributed between 0 and 2 pi; then, the random phase transformation is realized by using a double-quantum bit controlled gate
Figure GDA0002633331640000042
Wherein
Figure GDA0002633331640000043
Is the sign of a tensor operation, I is the identity matrix,
Figure GDA0002633331640000044
n-2 times tensor operation is carried out on the identity matrix I,
Figure GDA0002633331640000045
is two phase transformations (see equation (5)), let B be equal to V1V0Then B can be implemented using a dual quantum bit controlled gate; applying B to the quantum image | ψ represented by formula (4)2>Can obtain
Figure GDA0002633331640000046
Wherein
Figure GDA0002633331640000047
j＝jn…j2j1，l＝jn…j2Thus, λjIs made of random variables
Figure GDA0002633331640000048
And xi0,ξ1A combined random key;
then to | ψ3>Carrying out quantum Fourier transform to obtain | psi4>
Figure GDA0002633331640000049
Where QFT is the quantum Fourier transform, j, k are integers, and i is an imaginary unit.
Further, said performing a second 2 of the quantum image with the multi-quantum bit gaten-1The implementation process of +2 times of random phase transformation and one time of quantum Fourier inverse transformation is as follows: random phase transformation
Figure GDA0002633331640000051
Is defined as
Figure GDA0002633331640000052
Wherein
Figure GDA0002633331640000053
c∈{0,1,…,2n-1-1}，μcIs a random key randomly distributed between 0 and 2 pi; order to
Figure GDA0002633331640000054
And
Figure GDA0002633331640000055
where d is equal to 0,1,dis randomized between 0 and 2 piA distributed random key; then, the random phase transformation is realized by using a double-quantum bit controlled gate
Figure GDA0002633331640000056
Wherein
Figure GDA0002633331640000061
Is the sign of a tensor operation, I is the identity matrix,
Figure GDA0002633331640000062
n-2 times tensor operation is carried out on the identity matrix I,
Figure GDA0002633331640000063
is two phase transformations (see equation (12)), let D be W1W0(ii) a Then D × C, i.e. 2, can be achieved using multi-quantum bit controlled gatesn-1+2 random phase transformations; application of D × C to quantum image | ψ represented by formula (8)4>Can obtain
Figure GDA0002633331640000064
Wherein
Figure GDA0002633331640000065
k＝kn…k2k1，t＝kn…k2Thus, ηkIs made of random variables
Figure GDA0002633331640000066
And0,1a combined random key; finally, for | psi5>Carrying out quantum Fourier transform to obtain encrypted image | psi6>
Figure GDA0002633331640000067
Where iQFT is the inverse quantum Fourier transform, j, k, h are integers, and i is an imaginary unit.
Further, the process of reversely decrypting the encrypted identification code in step 7 is to perform inverse operation processing on the encryption process in step 5 by using the key.
A data processing system for preventing high concurrency of shared parking spaces comprises a user side, a processing side and a control side, wherein the user side is connected with the control side through the processing side;
the user side comprises a car booking and identification code recognition and parking module, and the car booking and identification code recognition and parking module is connected with the processing side; the reserved car renting module is used for initiating a request for reserving a parking space and inputting specific parking place and time information, and the identification code recognition parking module is used for receiving a secret key and decrypting the encrypted identification code by using the secret key;
the processing end comprises a parking space reservation data processing module, a parking space reservation server module and a parking encryption identification code generating module, the parking space reservation data processing module is respectively connected with the parking space reservation server module, the parking encryption identification code generating module and the reserved car renting module, and the parking encryption identification code generating module is used for being connected with the parking space reservation server module and the identification code recognition parking module; the parking space reservation data processing module receives the request to search a corresponding proper parking space from the parking space reservation server module and returns the corresponding proper parking space to the reserved car renting module; the parking space reservation server module is used for storing parking space data, reserved parking space data and reserved parking space records; the parking encrypted identification code generating module generates an encrypted identification code and a secret key according to the determined reserved parking space, and transmits the unique secret key of the encrypted identification code to the reserved car renting module and the encrypted identification code to the control end;
the control end comprises a relay station module, a parking space lock wireless module, a parking space lock display screen module, a parking space lock controller module, a parking space Bluetooth module and a parking space lock opening and closing lock module, wherein the parking space lock wireless module is connected with a parking encrypted identification code generation module through the relay station module, the parking space lock wireless module is connected with the parking space lock controller module, the parking space lock display screen module, the parking space Bluetooth module and the parking space lock opening and closing lock module are all connected with the parking space lock controller module, the parking space Bluetooth module is wirelessly connected with an identification code identification parking module, the relay station module is used for receiving the encrypted identification code generated by the parking encrypted identification code generation module and transmitting the encrypted identification code to the parking space lock controller module through the parking space lock wireless module, the parking space lock display screen module is used for displaying the encrypted identification code, the parking space Bluetooth module is used for receiving the decryption information of the identification code identification parking module and transmitting the decryption information, the parking space lock controller module controls the parking space lock to be put down and lifted through the parking space lock opening and closing module, and the encrypted identification code is changed into a plaintext identification code after being decrypted for one time and is used for scanning and paying parking fees.
The invention has the following beneficial effects:
the invention sets the form of the encrypted identification code, recognizes parking through the encrypted identification code, and simultaneously, the secret key of each encrypted identification code is single, so that a user cannot be preempted by people after reserving a parking space, and simultaneously, the encrypted identification code on the control end is directly recognized through the user end, thereby reducing the data processing in the stage of the server, well preventing the problem of data concurrency, and simultaneously, through a subimage encryption technology, not only can represent a gray level image but also can represent a color RGB image, and the invention is convenient to use, wherein the invention totally carries out 2 stepsn+4 random phase shifts, so there are 2 in totaln+4 keys transformed randomly, the key space is quite large, and it is difficult for an attacker to get the correct keys, just as each encryption is random.
In addition to the objects, features and advantages described above, other objects, features and advantages of the present invention are also provided. The present invention will be described in further detail below with reference to the drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the invention and, together with the description, serve to explain the invention and not to limit the invention. In the drawings:
FIG. 1 is a flow chart of a method of a preferred embodiment of the present invention.
Fig. 2 is a block diagram of system modules in accordance with a preferred embodiment of the present invention.
Detailed Description
Embodiments of the invention will be described in detail below with reference to the drawings, but the invention can be implemented in many different ways, which are defined and covered by the claims.
A data processing method for preventing high concurrency of shared parking spaces comprises the following steps:
step 1: and the user initiates a parking space reservation request through the vehicle reservation renting module and inputs specific parking place and time information.
Step 2: the parking space reservation data processing module receives the request to search a corresponding proper parking space from the parking space reservation server module and returns the corresponding proper parking space to the reserved car renting module.
And step 3: the user selects the parking space through the reserved car renting module and returns the information of the selected parking space to the parking space reservation data processing module.
And 4, step 4: the parking space reservation data processing module transmits the determined reserved parking space data to the parking space reservation server module for storage and transmits the reserved parking space data to the parking encryption identification code generating module to generate the encryption identification code.
And 5: the parking encryption identification code generation module generates an encryption identification code and a secret key according to the determined reserved parking space, and transmits the unique secret key of the encryption identification code to the reserved car renting module and the encryption identification code to the parking space lock controller module. The specific process of generating the encrypted identification code is as follows:
step 5.1: and the parking encryption identification code generation module generates a two-dimensional code for the time and the place of the reserved parking space to form a two-dimensional code picture.
Step 5.2: and encrypting the two-dimensional code image by an image quantum encryption method to obtain an encrypted two-dimensional code. The image quantum encryption method comprises the following specific steps:
firstly, a quantum image is subjected to the first 2 by utilizing a multi-quantum bit gaten-1+2 random phase transformations, then one quantum Fourier transformation, and then the second 2n-1+2 random phase transformations, and finally one inverse quantum Fourier transformAnd obtaining the encrypted image.
Basic knowledge:
tensor products are a method of combining small vector spaces together to form a larger vector space, using symbols
Figure GDA0002633331640000081
And (4) showing. For two ground states | u>And | v>Their tensor products
Figure GDA0002633331640000082
Common abbreviation | uv>，|u>|v>Or | u, v>Indicating, for example, for the ground state |0>And |1>Their tensor products can be expressed as
Figure GDA0002633331640000083
Tensor product of n times for matrix U
Figure GDA0002633331640000084
Can be abbreviated as
Figure GDA0002633331640000085
For quantum state | u>Tensor product of n times
Figure GDA0002633331640000086
Can also be abbreviated as
Figure GDA0002633331640000087
The NASS expression is:
Figure GDA0002633331640000091
Figure GDA0002633331640000092
the quantum Fourier transform is a key technology in quantum information processing and has wide application. Applying the quantum fourier transform QFT to a quantum ground state:
Figure GDA0002633331640000093
where | j>Is a ground state of n qubits, n being an integer, k being 0,1, 2n-1, i is an imaginary unit. Since the quantum fourier transform is unitary, the inverse quantum fourier transform is obtained by an inversion operation of the fourier transform, that is, iQFT × QFT is an identity matrix. Quantum implementation circuits of NASS, QFT and IQFT can be found in the existing literature
The first 2 is carried out on the quantum image by utilizing the multi-quantum bit gaten-1The implementation process of +2 times of random phase transformation and one time of quantum Fourier transformation is as follows:
due to quantum ground state | j>＝|jn…j2j1>Can be written as | j>＝|jn…j2〉|j1>Let | l>＝|jn…j2Thus, the NASS quantum image representation can be rewritten as:
Figure GDA0002633331640000094
wherein
Figure GDA0002633331640000095
Representing the image at coordinate | l>|j1>Color information of (d);
then, random phase transformation is realized by utilizing a multi-quantum bit controlled gate
Figure GDA0002633331640000096
Wherein
Figure GDA0002633331640000101
a∈{0,1,…,2n-1-1}，ωaIs a random key randomly distributed between 0 and 2 pi; order to
Figure GDA0002633331640000102
Then use is made of gates controlled with n qubits
Figure GDA0002633331640000103
A can be realized by applying A to a quantum image represented by formula (1) to obtain
Figure GDA0002633331640000104
Thereby will be
Figure GDA0002633331640000105
In total 2n-1Adding a random key to the quantum image; order to
Figure GDA0002633331640000106
Where b is equal to {0,1}, ξbIs a random key randomly distributed between 0 and 2 pi; then, the random phase transformation is realized by using a double-quantum bit controlled gate
Figure GDA0002633331640000107
Wherein
Figure GDA0002633331640000111
Is the sign of a tensor operation, I is the identity matrix,
Figure GDA0002633331640000112
n-2 times tensor operation is carried out on the identity matrix I,
Figure GDA0002633331640000113
is two phase transformations (see equation (5)), let B be equal to V1V0Then B can be implemented using a dual quantum bit controlled gate; applying B to the quantum image | ψ represented by formula (4)2>Can obtain
Figure GDA0002633331640000114
Wherein
Figure GDA0002633331640000115
j＝jn…j2j1，l＝jn…j2Thus, λjIs made of random variables
Figure GDA0002633331640000116
And xi0,ξ1A random key.
Then to | ψ3>Carrying out quantum Fourier transform to obtain | psi4>
Figure GDA0002633331640000117
Where QFT is the quantum Fourier transform, j, k are integers, and i is an imaginary unit.
Further, said performing a second 2 of the quantum image with the multi-quantum bit gaten-1The +2 random phase transformations and the quantum inverse Fourier transformation are realized in the following process. Random phase transformation
Figure GDA0002633331640000118
Is defined as
Figure GDA0002633331640000119
Wherein
Figure GDA00026333316400001110
c∈{0,1,…,2n-1-1}，μcIs a random key that is randomly distributed between 0 and 2 pi. Order to
Figure GDA0002633331640000121
And
Figure GDA0002633331640000122
where d is equal to 0,1,dis a random key randomly distributed between 0 and 2 pi; the random phase transformation is then implemented using a two-quantum bit-controlled gate.
Figure GDA0002633331640000123
Wherein
Figure GDA0002633331640000124
Is the sign of a tensor operation, I is the identity matrix,
Figure GDA0002633331640000125
n-2 times tensor operation is carried out on the identity matrix I,
Figure GDA0002633331640000126
is two phase transformations (see equation (12)), let D be W1W0(ii) a Then D × C, i.e. 2, can be achieved using multi-quantum bit controlled gatesn-1+2 random phase transformations. Application of D × C to quantum image | ψ represented by formula (8)4>Can obtain
Figure GDA0002633331640000127
Wherein
Figure GDA0002633331640000131
k＝kn…k2k1，t＝kn…k2Thus, ηkIs made of random variables
Figure GDA0002633331640000132
And0,1a combined random key; finally, for | psi5>Carrying out quantum Fourier transform to obtain encrypted image | psi6>
Figure GDA0002633331640000133
Where iQFT is the inverse quantum Fourier transform, j, k, h are integers, and i is an imaginary unit.
Step 6: the parking person comes to the parking space of corresponding reservation, clicks the parking stall lock display screen module to park and unlock, and the parking stall lock controller module transmits the encrypted identification code to the parking stall lock display screen module, and the identification code identification parking module identifies the encrypted identification code.
And 7: the identification code recognition parking module acquires a secret key from the reserved car renting module and transmits the secret key to the parking space lock controller module through wireless to perform reverse decryption and encryption identification codes. The process of reversely decrypting the encrypted identification code is to perform inverse operation processing on the encryption process in the step 5 by using the secret key. After the identification code identifies the parking module, the identification information is transmitted to the parking space Bluetooth module to inform the parking space Bluetooth module of controlling the landing of the parking space lock.
And 8: and if the decryption is successful, the parking space lock controller module controls the parking space lock opening and closing lock module to put down the parking space lock to park, the parking is finished, and if the decryption is unsuccessful, the decryption is returned again.
And step 9: the user needs to pick up the car, the user identifies the decrypted identification code for payment through the identification code identification parking module, and the parking space lock controller module controls the parking space lock opening and closing lock module to put down the parking space lock to pick up the car.
A data processing system for preventing high concurrency of shared parking spaces comprises a user side, a processing side and a control side, wherein the user side is connected with the control side through the processing side.
The user side comprises a car renting reservation module and an identification code recognition parking module. The reserved car renting module and the identification code recognition parking module are both connected with the processing end; the reserved car renting module is used for initiating a request for reserving a parking space and inputting specific parking place and time information, and the identification code recognition parking module is used for receiving the secret key and decrypting the encrypted identification code by using the secret key.
The processing end comprises a parking space reservation data processing module, a parking space reservation server module and a parking encryption identification code generating module. The parking space reservation data processing module is respectively connected with the parking space reservation server module, the parking encryption identification code generation module and the reserved car renting module, and the parking encryption identification code generation module is used for being connected with the parking space reservation server module and the identification code recognition parking module. The parking space reservation data processing module receives the request to search a corresponding proper parking space from the parking space reservation server module and returns the corresponding proper parking space to the reserved car renting module. The parking space reservation server module is used for storing parking space data, reserved parking space data and reserved parking space records. The parking encrypted identification code generation module generates an encrypted identification code and a secret key according to the determined reserved parking space, and transmits the unique secret key of the encrypted identification code to the reserved car renting module and the encrypted identification code to the control end.
The control end comprises a relay station module, a parking space lock wireless module, a parking space lock display screen module, a parking space lock controller module, a parking space Bluetooth module and a parking space lock opening and closing lock module. The parking space lock wireless module is connected with the parking encrypted identification code generation module through the relay station module, and is connected with the parking space lock controller module. The parking space lock display screen module, the parking space Bluetooth module and the parking space lock opening and closing module are all connected with the parking space lock controller module. Parking stall bluetooth module and identification code discernment parking module wireless connection. The relay station module is used for receiving the encrypted identification code generated by the parking encrypted identification code generation module and transmitting the encrypted identification code to the parking lock controller module through the parking lock wireless module. The parking space lock display screen module is used for displaying the encrypted identification code, and the parking space Bluetooth module is used for receiving the identification code, identifying decryption information of the parking module and transmitting the decryption information to the parking space lock controller module. The parking space lock controller module controls the parking space lock to be put down and lifted through the parking space lock opening and closing module, and the encrypted identification code is converted into a plaintext identification code after being decrypted for one time and is used for scanning and paying parking cost.
The parking spot lock wireless module is WIFI or a radio frequency module and is used for finishing communication between the relay station module and each parking spot. The parking space lock display screen module is a touch display screen module and is used for displaying and inputting a search instruction by a user, such as specific parking cost. The user side is a mobile phone side or a tablet personal computer and the like, and is used for being carried about by the user, and parking reservation and the like are facilitated.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (3)

1. A data processing method for preventing high concurrency by sharing a parking space is characterized by comprising the following steps:
step 1: a user initiates a parking space reservation request through a vehicle reservation and renting module and inputs specific parking place and time information;
step 2: the parking space reservation data processing module receives the request to search a corresponding proper parking space from the parking space reservation server module and returns the corresponding proper parking space to the reserved car renting module;
and step 3: the user selects the parking space through the reserved car renting module and returns the information of the selected parking space to the parking space reservation data processing module;
and 4, step 4: the parking space reservation data processing module transmits the determined reserved parking space data to the parking space reservation server module for storage and transmits the reserved parking space data to the parking encryption identification code generating module to generate an encryption identification code;
and 5: the parking encryption identification code generation module generates an encryption identification code and a secret key according to the determined reserved parking space, and transmits the unique secret key of the encryption identification code to the reserved car renting module and the encryption identification code to the parking space lock controller module;
step 6: a parking person arrives at a corresponding reserved parking space, clicks the parking space lock display screen module to park and unlock, the parking space lock controller module transmits the encrypted identification code to the parking space lock display screen module, and the identification code identification parking module identifies the encrypted identification code;
and 7: the identification code recognition parking module acquires a secret key from the car booking and transmits the secret key to the parking stall lock controller module through wireless to perform reverse decryption and encryption identification codes;
and 8: the parking space lock controller module controls the parking space lock open-close lock module to put down the parking space lock to park after decryption is successful, and the decryption is returned again after the decryption is unsuccessful;
and step 9: the user needs to pick up the car, the user recognizes the decrypted identification code for payment through the identification code recognition parking module, and the parking space lock controller module controls the parking space lock opening and closing lock module to put down the parking space lock to pick up the car;
the specific process of generating the encrypted identification code in the step 5 is as follows:
step 5.1: the parking encryption identification code generation module generates a two-dimensional code for the time and the place of the reserved parking space to form a two-dimensional code picture;
step 5.2: encrypting the two-dimensional code image by an image quantum encryption method to obtain an encrypted two-dimensional code;
the specific method of the image quantum encryption method in the step 5.2 is as follows:
firstly, a quantum image is subjected to the first 2 by utilizing a multi-quantum bit gaten-1+2 random phase transformations, then one quantum Fourier transformation, and then the second 2n-1+2 times of random phase transformation, and finally carrying out inverse quantum Fourier transform once to obtain an encrypted image;
the first 2 is carried out on the quantum image by utilizing the multi-quantum bit gaten-1The implementation process of +2 times of random phase transformation and one time of quantum Fourier transformation is as follows:
due to quantum ground state | j>＝|jn…j2j1>Can be written as | j>＝|jn…j2>|j1>Let | l>＝|jn…j2>Thus, the NASS quantum image representation can be rewritten as:
Figure FDA0002633331630000021
wherein
Figure FDA0002633331630000022
Representing the image at coordinate | l>|j1>Color information of (d);
then, random phase transformation is realized by utilizing a multi-quantum bit controlled gate
Figure FDA0002633331630000023
Wherein
Figure FDA0002633331630000024
a∈{0,1,…,2n-1-1}，ωaIs a random key randomly distributed between 0 and 2 pi; order to
Figure FDA0002633331630000025
Then use is made of gates controlled with n qubits
Figure FDA0002633331630000026
A can be realized by applying A to a quantum image represented by formula (1) to obtain
Figure FDA0002633331630000027
Thereby will be
Figure FDA0002633331630000028
In total 2n-1Adding a random key to the quantum image; order to
Figure FDA0002633331630000031
Where b is equal to {0,1}, ξbIs a random key randomly distributed between 0 and 2 pi; then, the random phase transformation is realized by using a double-quantum bit controlled gate
Figure FDA0002633331630000032
Wherein
Figure FDA0002633331630000033
Is the sign of a tensor operation, I is the identity matrix,
Figure FDA0002633331630000034
n-2 times tensor operation is carried out on the identity matrix I,
Figure FDA0002633331630000035
is two phase transformations (see equation (5)), let B be equal to V1V0Then B can be implemented using a dual quantum bit controlled gate; applying B to the quantum image | ψ represented by formula (4)2>Can obtain
Figure FDA0002633331630000036
Wherein λj＝ωl+ξj1，j＝jn…j2j1，l＝jn…j2Thus, λjIs made of random variables
Figure FDA0002633331630000037
And xi0,ξ1A combined random key;
then to | ψ3>Carrying out quantum Fourier transform to obtain | psi4>
Figure FDA0002633331630000038
Wherein QFT is the quantum Fourier transform, j, k are integers, i is an imaginary unit;
said performing a second 2 of the quantum image using the multi-quantum bit gaten-1The implementation process of +2 times of random phase transformation and one time of quantum Fourier inverse transformation is as follows: random phase transformation
Figure FDA0002633331630000041
Is defined as
Figure FDA0002633331630000042
Wherein
Figure FDA0002633331630000043
c∈{0,1,…,2n-1-1}，μcIs a random key randomly distributed between 0 and 2 pi; order to
Figure FDA0002633331630000044
And
Figure FDA0002633331630000045
where d is equal to 0,1,dis a random key randomly distributed between 0 and 2 pi; then, the random phase transformation is realized by using a double-quantum bit controlled gate
Figure FDA0002633331630000046
Wherein
Figure FDA0002633331630000051
Is the sign of a tensor operation, I is the identity matrix,
Figure FDA0002633331630000052
n-2 times tensor operation is carried out on the identity matrix I,
Figure FDA0002633331630000053
is two phase transformations (see equation (12)), let D be W1W0(ii) a Then D × C, i.e. 2, can be achieved using multi-quantum bit controlled gatesn-1+2 random phase transformations; application of D × C to quantum image | ψ represented by formula (8)4>Can obtain
Figure FDA0002633331630000054
Wherein
Figure FDA0002633331630000055
k＝kn…k2k1，t＝kn…k2Thus, ηkIs made of random variables
Figure FDA0002633331630000056
And0,1a combined random key; finally, for | psi5>Carrying out quantum Fourier transform to obtain encrypted image | psi6>
Figure FDA0002633331630000057
Where iQFT is the inverse quantum Fourier transform, j, k, h are integers, and i is an imaginary unit.
2. The data processing method for preventing high concurrency for shared parking spaces according to claim 1, wherein the step 7 of reversely decrypting the encrypted identification code is to perform inverse operation on the encryption process in the step 5 by using a secret key.
3. The system for sharing a data processing method for preventing high concurrency for a parking space according to any one of claims 1-2, comprising a user side, a processing side and a control side, wherein the user side is connected with the control side through the processing side;
the user side comprises a car booking and identification code recognition and parking module, and the car booking and identification code recognition and parking module is connected with the processing side; the reserved car renting module is used for initiating a request for reserving a parking space and inputting specific parking place and time information, and the identification code recognition parking module is used for receiving a secret key and decrypting the encrypted identification code by using the secret key;
the processing end comprises a parking space reservation data processing module, a parking space reservation server module and a parking encryption identification code generating module, the parking space reservation data processing module is respectively connected with the parking space reservation server module, the parking encryption identification code generating module and the reserved car renting module, and the parking encryption identification code generating module is used for being connected with the parking space reservation server module and the identification code recognition parking module; the parking space reservation data processing module receives the request to search a corresponding proper parking space from the parking space reservation server module and returns the corresponding proper parking space to the reserved car renting module; the parking space reservation server module is used for storing parking space data, reserved parking space data and reserved parking space records; the parking encrypted identification code generating module generates an encrypted identification code and a secret key according to the determined reserved parking space, and transmits the unique secret key of the encrypted identification code to the reserved car renting module and the encrypted identification code to the control end;
the control end comprises a relay station module, a parking space lock wireless module, a parking space lock display screen module, a parking space lock controller module, a parking space Bluetooth module and a parking space lock opening and closing lock module, wherein the parking space lock wireless module is connected with a parking encrypted identification code generation module through the relay station module, the parking space lock wireless module is connected with the parking space lock controller module, the parking space lock display screen module, the parking space Bluetooth module and the parking space lock opening and closing lock module are all connected with the parking space lock controller module, the parking space Bluetooth module is wirelessly connected with an identification code identification parking module, the relay station module is used for receiving the encrypted identification code generated by the parking encrypted identification code generation module and transmitting the encrypted identification code to the parking space lock controller module through the parking space lock wireless module, the parking space lock display screen module is used for displaying the encrypted identification code, the parking space Bluetooth module is used for receiving the decryption information of the identification code identification parking module and transmitting the decryption information, the parking space lock controller module controls the parking space lock to be put down and lifted through the parking space lock opening and closing module, and the encrypted identification code is changed into a plaintext identification code after being decrypted for one time and is used for scanning and paying parking fees.
CN201810908794.XA 2018-08-10 2018-08-10 Data processing system and method for preventing high concurrency by sharing parking space Active CN108847050B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810908794.XA CN108847050B (en) 2018-08-10 2018-08-10 Data processing system and method for preventing high concurrency by sharing parking space

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810908794.XA CN108847050B (en) 2018-08-10 2018-08-10 Data processing system and method for preventing high concurrency by sharing parking space

Publications (2)

Publication Number Publication Date
CN108847050A CN108847050A (en) 2018-11-20
CN108847050B true CN108847050B (en) 2020-10-30

Family

ID=64192845

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810908794.XA Active CN108847050B (en) 2018-08-10 2018-08-10 Data processing system and method for preventing high concurrency by sharing parking space

Country Status (1)

Country Link
CN (1) CN108847050B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109741627A (en) * 2019-02-26 2019-05-10 湖南正维新能源科技有限责任公司 A kind of shared parking stall data processing system and its method

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3908106B2 (en) * 2002-06-27 2007-04-25 日本電信電話株式会社 Quantum information dispersion generation method and apparatus
CN105575173B (en) * 2015-12-21 2019-07-05 应石磊 A kind of intelligent parking communication system and reservation parking method
CN106652226A (en) * 2016-08-31 2017-05-10 杭州金通公共自行车科技股份有限公司 Electronic bicycle lock based on electronic paper displaying QR code
CN107153632B (en) * 2017-05-10 2021-04-20 广西师范大学 Method for realizing quantum circuit design by quantum Haar wavelet transform
CN107424323A (en) * 2017-06-21 2017-12-01 成都信息工程大学 Private savings parking stall idle leasing system and its control method
CN107481364A (en) * 2017-08-04 2017-12-15 深圳欧米智能科技有限公司 A kind of communication means and electronic lock for controlling shared electronic lock for bicycle

Also Published As

Publication number Publication date
CN108847050A (en) 2018-11-20

Similar Documents

Publication Publication Date Title
CN105637916B (en) Authorization access to vehicle data
CN107527518B (en) Parking space sharing method and system based on intelligent ground lock
CN107146125B (en) Bicycle leasing system convenient for renting and returning bicycles and using method thereof
CN111200496B (en) Digital key implementation method based on vehicle
CN105847282A (en) Vehicle control method, server and system
CN104076779A (en) Reserving device of field service sharing of new energy automobiles in large-scale entrepreneurship park
CN1500242A (en) Enabling and disabling software features
CN102196431A (en) Internet of things application scene-based protection method of privacy query and private identity verification
CN111325917B (en) Using method and device of sharing equipment, storage medium and equipment
JP2011039712A (en) Car sharing system
CN104361688A (en) Card-free self-help leasing and returning device and method for urban public bicycles
US20120284519A1 (en) Implementing method, system of universal card system and smart card
CN108847050B (en) Data processing system and method for preventing high concurrency by sharing parking space
CN109508977A (en) A kind of end-to-end Car sharing system and method based on block chain
CN107067249B (en) Encryption method applied to intelligent ground lock leasing system
CN109166216A (en) A kind of control method and device of smart bluetooth door lock
CN109191230A (en) Vehicle leasing method, equipment and storage medium
CN203366415U (en) Authentication system based on visible light communication
CN106534221B (en) Appointment time switching device agreed by remote non-networking encryption algorithm and control method
EP2716510B1 (en) Authentication system and method for a pool of vehicles
CN107341656A (en) A kind of interactive coded image recognition methods and system
CN104963304A (en) Bluetooth barrier gate
CN110298363A (en) A kind of secret protection LBP feature extracting method on encrypted image
JP7027834B2 (en) Information processing equipment, information processing method, information processing program
KR102240926B1 (en) System for providing real estate rental management service using doorlock

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20200525

Address after: Six East Road, economic and Technological Development Zone of Hunan province 410000 Changsha No. 77 Jinke Yida technology city building C1 layer (cluster registration)

Applicant after: Hunan Xiaozha Technology Co., Ltd

Address before: 410000 Changsha, Hunan, Kaifu District, four side Ping Street, No. 9 double support Road, the Great Wall, Wanfu Building 9, 9038 rooms.

Applicant before: HUNAN ZHENGWEI NEW ENERGY TECHNOLOGY Co.,Ltd.

GR01 Patent grant
GR01 Patent grant