JP2022093673A - Parking lot management system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reduce a load on a communication facility of a unit inside a parking lot by transmitting information received from the unit inside the parking lot to a server outside the parking lot at a remote place via communication equipment of a user concerning a system where the server outside the parking lot integrally performs remote management of a plurality of parking lots.

SOLUTION: A unit 30 inside a parking lot transmits parking lot information to identify one of parking lots 20 to communication equipment 90 of a user by a local communication method. The communication equipment 90 transmits the parking lot information received from the unit 30 inside the parking lot to a server 50 outside the parking lot as a repeater. The server 50 outside the parking lot identifies one of the parking lot based on the received parking lot information, permits the identified parking lot to be lent to a user, and transmits a code number associated with the identified parking lot to the communication equipment 90 as visualization data. The code number is input by the user to a parking lot management system 500 by association with the identified parking lot.

SELECTED DRAWING: Figure 18

COPYRIGHT: (C)2022,JPO&INPIT

Description

The present invention relates to a technique for lending and returning a rental object to a user, and particularly in a system in which a server outside the parking lot centrally and remotely manages a plurality of parking lots, a unit in the parking lot via a communication device of the user. It relates to a technique for transmitting the information received from the parking lot to a remote server outside the parking lot, thereby reducing the burden on the communication equipment of the parking lot.

In recent years, services for lending and returning rental objects to users have become widespread. Various rental targets already exist, and new ones may exist in the future. Existing rentals extend to tangible properties and real estate, as well as audiovisual content as intangibles (eg, content represented by data that is not fixed on a recording medium).

Rental targets for animal products include, for example, land, water or flying vehicles (eg, for transportation or entertainment), furniture, clothing, appliances, and accessories that are detachably attached to appliances (eg, batteries). Or a charger), a recording medium (for example, a CD) on which audiovisual content is recorded, which can be played by a user. The rental target as real estate includes, for example, a room of an accommodation facility (for example, a hotel) where a user can stay for a short period of time or a room of an accommodation facility (for example, an apartment) where a user can stay for a long period of time, a coin locker, and the like. There are individual parking spaces in the parking lot.

For example, a bicycle can be rented as a land vehicle. For example, in tourist areas, there is a service for renting a bicycle to a traveler as a means for a traveler to travel to the destination, and in an urban area, a bicycle is used as a means for commuting or other transportation to a user. There is a service to rent.

Specific techniques for providing services for renting and returning bicycles to users have already been proposed.

For example, Patent Document 1 discloses a technique for managing each station by communicating with an external management center in order to rent a bicycle. This technique assigns a two-dimensional code to each bicycle and displays it on the first print medium, and assigns a two-dimensional code to each station and displays it on the second print medium. The point that each bicycle is locked to store each bicycle, and the user reads the two-dimensional code of the bicycle he / she wants to rent and manages the information via the user's mobile communication device. It is characterized in that it is transmitted to the center, whereby the management center recognizes the bicycle this time.

The technique further allows the user to read the two-dimensional code of the station in which he or she is present and transmit the information to the management center via the user's mobile communication device, whereby the management center is the station this time. When the bicycle is rented, the management center sends the unlocking number of the key to the user's mobile communication device, and when the unlocking number is received, the user receives the unlocking number. It is characterized in that the key is unlocked by using.

Further, Patent Document 2 also discloses a technique for managing each station by communicating with an external management center in order to rent a bicycle. This technology uses a key for each bicycle, and when the management center receives the vehicle number of the bicycle that the user wants to borrow from the user's mobile communication device, the key is unlocked to unlock the bicycle. It is characterized in that a signal is transmitted to the key and the key is automatically unlocked when the unlock signal is received.

Further, Patent Document 3 discloses a technique for independently managing each station in order to rent a bicycle. This technology installs a numerical input unit and a bicycle parking management unit (having a storage device) common to multiple bicycles in the same station, and a bicycle lock control unit for each bicycle, and each bicycle lock control. The point that the unit uses a key, the point that a unique device number is assigned to each bicycle lock control unit, and the bicycle parking management unit receives the device number and the password (from the user via the numerical input unit). The bicycle lock control unit is controlled to unlock the key when the bicycle lock control unit is received (a password registered in advance by the user to identify the person).

Further, Patent Document 4 also discloses a technique for managing each station by communicating with an external management center in order to rent a bicycle. In this technology, a stand is installed for each bicycle in the same station, the stand uses a key, and the management center is specified from the user to the portable communication device via the portable communication device. When an operation message representing the stand is received, an unlock signal for unlocking the key is transmitted to the specific stand, and when the unlock signal is received, the key is unlocked. And.

Further, Patent Document 5 discloses a technique of encrypting the current time and displaying it every moment on the display of a ticket issuing machine installed in a parking lot.

Japanese Unexamined Patent Publication No. 2011-248913 Japanese Patent No. 50008108 Japanese Patent No. 5507916 U.S. Patent Application Publication No. 2012/0196631 Japanese Patent No. 5340466

In the above-mentioned bicycle rental service, there is a case where it is important for the management center to correctly grasp which of the plurality of stations the user rents or returns the bicycle.

One example of such a case is a billing rule adopted by the management center to calculate the amount of rental fees charged to a user, where a user returns the bicycle at the same station as the one that rented it. This is an example of adopting a billing rule so that the amount of the rental fee charged to the user differs between the case of performing the above and the case of returning the bicycle at another station.

Another example is by accurately grasping the station where the bicycle was rented each time the bicycle was rented, and by accurately grasping the station where the bicycle was returned each time the bicycle was returned. Calculate the balance of the number of bicycles at each station (for example, estimate the number of bicycles that can be rented from moment to moment), and based on the result, multiple bicycles are deployed at each station in just proportion. This is an example of bicycles being distributed between stations as appropriate.

However, when the user stores information for identifying the rented station and communicates the same information to the management center at the time of return, the returning station and the rented station will be displayed. In fact, regardless of whether it is the same or different, the management center recognizes that the user has returned the item at the same station as the station where the user rented the item.

Therefore, the user abuses such a reality, and even though the user actually returns the frog at a station different from the rented station, the information for intentionally identifying the rented station is provided. There is a possibility of fraudulent activity of communicating the same information to the management center when returning it.

Further, conventionally, there has been a system in which a management server centrally and remotely manages a plurality of stations. In this system, it is required that the station-side unit reduces the burden on the communication equipment for transmitting necessary information to the management server at a remote location.

In the above, the problem of renting and returning the rental target to the user has been described by taking the case where the rental target is a bicycle as an example. However, the same problem is that the user rents and returns another type of rental target. It also exists when doing to.

Based on the above findings, the present invention is a system in which a server outside the parking lot centrally manages a plurality of parking lots remotely, and the unit inside the parking lot transmits necessary information to the server outside the parking lot at a remote location. The challenge was to provide technology to reduce the burden on communication equipment for this purpose.

In order to solve the problem , according to an aspect of the present invention, it is a parking lot management system that manages lending or returning to users of a plurality of parking lots for each parking lot.
A parking lot unit that transmits parking lot information for identifying each parking lot to the communication device of the user in each parking lot by a local communication method.
With a server outside the parking lot that remotely and centrally manages lending or returning to users of the plurality of parking lots by communicating with the communication device of the user who wishes to use one of the parking lots.
Including
When the user's communication device receives the parking lot information corresponding to any of the parking lots from the parking lot unit as a repeater between the parking lot unit and the parking lot outside server, the received parking lot is received. Send the parking lot information to the server outside the parking lot,
The server outside the parking lot
A receiving unit that receives the parking lot information from the user's communication device,
Based on the received parking lot information, the parking lot identification unit that identifies any of the above parking lots, and
With a transmitter that permits the specified parking lot to be rented to the user and transmits the password associated with the specified parking lot as visualization data to the user's communication device.
Including
A parking lot management system is provided in which the personal identification number is input by the user in association with the specified parking lot.

Further , according to one aspect of the present invention, it is a parking lot management system.
Multiple parking lot units installed in multiple parking lots,
Including a server outside the parking lot that is commonly used for the above-mentioned multiple parking lots and centrally and remotely manages those parking lots.
Each parking lot has multiple individual parking spaces
Each parking lot unit transmits payment-related information necessary for the user to settle the fee for the user to use one of the parking lots to the user's communication device by a local communication method.
The user's communication device, as a repeater between the in-parking lot unit and the out-of-parking lot server, uses the payment-related information received from the in-parking lot unit installed in any of the parking lots to be parked in any of the above-mentioned parking lots. Along with the space identification information that identifies the one used by the user among the plurality of individual parking spaces in the parking lot, the information is transmitted to the server outside the parking lot by a wireless communication method.
The parking lot out-of-parking server receives the payment-related information from the user's communication device together with the space-specific information by a wireless communication method, and stores the received payment-related information and the received space-specific information in a memory in association with each other. Based on the payment-related information, a parking lot management system that performs processing for electronically paying the parking fee of the parking lot used by the user is provided.

In an example of this parking lot management system, the parking lot unit broadcasts the payment-related information to communication devices of an unspecified number of users who use the parking lot in which the parking lot unit is installed. Send and
When the communication device of the user who intends to make a payment receives the payment-related information from the unit in the parking lot, the payment-related information is transmitted to the server outside the parking lot together with the space-specific information about the user this time by a wireless communication method. ..

In one example of those parking lot management systems, the payment-related information is specific to the time information required for the user using any of the parking lots to settle the parking fee and the parking lot. Includes parking lot ID.

Further, according to an aspect of the present invention, it is a parking lot management system.
Multiple parking lot units installed in multiple parking lots,
Including a server outside the parking lot that is commonly used for the above-mentioned multiple parking lots and centrally and remotely manages those parking lots.
Each parking lot has multiple individual parking spaces
Each parking unit is
It has a transmitter that transmits payment-related information necessary for the user to settle the fee for using one of the parking lots to the user's communication device by a local communication method.
The user's communication device is
A receiving unit that receives payment-related information from the transmitting unit of the parking lot unit installed in any of the parking lots.
A transmission unit that transmits the received payment-related information to the server outside the parking lot by wireless communication method together with the space specific information that specifies the space-specific information used by the user among the plurality of individual parking spaces in any of the parking lots. Including,
The server outside the parking lot is
A receiving unit that receives the payment-related information from the user's communication device together with the space-specific information by a wireless communication method.
A storage unit that stores the received payment-related information and the received space-specific information in a memory in association with each other.
Based on the space specific information received from the user's communication device, the corresponding payment-related information is read from the memory, and based on the read payment-related information, an amount of charge commensurate with the usage time of the parking lot used by the user is charged. A payment processing unit that performs processing to settle the charges by a payment method that is one of bank payment, credit card payment, and prepaid payment in order to collect from the user.
When the payment of the fee is completed, a parking lot management system including a transmitter for transmitting a signal indicating the completion of payment of the fee to the user's communication device is provided.

In an example of this parking lot management system, the transmission unit of the parking lot unit uses the payment-related information in a communication device of an unspecified number of users who use the parking lot in which the parking lot unit is installed. Broadcast to
When the communication device of the user who intends to make a payment receives the payment-related information from the transmission unit of the unit in the parking lot, the payment-related information is received by the server outside the parking lot together with the space-specific information about the user this time. Send to the unit by wireless communication method.

In one example of those parking lot management systems, the payment-related information is unique to the time information required for the user who uses any of the parking lots to settle the usage fee and the parking lot. Includes parking lot ID and.

Further, according to one aspect of the present invention, at each of the plurality of stations capable of storing at least one rental object, the rental of the at least one rental object is performed by using the communication device carried by the user. Is a rental system that provides users with
At each station, a signal representing a unique station ID is transmitted to the communication equipment of an unspecified number of users or a specified number of users in the station so that the signal cannot be normally received outside the area of the station. A station-side unit with a transmitter and
In each rental target, the target unit that provides a unique target ID to the user at the corresponding station who wishes to rent the rental target, and
A management server capable of communicating with a user's communication device, including a server that manages the plurality of stations in a remote location.
The user's communication device at any station receives the signal from the station-side unit of the station and is selected by the user from at least one rental target stored in the station. The target ID is acquired from the target unit of the selective rental target, and the station ID represented by the received signal and the acquired target ID are transmitted to the management server.
The management server is provided with a rental system that permits the user to rent the selected rental target based on the received station ID and target ID.

Further, according to an aspect of the present invention, at each of a plurality of stations capable of storing at least one rental object, the rental of the at least one rental object is performed by using a communication device carried by the user. Is a rental system that provides users with
At each station, a signal representing a combination of a unique station ID and time information is directed to the communication equipment of an unspecified number of users or a specified number of users at the station, and outside the area of the station. Then, the station side unit that makes a call so that it cannot be received normally,
In each rental target, a target unit that presents a unique target ID to a user at the corresponding station who wishes to rent the rental target in a state in which the communication device of the user can read the computer.
A management server capable of communicating with a user's communication device, including a server that manages the plurality of stations in a remote location.
The user's communication device at any station acquires the signal from the station-side unit of the station, and is selected by the user from at least one rental target stored in the station. The target ID is acquired from the target unit to be selected and rented, and the station ID and time information represented by the acquired signal are transmitted to the management server in a state of being combined with each other, and the acquisition is associated with them. The target ID is sent to the management server,
The management server is provided with a rental system that permits the user to rent the selected rental target based on the received station ID, time information, and target ID.

Further, according to the first aspect of the present invention, it is a rental system that rents and returns the at least one rental object to the user at each of a plurality of stations capable of storing at least one rental object. There is an encryption unit that is associated with each station position and encrypts the information before encryption using an encryption algorithm to generate encryption that is dynamic with respect to time and station position from moment to moment. At each station, a rental system is provided that includes a provider that provides the generated ciphers to users at each station.

Further, according to the second aspect of the present invention, it is a rental method in which the user is rented and returned the at least one rental object at each of a plurality of stations capable of storing at least one rental object. The computer encrypts the pre-encrypted information in association with each station location using an encryption algorithm, thereby generating an encryption that is dynamic both in terms of time and station location from moment to moment. And, at each station, a rental method including a providing process of providing the generated cipher to a user at each station is provided.

Each of the following aspects is obtained by the present invention. Each aspect shall be divided into sections, each section shall be numbered, and the numbers of other sections shall be quoted as necessary. This is to facilitate understanding of some of the technical features that can be adopted by the present invention and their combinations, and the technical features that can be adopted by the present invention and their combinations are limited to the following aspects. Should not be interpreted as. That is, it should be interpreted that it is not hindered from appropriately extracting and adopting the technical features described in the present specification as the technical features of the present invention, which are not described in the following aspects.

Furthermore, describing each section in the form of quoting the numbers of the other sections does not necessarily prevent the technical features described in each section from being separated and independent from the technical features described in the other sections. It does not mean, and it should be interpreted that the technical features described in each section can be made independent as appropriate according to their properties.

(1) A rental device installed for a user to rent and return at least one rental object at each of a plurality of stations capable of storing at least one rental object.
At each station location, it includes a display that occasionally displays a code that is dynamic with respect to time and station location.
The encryption is a rental device transmitted by a user to a management center that remotely manages the plurality of stations via a communication device.

Throughout the documents of this application, the term "time" is interpreted to mean time in a narrow sense, that is, temporal information indicating the position of a point having no length on the time axis, or in a broad sense. It can be interpreted to mean the time of time, that is, the temporal information representing the position of one area having a length, that is, the time zone on the time axis.

(2) The at least one rental target is a vehicle, furniture, clothes, electric appliances, a battery, a charger, a recording medium on which audiovisual contents are recorded, a room where people can stay, an individual storage space in a coin locker, and a parking lot. The rental device according to item (1), which includes at least one of the individual parking spaces of the above.

(3) Further, it includes an encryption unit that generates the encryption every moment by encrypting the information before encryption using an encryption algorithm.
Is the combination of the pre-encrypted information and the encryption algorithm dynamic at least one of the pre-encrypted information and the encryption algorithm with respect to time, but at least with respect to the station position? , Or at least one of those pre-encrypted information and encryption algorithms is configured to be dynamic with respect to time and station location.
The cipher is
The nature that the user cannot decipher,
The property that if a user is actually present or in the past at any station, the user cannot obtain a genuine cipher unless he or she is actually present or past at that station.
It has the property that the management center can decipher and estimate that the user was actually at the station or was in the past.
The management center decrypts the encryption received from the user by using the same encryption algorithm for decryption, thereby estimating the station where the user is actually present or was in the past. The rental device according to item (1) or (2).

(4) A bicycle rental device installed at each of a plurality of stations capable of storing a plurality of bicycles in order to rent and return the bicycles to the user.
At each station location, it includes a display that occasionally displays a code that is dynamic with respect to time and station location.
The cipher is a bicycle rental device transmitted by a user to a management center that remotely manages the plurality of stations via a communication device.

(5) Further, it includes an encryption unit that generates the encryption every moment by encrypting the information before encryption using an encryption algorithm.
The pre-encrypted information includes information about at least one of the time and the station location.
Is the combination of the pre-encrypted information and the encryption algorithm dynamic at least one of the pre-encrypted information and the encryption algorithm with respect to time, but at least with respect to the station position? , Or at least one of those pre-encrypted information and encryption algorithms is configured to be dynamic with respect to time and station location.
The cipher is
The nature that the user cannot decipher,
If the user is actually at any station at any time, the user cannot get it unless he or she is actually at that station at that time.
It has the property that the management center can decipher and estimate that the user is actually at the station at that exact time.
The management center decrypts the cipher received from the user by using the same encryption algorithm for decryption, thereby determining the station where the user is actually present and the time when the user is actually present at the station. The bicycle rental device according to item (4).

(6) A bicycle rental system that rents and returns bicycles to users at multiple stations that store multiple bicycles.
A display unit that is installed in each of the multiple stations and displays a code that is dynamic with respect to time and station position from moment to moment.
When a code currently displayed on the display unit is transmitted to the center-side unit using a communication device that is installed in a management center that remotely manages the plurality of stations and can be used by a user, the code is received. A bicycle rental system that includes an analyzer that estimates the station where the user is actually and the time when the user is actually at the station by analyzing the received cipher.

(7) A bicycle rental system that rents and returns bicycles to users at multiple stations that store multiple bicycles.
A plurality of station-side units installed in each of the plurality of stations,
Including the center-side unit installed in the management center that centrally manages the multiple stations.
Each of the plurality of stations is assigned a unique station ID in advance.
Each station side unit
A clock that measures the current time every moment,
It is an encryption unit that encrypts the current time measured by the clock and the station ID unique to the corresponding station. The station ID is for the same station, but it changes from moment to moment. What to encrypt to
Includes a display that displays information that includes the encrypted current time and station ID as two ciphers.
The user uses an available communication device to transmit the two ciphers displayed on the display unit to the center-side unit.
The center side unit is
When the above two ciphers are received from the user, a cryptanalyzer that decrypts those ciphers and
The user recognizes that he / she is actually at the station having the station ID restored by decrypting the encrypted station ID at the time restored by decrypting the encrypted current time. Bicycle rental system including the information processing department.

(8) Each station ID is a station ID that is dynamic with respect to the station position but static with respect to the time.
The encryption unit uses a station ID unique to the corresponding station, which is an encryption algorithm that is static with respect to the station position but dynamic with respect to the time, and is common to the plurality of stations. The bicycle rental system according to item (7), which is encrypted with a code that changes from moment to moment.

(9) Each station ID is a station ID that is dynamic with respect to both the station position and the time.
The encryption unit changes from moment to moment by using a station ID unique to the corresponding station, which is an encryption algorithm that is static in terms of station position and time and is common to the plurality of stations. The bicycle rental system according to item (7).

(10) The center-side unit further
Includes memory capable of reading and storing information
At the time of renting a bicycle, the user uses the communication device to transmit the renting ciphers, which are the two ciphers acquired from the display unit, to the center side unit.
When the decryption unit receives the two lending codes from the user at the time of lending, the deciphering unit decrypts the lending codes to recognize the lending information including the lending time and the lending station, and the lending information is used by the user. Or, save it in the memory in association with the bicycle rented to the user,
When the bicycle is returned, the user uses the communication device to transmit the return encryption, which is the two encryptions acquired from the display unit, to the center side unit.
When the decryption unit receives the two return ciphers from the user at the time of return, the decryption unit recognizes the return information including the return time and the return station by decrypting the two return ciphers.
The information processing unit reads out the rental time and the rental station stored in association with the user or the bicycle rented to the user from the memory, and the bicycle usage time as the elapsed time from the return time to the rental time. The bicycle rental system according to any one of (7) to (9), wherein the length of the bicycle is calculated and a match / mismatch between the rental station and the return station is determined.

(11) When renting a bicycle, the user uses the communication device to transmit the renting ciphers, which are the two ciphers acquired from the display unit, to the center side unit.
When the decryption unit receives the two lending codes from the user at the time of lending, the decryption unit recognizes the lending information including the lending time and the lending station by decrypting the two lending codes.
When the bicycle is returned, the user uses the communication device to transmit the return-time ciphers, which are the two ciphers acquired from the display unit, to the center-side unit together with the two lending-time ciphers that have already been transmitted.
When the decryption unit receives the two lending codes and the two returning codes from the user at the time of the return, the decryption unit decrypts the two received lending codes to obtain the lending time and the lending station. By recognizing the loan information including, and by decrypting the two received return codes, the return information including the return time and the return station is recognized.
The information processing unit calculates the length of the bicycle usage time as the elapsed time from the return time to the rental time, and determines the match / mismatch between the rental station and the return station (7) to The bicycle rental system according to any one of (10).

(12) A bicycle rental system that rents and returns bicycles to users at multiple stations that store multiple bicycles.
A plurality of station-side units installed in each of the plurality of stations,
Including the center-side unit installed in the management center that centrally manages the multiple stations.
Each station side unit
The first clock that measures the current time every moment,
By using an encryption algorithm corresponding to each station-side unit and different from the encryption algorithm used in other stations, the current time measured by the first clock is the same as the current time, even though it is the same. An encryption unit that encrypts to a different encryption from the one acquired at other stations,
Including a display unit that displays information including the code,
The plurality of encryption algorithms used by the plurality of stations in their respective encryption units are different from each other, and the correspondence between these stations and the encryption algorithm is known.
The user uses an available communication device to transmit the cipher displayed on the display unit to the center-side unit.
The center side unit is
When the code is received from the user, the second clock that measures the time when the reception is performed as the reception time, and
The received cipher is decrypted, thereby restoring the time, comparing the restored time with the received time, and thereby receiving the reception using it among the plurality of encryption algorithms. When the decrypted code is decrypted, the decryption unit selects the encryption algorithm in which the difference between the time restored by the decryption and the reception time is equal to or less than the reference value as the authentic encryption algorithm corresponding to the station where the user is actually located. When,
Bicycle rental including an information processing unit that recognizes that the user is actually at the station corresponding to the selected authenticity encryption algorithm at the time restored by decryption using the selected authenticity encryption algorithm. ·system.

(13) A rental method in which the user is rented and returned the at least one rental object at a plurality of stations that store at least one rental object.
Including a display step of displaying a code that is dynamic both in terms of time and station position at each station position from moment to moment.
The encryption is a rental method transmitted by a user to a management center that remotely manages the plurality of stations via a communication device.

(14) A bicycle rental method in which the bicycles are rented and returned to the user at a plurality of stations where each of the bicycles is stored.
Each of the plurality of stations is assigned a unique station ID in advance.
The method involves multiple steps performed at each station.
Those processes are
A timekeeping process that measures the current time from moment to moment,
It is an encryption process that encrypts the measured current time and the station ID unique to the corresponding station, and the station ID is encrypted to the encryption that changes from moment to moment even though it is for the same station. And what to change
Including a display step of displaying information including the encrypted current time and station ID as two ciphers.
The user uses an available communication device to transmit the two displayed ciphers to a management center that centrally manages the plurality of stations.
The method involves multiple steps performed in the management center.
Those processes are
Upon receiving the above two ciphers from the user, a cryptanalysis process for breaking those ciphers and
The user recognizes that he / she is actually at the station having the station ID restored by decrypting the encrypted station ID at the time restored by decrypting the encrypted current time. Information processing process and how to rent a bicycle including.

(15) A bicycle rental method in which the bicycles are rented and returned to the user at a plurality of stations where each of the bicycles is stored.
The method involves multiple steps performed at each station.
Those processes are
The first timekeeping process, which measures the current time from moment to moment,
The measured current time is different from the ciphers obtained at other stations at the same current time by using an encryption algorithm that is dynamic with respect to the station position but static with respect to the time. The encryption process that encrypts to encryption and
Including a display process that displays information including the code,
The plurality of encryption algorithms used by the plurality of stations in their respective encryption units are different from each other, and the correspondence between these stations and the encryption algorithm is known.
The user uses an available communication device to transmit the cipher displayed on the display unit to the management center that centrally manages the plurality of stations.
The method involves multiple steps performed in the management center.
Those processes are
When the code is received from the user, the second timekeeping process of measuring the time when the reception is performed as the reception time, and
The received cipher is decrypted, thereby restoring the time, comparing the restored time with the received time, and thereby receiving the reception using it among the plurality of encryption algorithms. When the decrypted code is decrypted, the encryption algorithm in which the difference between the time restored by the decryption and the reception time is equal to or less than the reference value is selected as the authentic encryption algorithm corresponding to the station where the user is actually located. When,
Bicycle rental including an information processing process that recognizes that the user is actually at the station corresponding to the selected authenticity encryption algorithm at the time restored by decryption using the selected authenticity encryption algorithm. Method.

(16) A program executed by a computer to carry out the method according to any one of (13) to (15).

Throughout this application, the term "program" may be interpreted to mean, for example, a combination of directives executed by a computer to perform its function, as well as a combination of those directives, as well as each directive. It can be interpreted to include, but is not limited to, files and data processed in accordance with.

In addition, this program may achieve its intended purpose by being executed by a computer alone, or by being executed by a computer together with other programs. Yes, but not limited to them. In the latter case, the program according to this section may be based on data, but is not limited thereto.

(17) A recording medium on which the program described in item (16) is recorded so as to be readable by a computer.

Throughout the application documents, the term "recording medium" can be interpreted to mean various types of recording media, such recording media being magnetic recordings such as, for example, flexible discs. It includes, but is not limited to, media, optical recording media such as CDs and CD-ROMs, magneto-optical recording media such as MOs, unremovable storage such as ROMs, and the like.

(101) A rental device installed for renting and returning the at least one rental object to a user at each of a plurality of stations capable of storing at least one rental object.
By encrypting the information before encryption using an encryption algorithm, an encryption unit that generates encryption that is dynamic with respect to time and station position from moment to moment, and
A rental device including a transmitter that transmits the generated cipher to a user's communication device at each station.

(102) The combination of the pre-encryption information and the encryption algorithm is such that one of the pre-encryption information and the encryption algorithm is dynamic at least with respect to time, while the other is dynamic with respect to at least the station position. Or the rental device according to (101), wherein at least one of the pre-encrypted information and the encryption algorithm is configured to be dynamic with respect to time and station location.

(103) The rental device according to (101) or (102), wherein the cipher is transmitted by the user to a management center that remotely manages the plurality of stations via the communication device.

(104) The cipher is
The nature that the user cannot decipher,
The property that if a user is actually present or in the past at any station, the user cannot obtain a genuine cipher unless he or she is actually present or past at that station.
It has the property that the user can decipher the code and estimate that he / she was actually at the station or was in the past.
The management center decrypts the encryption received from the user by using the same encryption algorithm for decryption, thereby estimating the station where the user is actually present or was in the past. The rental device according to (103).

(105) The at least one rental object is a vehicle, furniture, clothes, electric appliances, a battery, a charger, a recording medium on which audiovisual contents are recorded, a room where people can stay, an individual storage space in a coin locker, and a parking lot. The rental device according to any one of (101) to (104), which includes at least one of the individual parking spaces of the above.

(106) A rental system for renting and returning at least one rental object to a user at each of a plurality of stations capable of storing at least one rental object.
Cryptography that is associated with each station location outside each station and encrypts the pre-encrypted information using an encryption algorithm to generate encryption that is dynamic both in terms of time and station location from moment to moment. Department and
A transmitter that sends the generated cipher to each station,
A rental system that includes a provider that, when each station receives the transmitted cipher, provides the cipher to a user at each station.

(107) The rental system according to (106), wherein the providing unit includes at least one of a display unit that displays the encryption on a screen and a transmitting unit that transmits the encryption to a user's communication device. ..

(108) A rental method for renting and returning at least one rental object to a user at each of a plurality of stations capable of storing at least one rental object.
An encryption process in which a computer encrypts pre-encrypted information in association with each station location using an encryption algorithm, thereby generating a code that is dynamic both in terms of time and station location from moment to moment.
A rental method including a transmission step of transmitting the generated cipher to a communication device of a user at each station at each station.

(109) The combination of the pre-encryption information and the encryption algorithm is such that one of the pre-encryption information and the encryption algorithm is dynamic at least with respect to time, while the other is dynamic with respect to at least the station position. Or the rental method according to (108), wherein at least one of the pre-encrypted information and the encryption algorithm is configured to be dynamic with respect to time and station location.

(110) The cipher is
The nature that the user cannot decipher,
The property that if a user is actually present or in the past at any station, the user cannot obtain a genuine cipher unless he or she is actually present or past at that station.
The rental method according to (108) or (109), which has the property of being able to decipher and estimate that the user is actually present or in the past at the station.

(111) A rental method for renting and returning the at least one rental object to a user at each of a plurality of stations capable of storing at least one rental object.
An encryption process that generates encryption that is dynamic both in terms of time and station position by using an encryption algorithm to encrypt the information before encryption in association with each station position by a computer.
The transmission process of transmitting the generated cipher to each station,
A rental method including a providing process in which, when each station receives the transmitted cipher, the cipher is provided to a user at each station.

(112) A program executed by a computer to carry out the method according to any one of (108) to (111).

(113) A recording medium on which the program according to (112) is recorded so as to be readable by a computer.

FIG. 1 (a) is a perspective view showing station-side equipment installed at a certain station in a bicycle rental system according to an exemplary first embodiment of the present invention, and FIG. 1 (b) is a perspective view showing FIG. It is an enlarged side view which shows a part of the rental bicycle shown in (a), and FIG. 1 (c) is a display part of the station-side unit of the station-side equipment shown in FIG. 1 (a). It is a front view which shows an example of how the code changes from moment to moment on the screen of FIG. 1 (d), and FIG. It is a front view which shows the dial lock type wire lock to be enlarged. FIG. 2 is a perspective view showing an example of how a user at a certain station and a management center at a remote location communicate with each other in the bicycle rental system shown in FIG. 1 (a). FIG. 3 is a functional block diagram showing a station-side unit shown in FIG. 1 (a). FIG. 4 is a flowchart conceptually showing an encryption / display program executed by the computer of the station-side unit shown in FIG. FIG. 5 is a functional block diagram showing a portion of the center-side unit shown in FIG. 2 that operates when the bicycle is rented. FIG. 6 is a functional block diagram showing a portion of the center-side unit shown in FIG. 2 that operates when the bicycle is returned. FIG. 7 is a flowchart conceptually showing a part of the lending / returning program executed by the computer of the center side unit shown in FIG. FIG. 8 is a flowchart conceptually representing the rest of the lending / returning program shown in FIG. FIG. 9 is a functional block diagram showing a portion of the center-side unit of the bicycle rental system according to the second embodiment of the present invention that operates when the bicycle is rented. FIG. 10 is a functional block diagram showing a portion of the center-side unit of the bicycle rental system according to the second embodiment that operates when the bicycle is returned. FIG. 11 is a flowchart conceptually showing a portion corresponding to FIG. 8 in the rental / return program executed by the computer of the bicycle rental system according to the second embodiment. FIG. 12 is a functional block diagram showing a station-side unit installed at a station in a bicycle rental system according to an exemplary third embodiment of the present invention. FIG. 13 is a flowchart conceptually showing an encryption / display program executed by the computer of the station-side unit shown in FIG. FIG. 14 is a functional block diagram showing a portion of the center-side unit of the bicycle rental system according to the third embodiment that operates when the bicycle is rented. FIG. 15 is a functional block diagram showing a portion of the center-side unit of the bicycle rental system according to the third embodiment that operates when the bicycle is returned. FIG. 16 is a flowchart conceptually showing a part of the rental / return program executed by the computer of the center side unit of the bicycle rental system according to the third embodiment. FIG. 17 is a flowchart conceptually representing the rest of the lending / returning program shown in FIG. FIG. 18 shows communication between a station and a remote management center and communication between the station and users at the station in a bicycle rental system according to an exemplary fourth embodiment of the invention. It is a perspective view which conceptually represents a communication between a user and a management center in a remote place, respectively. FIG. 19 is a functional block diagram showing a station-side unit shown in FIG. FIG. 20 is a flowchart conceptually showing a cryptographic providing program executed by the computer of the station-side unit shown in FIG. FIG. 21 is a functional block diagram showing a portion of the center-side unit shown in FIG. 18 that operates to repeatedly encrypt and transmit the current time and station ID. FIG. 22 is a flowchart conceptually showing an encryption program executed by the computer of the center side unit shown in FIG. 21.

Hereinafter, some exemplary embodiments of the present invention will be described in detail with reference to the drawings.

<First Embodiment of the present invention>

First, with reference to FIGS. 1A and 2, the bicycle rental system 10 according to the exemplary first embodiment of the present invention each has a plurality of stations 20 (FIG. 1) for storing a plurality of bicycles 12. (A) is a system for providing a service for renting and returning the bicycles 12 to the user at (only a representative station 20 of the stations 20 is shown). Each station 20 is assigned to the corresponding bicycle parking lot 22.

This bicycle rental system (hereinafter, simply referred to as "system") 20 is an example of a plurality of station-side units (the above-mentioned "rental device" and "bicycle rental device", respectively, which are installed in each of the plurality of stations 20. 30) and a center-side unit 50 installed in a management center 40 that remotely and centrally manages a plurality of stations 20. Each of the plurality of stations 20 is assigned a unique station ID in advance. Each station-side unit 30 is commonly used in the corresponding station 20 for a plurality of bicycles 12 stored therein.

As shown in FIG. 1 (b), a unique chassis number 60 pre-assigned to each bicycle 12 is displayed at a specific portion of each bicycle 12. In some examples, the chassis number 60 is immovably printed, in the form of a user-visible character / digit string or a computer-readable display (eg, a bar code, two-dimensional code). It is displayed on a specific part of each bicycle 12 (for example, a panel mounted in the vicinity of the uppermost apex of the triangular frame 64 that supports the saddle 62 from below in the bicycle 12).

As will be described in detail later, the station-side unit 30 measures the current time from moment to moment, and measures the measured current time and the station ID unique to the corresponding station, respectively, and the station ID is for the same station. However, it is encrypted so as to change from moment to moment, and the encrypted current time and station ID are displayed as two ciphers regardless of whether they are visually distinguished from each other.

As a result, as in the example shown in FIG. 1 (c), the two ciphers are united in a series so as not to be visually separated from each other, and the cipher 66 (“dynamic with respect to time and station position”). As an example of "data"), the portion of the encryption 66 whose current time is encrypted at a predetermined time interval (15-minute interval in the illustrated example) is also the portion where the station ID is encrypted. Is also displayed on the screen 68 so as to change dynamically with respect to time. Here, "encryption" means visualization data that cannot be deciphered by a user but can be deciphered by a specific authorized person.

As shown in FIG. 1A, this system 10 stores the above-mentioned station-side unit 30 and a plurality of bicycles 12 as fixed objects installed in one bicycle parking lot 22 at each station 20. It is equipped with a bicycle rack (bicycle accommodating device) 70 for using the bicycle. The bicycle rack 70 includes a plurality of bicycle stalls (small compartments) 72 for accommodating one bicycle 12 at a time. In one example, the bicycle rack 70 is partitioned into a plurality of bicycle stalls 72 by a frame 74 installed in the bicycle parking lot 22.

Prior to lending to the user, each bicycle 12 is housed in each bicycle stall 72, and in this housed state, the bicycle 12 is attached to the individual frame of the bicycle stall 72 with the dial lock type wire shown in FIG. 1 (d). It is secured by using a lock 80. As is well known, the dial lock type wire lock 80 is configured by connecting both ends of one flexible wire 82 to each other via a dial lock 84.

The plurality of bicycles 12 accommodated in the plurality of stations 20 managed by the management center 40 are assigned dial locks 84, which are unlocked by different passwords. Therefore, only one bicycle 12 can be unlocked with one password.

As shown in FIG. 2, in this system 10, as will be described in detail later, a communication device that can be used by a user (for example, a mobile phone that can be carried by the user or a device having a communication function (for example, a mobile phone, a smartphone, etc.)). The code 66 displayed on the screen 68 using a laptop computer, a tablet computer, a PDA), a fixed telephone installed at the station 20, a public telephone installed near the station 20, etc.) 90. To the management center 40.

When the cipher 66 is represented as a user-identifiable (eg, pronouncable) figure, as in the illustrated example, the user may manually enter the cipher 66 into the communication device 90 or speak. It is possible to enter with. On the other hand, when the encryption 66 is expressed as an indistinguishable figure by the user, the user can read and input the encryption 66 by the scanner of the communication device 90.

When the center-side unit 50 in the management center 40 receives the cipher 66 from the user, the cipher 66 is decrypted, and as a result, the user is at the time restored by decrypting the encrypted current time. , Recognizes that it is actually in the station 20 having the station ID restored by decrypting the encrypted station ID.

In FIG. 3, one station-side unit 30 installed in one station 20 is shown in a functional block diagram.

The station-side unit 30 is mainly composed of a computer 104 having a processor 100 and a memory 102 for storing a program executed by the processor 100. Specifically, the station-side unit 30 includes a clock 110, an encryption unit 112, and a display unit 114.

The clock 110 measures the current time from moment to moment. The encryption unit 112 encrypts the current time measured by the clock 110 and the station ID unique to the station 20 corresponding to the station side unit 30. The encryption unit 112 encrypts the station ID to a code that changes from moment to moment even though it is for the same station 20. The display unit 114 displays the encrypted current time and station ID as encryption 66 on the screen 68 so as to change from moment to moment.

The cipher 66 is displayed on the screen 68 in substantially real time when it is generated, thus preventing the old cipher 66 from being displayed on the screen 68 after the latest cipher 66 is generated. Will be done. As a result, it is possible to prevent the encryption 66 of a certain time from being displayed on the screen 68 even though it is actually invalid in terms of time.

In the present embodiment, the encryption 66 is composed of a multi-digit character / number string (for example, a column consisting of a plurality of characters, a column consisting of a plurality of numbers, a column in which characters and numbers are mixed). The upper digit is the part where the current time is encrypted, and the lower digit is the part where the station ID is encrypted.

In the present embodiment, the data displayed on the screen 68 that the user needs to send to the management center 40 is the encryption 66, that is, the portion where the current time is encrypted and the station. Although the ID is a combination with an encrypted portion, the data may include other information added to the combination, such as other encryption.

In the present embodiment, the station ID is a station ID that is dynamic with respect to the station position (different for each station 20) but static with respect to time (does not change with time), and the encryption unit 112 is a station ID. By using an encryption algorithm that is static for the station position but dynamic for the time and is common to a plurality of stations 20, the station ID changes from moment to moment (to be exact). , The part of the encryption 66 related to the station ID, which is hereinafter referred to as "station ID-related partial encryption").

In this system 10, a different station ID is assigned to each station 20. Each station ID is a station ID that is static with respect to time, but the station ID-related partial cipher is a station by encrypting this station ID from moment to moment by an encryption algorithm that is dynamic with respect to time. It is acquired as a dynamic cipher that is dynamic both in terms of position and time.

Specifically, in this system 10, the station ID to be encrypted is dynamic with respect to the position of the station 20, whereas it is static with respect to the time, and is for the station ID. The encryption algorithm is static with respect to the location of the station 20 (the encryption algorithm for the station ID is common to the plurality of stations 20), whereas it is dynamic with respect to the time. As a result, the station ID-related partial encryption, which is the result of encryption, becomes dynamic with respect to the position and time of the station 20.

That is, this station ID-related partial cipher is generated by encrypting a station ID that is dynamic with respect to the station position into a cipher that is dynamic with respect to time (that is, converted with time).

Therefore, if the time and the station ID-related partial cipher at that time are specified, the station from which the station ID-related partial cipher is acquired can be identified. In addition, since the station ID-related partial cipher is dynamic with respect to time, the user should use the same cipher 66 (including the station ID-related partial cipher as a part) as the cipher 66 at the time of renting the bicycle 12 when returning. This prevents impersonation of the user who returned the bicycle at the same station 20 as when it was rented, thereby deterring fraudulent activity.

Of the encryption 66, the current time-related partial encryption related to the current time is the current time-related portion that is the result of encryption because the object of encryption is the current time, which is time-dynamic information in the first place. It can be easily conceived by those skilled in the art that cryptography becomes dynamic in time. Therefore, this point does not deserve special mention. However, among the ciphers 66, the station ID-related partial cipher is the position of the station 20 whose encryption target is temporally static information, so that the station ID-related partial cipher that is the result of the encryption is temporally. It is not easy for even those skilled in the art to make it dynamic.

Further, in the present embodiment, the station ID-related partial cipher and the current time-related partial cipher are combined to generate one cipher 66. As a result, as long as the same encryption 66 is focused on, the information about the station ID and the information about the current time are associated with each other, so that the user can set the information at any time (for example, the current time or the past time). It is possible to estimate that you are in any of the stations 20.

Further, in the present embodiment, since the encryption 66 is visually recognized as a meaningless character / number string encryption 66 by the user, the user is discouraged from trying to decipher the encryption 66 and misuse it. There is expected. Further, the cipher 66 is a combination of a character / number string which is a current time-related partial cipher (in the example shown in FIG. 1, a number string for the lower four digits) and a character / number string which is a station ID-related partial cipher. Because it is configured as a series, it is more likely that the user will attempt to abuse the cipher 66 than if the two related partial ciphers are displayed on the screen 68 so that they are visually separated from each other. It is also expected to be strongly discouraged.

FIG. 4 conceptually shows an encryption / display program executed by the computer 104 of the station-side unit (station-side unit installed in the plurality of stations 20 that are of interest this time) 30 shown in FIG. It is represented by a flowchart in. This encryption / display program is stored in the memory 102 in advance like other programs described later, and is read from the memory 102 by the processor 100 and executed as needed.

Execution of this encryption / display program is repeated at a time interval of, for example, 15 minutes. Each execution of the encryption / display program is started in step S401, and in this step S401, the current time is measured using the clock 110. Next, in step S402, an encryption algorithm for time that is static in terms of both the position of the station 20 and the time is read from the memory 102, and the static encryption algorithm is used. The measured current time is encrypted.

Subsequently, in step S403, the station ID assigned to the station 20 corresponding to the station side unit 30 this time is read from the memory 102. Then, in step S404, an encryption algorithm for the station ID, which is static with respect to the position of the station 20 but dynamic with respect to the time, is read from the memory 102.

As described above, the encryption algorithm for the station ID is dynamic with respect to the time, and specifically, it is configured as a collection of a plurality of individual algorithms that are used properly for each time. The individual algorithms are stored in the memory 202 in association with a time (for example, a plurality of times that elapse every 15 minutes), and in step S404, the current time (restored lending) of the individual algorithms is stored. The one corresponding to (time is also acceptable) is selected and read in the memory 202.

Subsequently, in step S405, the read station ID is encrypted by using the selected individual algorithm.

Then, in step S406, the encrypted current time and the encrypted station ID are combined to generate a cipher 66, and the generated cipher 66 is displayed on the screen 68 in substantially real time. Is displayed. The encryption 66 displayed on the screen 68 is directly known by the user at the corresponding station 20 (the user looking into the screen 68).

This completes one execution of this encryption / display program. When the display on the screen 68 is started, the encryption 66 is held on the screen 68 until the next execution of the encryption / display program is started.

In this embodiment, as in some other embodiments described below, encryption of the current time and station ID is performed intermittently at regular time intervals. Therefore, in each encryption event for generating one encryption 66, the current time used for encryption (that is, the start time of the encryption event) means the current time in a narrow sense. However, paying attention to the fact that the generated encryption 66 is valid until the start time of the next encryption event, the current time used for encryption (that is, the start time of the previous encryption event) is in a broad sense. It means the start time of the time zone (the period from the start time to the end time of the previous encryption event) which is the time. Therefore, it can be interpreted that the current time used for encryption (that is, the start time of the previous encryption event) itself means a time zone which is a time in a broad sense.

5 and 6 show a functional block diagram of the center-side unit 50 installed in the management center 40. However, FIG. 5 shows the center side unit 50 paying attention to the part that functions when the bicycle is rented, while FIG. 6 shows the center side unit 50 paying attention to the part that functions when the bicycle is returned. Has been done.

The center-side unit 50 is mainly composed of a computer 204 having a processor 200 and a memory 202 for storing a program executed by the processor 200. The hardware configuration realized by the computer 204 is shown in a functional block diagram in FIGS. 5 and 6.

To specifically explain the hardware configuration, as shown in FIG. 5, the center-side unit 50 includes a receiving unit 210, a decryption unit 212, a rental permission unit 214, and a clock for renting a bicycle. The 216, the password acquisition unit 220, and the transmission unit 222 are operated.

Further, as shown in FIG. 6, the center-side unit 50 includes a receiving unit 210, a decryption unit 212, a clock 216, a return permission unit 230, a reading unit 232, and a rental fee for returning the bicycle. The calculation unit 234, the settlement processing unit 236, and the transmission unit 222 are operated.

Therefore, in the center-side unit 50, the receiving unit 210, the decryption unit 212, the clock 216, and the transmitting unit 222 are operated for both the bicycle rental and the bicycle return.

With the hardware configuration configured in this way, the rental / return method represented by the rental / return program described later, that is, the bicycle rental method (which is an example of the above-mentioned "rental method") is executed.

To explain the hardware configuration more specifically by paying attention to the process of renting a bicycle, as shown in FIG. 5, the receiving unit 210 is displayed on the screen 68 of the display unit 114 by the user at the time of renting. The code 66 and the chassis number 60 of the bicycle 12 that the user is about to borrow are received.

The cryptanalysis unit 212 uses the encryption algorithm for the time to convert the upper digit of the received cipher 66 at the time of lending to the current time (to be exact, the user sets the cipher 66 to the management center 40). (Time sent to) is restored and treated as the rental time.

To be precise, the encryption algorithm may be referred to as a cryptanalysis algorithm, noting that it is now used for decryption, not for encryption. However, since the encryption algorithm has the property of a table showing the correspondence between the information before encryption and the information after encryption, whether it is a scene of encryption or a scene of decryption. Regardless, for convenience of explanation, it will be referred to as an encryption algorithm.

Further, the cryptanalysis unit 212 restores the station ID by decrypting the lower digit of the received cipher 66 at the time of lending using the encryption algorithm for the station ID, and reclaims the station ID. Treat as an ID.

The lending permission unit 214 has an allowable value for the difference between the lending time and the current time measured by the clock 216 (as long as the difference between the lending time and the current time is normal and there is no fraud in the user's operation. The bicycle 12 is given to the user this time on the condition that the length is less than or equal to the length that cannot occur statistically, the rental station ID is genuine, and the received chassis number 60 is genuine. Allow to rent.

In order to determine whether or not the rental station ID is genuine, a plurality of station IDs assigned to the plurality of stations 20 are stored in advance in the memory 202 as a first table, and the rental station this time is used. When the ID matches any of the plurality of station IDs in the first table, it is determined that the current rental station ID is genuine.

Similarly, in order to determine whether or not the chassis number 60 is genuine, the plurality of chassis numbers 60 assigned to the plurality of bicycles 12 stored in the plurality of stations 20 are the second table. When the chassis number 60 of this time matches any one of the plurality of chassis numbers 60 in the second table, it is determined that the chassis number 60 of this time is genuine.

The storage unit 218 stores the rental time and the rental station ID in the memory 202 in association with the chassis number 60 in preparation for later use.

When the loan permission unit 214 issues the loan permission, the security code acquisition unit 220 obtains the security code for unlocking the dial lock 84 used for the bicycle 12 corresponding to the chassis number 60 this time from the third table. Read out. In the third table, the plurality of chassis numbers 60 and the plurality of passwords are stored in advance in association with each other.

The transmission unit 222 transmits a message for notifying that the lending has started to the user's communication device 90 together with the read password. By using the password, the user can unlock the dial lock 84 of the bicycle 12 to be borrowed and release the bicycle 12 from the bicycle stall 72.

To explain the hardware configuration more specifically by paying attention to the process of returning the bicycle, as shown in FIG. 6, the receiving unit 210 is displayed by the user on the screen 68 of the display unit 114 at the time of returning. The code 66 and the chassis number 60 of the bicycle that the user is about to return are received.

The cryptanalysis unit 212 decrypts the upper digit of the received cipher 66 at the time of return by using the encryption algorithm for the time, so that the current time (to be exact, the user manages the cipher 66). The time sent to the center 40) is restored, and it is treated as the return time. Further, the cryptanalysis unit 212 restores the station ID by decrypting the lower digit of the received cipher 66 at the time of return using the encryption algorithm for the station ID, and returns the station ID. Treat as an ID.

In the return permission unit 230, the difference between the return time and the current time measured by the clock 216 is equal to or less than the allowable value, the return station ID is genuine, and the received chassis number 60 Allows the user to return the bicycle 12 on condition that is genuine.

When the return station ID of this time matches any of the plurality of station IDs in the first table, the return permission unit 230 determines that the return station ID of this time is genuine. When the chassis number 60 of this time matches any of the plurality of chassis numbers 60 in the second table, the return permission unit 230 determines that the chassis number 60 of this time is genuine.

The reading unit 232 reads the rental time and the rental station ID stored in association with the chassis number 60 this time from the memory 202.

The rental fee calculation unit 234 calculates the length of the elapsed time from the rental time to the return time as the length of the usage time (rental time) in which the user uses the bicycle 12. The amount of the rental fee is set to increase according to the length of the usage time, and if the return station ID does not match the rental station ID, it is set to be higher than if it matches. Is stored in advance in the memory 202 as the fourth table. The rental fee calculation unit 234 determines whether or not the return station ID matches the rental station ID, and refers to the fourth table based on the determination result and the calculated length of use time. By doing so, the amount of the rental fee this time is calculated.

The payment processing unit 236 collects the rental fee from the user by performing bank payment, credit card payment, prepaid payment, and the like for the user this time.

The transmission unit 222 transmits a message indicating that the return has been completed to the user's communication device 90 together with the payment details for the rental fee this time. After that, the user secures the bicycle 12 to be returned to any unused bicycle stall 72 by using the wire lock 80, and then locks the dial lock 84 of the wire lock 80.

In FIGS. 7 and 8, a lending / returning program executed by the processor 200 of the center-side unit 50 and stored in advance in the memory 202 is conceptually represented by a flowchart.

Each execution of this lending / returning program is started in step S701 shown in FIG. 7, and in the step S701, the type of the current request issued from the user to the management center 40 via the communication device 90 is set. Information for identifying whether to lend or return, the chassis number 60, and the encryption 66 are received together with the member ID and password pre-assigned for the user this time.

In order to enjoy the bicycle rental service provided by this system 10, the user is required to register in advance as a member, and at that time, also registers the password required for subsequent personal authentication. It is required that.

Next, in step S702, it is determined whether or not the personal authentication for the user this time has succeeded from the collation result between the received member ID and password and the registered information. If the personal authentication is successful, in step S703, it is determined whether or not the current request from the user is a lending request. If the current request is a return request, the determination is NO, and then the process proceeds to the step group shown in FIG. 8. However, if the current request is a lending request, the determination is YES, and step S704. Move to.

In this step S704, the upper digit of the received cipher 66 is decrypted by using the encryption algorithm for the time, whereby the lending time is restored. Subsequently, in step S705, it is determined whether or not the difference between the lending time and the current time measured by the clock 216 is equal to or less than the allowable value. If the difference is larger than the allowable value, it is assumed that there is something wrong with the data received from the user this time, and the execution of this lending / returning program ends without providing the service this time to the user.

On the other hand, when the difference between the lending time and the current time is equal to or less than the allowable value, the determination in step S705 is YES, and subsequently, in step S706, the encryption algorithm for the station ID is used in the memory 202. Among the plurality of individual algorithms constituting the above (the same as the above-mentioned multiple individual algorithms stored in the memory 102 of the station side unit 30), the one corresponding to the current time (the restored lending time is also possible) is selected. And it is read from memory 202.

Subsequently, in step S707, the lower digit of the received cipher 66 is decrypted using the read individual algorithm, whereby the lending station ID is restored.

Subsequently, in step S708, it is determined whether or not the current rental station ID is genuine by determining whether or not the rental station ID matches any of the plurality of station IDs in the first table. Will be done. If the current lending station ID is not genuine, it is assumed that there is something wrong with the data received this time from the user, and the execution of this lending / returning program ends without providing the current service to the user.

On the other hand, when the current rental station ID is genuine, the determination in step S708 is YES, and subsequently, in step S709, the current chassis number 60 is any of the plurality of chassis numbers in the second table. By determining whether or not it matches with, it is determined whether or not the chassis number 60 this time is genuine. If the chassis number 60 this time is not genuine, it is assumed that there is something wrong with the data received this time from the user, and the execution of this lending / returning program ends without providing the service this time to the user.

On the other hand, when the chassis number 60 this time is genuine, the determination in step S709 is YES, and subsequently, in step S710, the bicycle 12 having the chassis number 60 is permitted to be rented to the user. As a premise, it is recognized that the user is actually at the station 20 having the restored station ID at the restored lending time. After that, in step S711, the current rental time and the rental station are stored in the memory 202 in association with the current chassis number 60 in preparation for later use.

Subsequently, in step S712, by referring to the third table, the user himself / herself unlocks the password corresponding to the chassis number 60 of this time, that is, the dial lock 84 locked in the bicycle 12 of this time. The number to be given to the dial lock 84 (for example, a multi-digit number) is acquired.

Then, in step S713, the acquired personal identification number and a message indicating that the bicycle 12 is to be rented are transmitted to the user's communication device 90. This completes the execution of the part of the rental / return program for renting the bicycle 12.

On the other hand, when the current request issued by the user is a return request, the determination in step S703 becomes NO, and the process proceeds to step S801 shown in FIG. In this step S801, the upper digit of the cipher 66 received at the time of return is decrypted by using the encryption algorithm for the time, whereby the return time is restored.

Subsequently, in step S802, it is determined whether or not the difference between the return time and the current time is equal to or less than the allowable value. If the difference is larger than the allowable value, it is assumed that there is something wrong with the data received from the user this time, and the execution of this lending / returning program ends without providing the service this time to the user.

On the other hand, when the difference between the return time and the current time is equal to or less than the allowable value, the determination in step S802 is YES, and subsequently, in step S803, the encryption algorithm for the station ID is selected in the memory 202. And it is read from memory 202. Specifically, as described above, among the plurality of individual algorithms constituting the encryption algorithm for the station ID, the one corresponding to the current time (the restored return time is also possible) is selected in the memory 202. Read out.

Subsequently, in step S804, the lower digit of the cipher 66 received at the time of return is decrypted using the read encryption algorithm (individual algorithm), whereby the return station ID is restored.

Subsequently, in step S804, it is determined whether or not the return station ID this time is genuine by determining whether or not the return station ID matches any of the plurality of station IDs in the first table. Will be done. If the return station ID this time is not genuine, it is assumed that there is something wrong with the data received this time from the user, and the execution of this lending / returning program ends without providing the service this time to the user.

On the other hand, when the return station ID this time is genuine, the determination in step S805 is YES, and subsequently, in step S806, the chassis number 60 this time is any of the plurality of chassis numbers in the second table. By determining whether or not it matches with, it is determined whether or not the chassis number 60 this time is genuine. If the chassis number 60 this time is not genuine, it is assumed that there is something wrong with the data received this time from the user, and the execution of this lending / returning program ends without providing the service this time to the user.

On the other hand, when the chassis number 60 this time is genuine, the determination in step S806 is YES, and subsequently, in step S807, the user returns the bicycle 12 having the chassis number 60 to the station 20 this time. Is allowed. As a premise, it is recognized that the user is actually at the station 20 having the restored station ID at the restored return time. After that, in step S808, the rental time and the rental station of the bicycle 12 to be returned this time are read out from the memory 202 in association with the chassis number 60 this time.

Subsequently, in step S809, the length of the elapsed time from the rental time to the return time is calculated as the length of the usage time when the user uses the bicycle 12. Then, in step S810, it is determined whether or not the return station ID matches the rental station ID.

Subsequently, in step S811, the fourth table is referred to this time based on the calculated length of the usage time and the determination result of whether or not the return station ID matches the rental station ID. The amount of rental fee is calculated. After that, in step S812, the calculated rental fee is settled to the current user, whereby the current rental fee is collected from the user.

Subsequently, in step S813, a message indicating that the return has been completed and a payment statement for the rental fee this time are transmitted to the user's communication device 90. This completes the execution of the part of the lending / returning program for returning the bicycle 12.

In the present embodiment, as described above, the station ID is a station ID that is dynamic with respect to the position of the station 20 but static with respect to the time, and the encryption unit 112 shown in FIG. 3 is the station ID thereof. By using an encryption algorithm that is static with respect to the position of the station 20 but dynamic with respect to the time, which is common to a plurality of stations 20, the station ID is also set with respect to the position of the station 20. It also encrypts to a dynamic cipher.

On the other hand, in one modification, each station ID is a station ID that is dynamic with respect to the position and time of the station 20. The encryption unit 112 encrypts the station ID from moment to moment by an encryption algorithm that is static both with respect to the position of the station 20 and with respect to the time, so that the encryption is dynamic with respect to the position of the station 20 and with respect to the time. Get 66.

Specifically, in order to realize a station ID that is dynamic with respect to both the position of the station 20 and the time, a plurality of individual station IDs are stored in the memory 202 in association with different times. The collection of these individual station IDs for one day is different for each station 20. The encryption unit 112 selects an individual station ID corresponding to the current time from the individual station IDs, reads the selected individual station ID from the memory 202, and reads the read individual station ID of the current time to the station 20. Encrypt using an encryption algorithm that is static both in terms of position and time.

Specifically, in this modification, the station ID to be encrypted is dynamic with respect to the position of the station 20 and the time, whereas the encryption algorithm is also related to the position of the station 20. The time is also static. As a result, the encryption 66, which is the result of encryption, becomes dynamic with respect to the position and time of the station 20.

Therefore, if the time and the code 66 at that time are specified, the station 20 from which the code 66 is acquired can be identified. Further, since the code 66 is dynamic with respect to the time, the user impersonates the user who returned the bicycle at the same station 20 as when the bicycle 12 was rented by using the same code as the code 66 when the bicycle 12 was rented. Is stopped, thereby deterring fraud.

As is clear from the above description, in the system 10 according to the present embodiment, the unique information for identifying the station 20, that is, the station ID (whether static or dynamic) is the same. Although it is about the station 20, it is encrypted with the encryption 66 which changes from moment to moment.

However, of the ciphers 66, only the station ID-related partial cipher is a cipher that is dynamic with respect to the position of the station 20 and the time, whereas the current time-related partial cipher is the cipher that is dynamic with respect to the position of the station 20. It is a cipher that is static in terms of time, but dynamic in terms of time.

Therefore, the unique information for identifying the same station 20 is encrypted by a plurality of different ciphers 66 at a plurality of different times. Therefore, since the return time is different from the lending time, the code 66 at the time of return does not actually match the code 66 at the time of lending even if it is a code for the same station 20.

Nevertheless, because the encryption scheme is kept secret from the user, the user can easily use the same encryption as the encryption 66 displayed on the screen 68 at the time of lending to another station 20. If it is used at the time of return, the code at the time of return is an illegal code that cannot exist at that time. Therefore, the management center 40 that receives the code at the time of return from the user uses the code at the time of return. I can't decipher it.

If the management center 40 reports to the user that the code at the time of return is invalid when the code at the time of return cannot be decrypted, the user who receives the report will be notified of the presence or absence of fraudulent activity. Know that you were being monitored and that your misconduct was discovered. Therefore, the user becomes aware that he / she does not want to perform the same fraudulent activity again, and thereby obtains a deterrent effect against the user's fraudulent activity.

On the other hand, the management center 40 has a positioning function (for example, a GPS function) that measures the user's current position every moment, thanks to the method of receiving the dynamic encryption 66 from the user via the mobile communication device 90. It is possible for the user to recognize the station 20 in which the user is truly located at the time of renting and returning without activating it in the portable communication device 90.

Further, thanks to the method of receiving the dynamic encryption 66 from the user via the portable communication device 90, a signal for identifying the station 20 to be rented or returned is transmitted from the station 20 to the management center 40. It is possible for the user to recognize the station 20 in which the user is truly located at the time of renting and returning, without having to install the communication equipment for the purpose at each station 20. As a result, the equipment cost of each station 20 can be reduced, and the maintenance cost of the equipment can also be reduced.

Further, according to the present embodiment, when the borrowed bicycle 12 is returned, the user is not required to send the rental information including the rental time and the rental station to the management center 40, and the bicycle usage time is long. It is possible to perform the calculation and the determination of the match / mismatch between the lending station and the return station. Therefore, the burden imposed on the user is reduced.

<Second Embodiment of the present invention>

Next, the bicycle rental system 300 according to the second embodiment of the present invention will be described with reference to FIGS. 9 to 11. However, since this bicycle rental system 300 has many common elements with the bicycle rental system 10 according to the first embodiment described above, only different elements will be described in detail, and the common elements have the same name or the same name. Duplicate explanations are omitted by quoting with reference numerals.

First, to briefly explain, the bicycle rental system (hereinafter, simply referred to as "system") 300 is the bicycle rental system 10 according to the first embodiment described above, whereas the station side unit 30 is an overall system. However, the center-side unit 50 is common except that it does not have the storage unit 218 and the reading unit 232 as shown in the functional block diagrams in FIGS. 9 and 10. Further, in this system 300, instead of having the storage unit 218 and the reading unit 232, when the user returns the rented bicycle 12, the code 66 at the time of return is also sent to the management center 40 together with the code 66 at the time of return. You are required to send.

Therefore, as shown in FIG. 6, the receiving unit 210 receives both the encryption 66 at the time of return and the encryption 66 at the time of lending from the user at the time of return. As in the first embodiment, the decryption unit 212 restores the lending time and the lending station ID from the cryptographic 66 at the time of lending by using a dynamic encryption algorithm, and further, the cryptographic 66 at the time of returning. The rental time and the rental station ID are restored from. In the present embodiment, as in the first embodiment, the unique station ID assigned to each station is static and does not change with time.

Therefore, the lending / returning program executed by the computer 204 of the center-side unit 50 is basically the same as the lending / returning program shown in FIGS. 7 and 8 for the first embodiment.

Specifically, the flowchart showing the lending / returning program in the present embodiment does not store the lending time and the lending station ID in the memory 202 in association with the chassis number 60 in the process for lending. , The first embodiment is common to the flowchart shown in FIG.

Further, the flowchart showing the lending / returning program in the present embodiment does not read the lending time and the lending station ID from the memory 202 in association with the chassis number 60 in the process for returning, and has already been rented. FIG. 8 shows the first embodiment, except that the user who is about to return the bicycle 12 is required to enter the code 66 at the time of lending, but is not required to enter the chassis number 60. It is common with the flowchart shown.

Of the flowcharts representing the lending / returning programs in the present embodiment, the portion corresponding to the flowchart shown in FIG. 7 omits further explanation by illustration and text, while the portion corresponding to the flowchart shown in FIG. 8 is shown in FIG. Will be described in comparison with the flowchart of FIG.

When the request issued by the user is a return request, the determination of the step (not shown) corresponding to step S703 shown in FIG. 7 becomes NO, and the process proceeds to step S1101 shown in FIG. In this step S1101, in the same manner as in step S704 shown in FIG. 7, the upper digit of the encryption 66 at the time of lending is decrypted by using the encryption algorithm for the time, whereby the lending time is restored. To.

Then, in step S1102, in the same manner as in step S801 shown in FIG. 8, the upper digit of the code 66 at the time of return is decrypted using the encryption algorithm for the time, whereby the return time is restored. To.

Subsequently, in step S1103, it is determined in the same manner as in step S802 whether or not the difference between the return time and the current time is equal to or less than the allowable value. If the difference is larger than the allowable value, the execution of this lending / returning program is immediately terminated.

On the other hand, when the difference between the return time and the current time is equal to or less than the allowable value, the determination in step S1103 is YES.

Subsequently, in step S1104, in the same manner as in step S803 shown in FIG. 8, a plurality of individual algorithms constituting the encryption algorithm for the station ID (stored in the memory 102 of the station side unit 30 to generate the encryption 66). Among the plurality of individual algorithms described above, the one corresponding to the lending time (the same as the individual algorithm used in the station-side unit 30 to generate the encryption 66 at the time of lending) is selected in the memory 202. Is read out.

Subsequently, in step S1105, the lower digit of the code 66 at the time of lending is deciphered using the read individual algorithm, whereby the lending station ID is restored.

After that, in step S1106, among the plurality of individual algorithms constituting the encryption algorithm for the station ID, the one corresponding to the current time (the restored return time is also possible) is selected and read in the memory 202.

Subsequently, in step S1107, the lower digit of the code 66 at the time of return is decrypted using the read individual algorithm, whereby the return station ID is restored.

After that, in step S1108, it is determined whether or not the return station ID this time is genuine by determining whether or not the return station ID matches any of the plurality of station IDs in the first table. To. If the return station ID this time is not genuine, the execution of this lending / returning program ends immediately.

On the other hand, when the return station ID this time is genuine, the determination in step S1108 is YES, and subsequently, in step S1109, the length of the elapsed time from the lending time to the return time is determined by the user. It is calculated as the length of the usage time using the bicycle 12. After that, in step S1110, it is determined whether or not the return station ID matches the rental station ID.

Subsequently, in step S1111, this time, by referring to the fourth table based on the calculated length of the usage time and the determination result of whether or not the return station ID matches the rental station ID. The amount of rental fee is calculated. After that, in step S1112, the calculated rental fee is settled to the current user, whereby the current rental fee is collected from the user.

Subsequently, in step S1113, a message indicating that the return has been completed and a payment statement for the rental fee this time are transmitted to the user's communication device 90. This completes the execution of the part of the lending / returning program for returning the bicycle 12.

As is clear from the above description, according to the present embodiment, it is also required that the center side unit 50 stores the rental information including the rental time and the rental station in the memory 202 in association with the chassis number 60. , Without requiring the rental information to be associated with the chassis number 60 and read from the memory 202 at the time of return, the calculation of the length of the bicycle usage time and the match / mismatch between the rental station and the return station. It is possible to make a judgment of. Therefore, the burden imposed on the center side unit 50 is reduced.

<Third Embodiment of the present invention>

Next, the bicycle rental system 400 according to the exemplary third embodiment of the present invention will be described with reference to FIGS. 12 to 17. However, since this bicycle rental system 400 has many common elements with the bicycle rental system 10 according to the first embodiment described above, only different elements will be described in detail, and the common elements have the same name or the same name. Duplicate explanations are omitted by quoting with reference numerals.

First, to be schematically described, the bicycle rental system (hereinafter, simply referred to as “system”) 400 is the bicycle rental system 10 according to the first embodiment described above, whereas the station side unit 30 is shown in FIG. As shown in the functional block diagram and FIG. 13 in the flowchart, the encryption algorithm used to encrypt the current time is different for each station 20, that is, it is dynamic with respect to the position of the station 20. It is common except that the point and the point that the station ID is not encrypted.

Further, this system 400 is for restoring the station ID of the center side unit 50 with respect to the system 10, as shown in the functional block diagram in FIGS. 14 and 15 and the flowchart in FIGS. 16 and 17, respectively. It is common except that it does not decrypt.

FIG. 13 conceptually shows an encryption / display program executed by the computer 104 of the station-side unit 30 shown in FIG. 12 in a flowchart.

Each execution of the encryption / display program is started in step S1301, and in this step S1301, the current time is measured using the clock 110. Next, in step S1302, an encryption algorithm for time, which is different for each station 20, is read from the memory 102, and the measured current time is encrypted by using the encryption algorithm. ..

Subsequently, in step S1303, the encrypted current time is displayed on the screen 68 as encryption 66. This completes one execution of this encryption / display program.

In FIGS. 16 and 17, a lending / returning program executed by the processor 200 of the center-side unit 50 shown in FIGS. 14 and 15 and stored in advance in the memory 202 is conceptually represented by a flowchart. ing.

By the way, when the current time is encrypted every moment, even if the current time is encrypted using a static encryption algorithm with respect to time, the object of encryption is dynamic with respect to time, so that the encryption is obtained. The ciphers that are made are time-dynamic ciphers.

On the other hand, if the numeric strings representing the time are encrypted at the same time using a plurality of different encryption algorithms, a plurality of different ciphers are obtained.

Further, if a different encryption algorithm is assigned to each station 20 to encrypt the time, each station 20 obtains a different encryption from the other stations 20 at the same time. The cipher will eventually become a dynamic cipher not only with respect to time, but also with respect to the location of station 20.

Therefore, if the time is made common, a known relationship is established between the type of encryption algorithm and the encryption, and the relationship is associated with the time. Further, there is a one-to-one correspondence between the type of encryption algorithm and the position of the station 20.

Therefore, if the time and the cipher at that time are known, the type of the encryption algorithm used to acquire the cipher can be estimated, and the position of the station 20 from which the cipher was acquired can be estimated.

Based on such knowledge, first of all, in this system 400, in this system 400, the user uses the communication device 90 to display the encryption on the screen 68 of the display unit 114 installed in the station 20 this time. 66 is transmitted to the center side unit 50 of the management center 40.

When the center-side unit 50 receives the cipher 66 from the user, it measures the time when the reception is performed as the reception time, decrypts the received cipher, and thereby restores the time.

The center-side unit 50 further compares the restored time with the reception time, whereby the plurality of encryption algorithms different for each station 20 (hereinafter, for convenience of explanation, "a plurality of candidate ciphers". The user uses the candidate encryption algorithm EA in which the difference between the time restored by the decryption and the reception time is equal to or less than the reference value when the received encryption is decrypted by using the EA. Is selected as the authentic encryption algorithm corresponding to the station in which it is actually located.

The center-side unit 50 further recognizes that the user is actually at the station corresponding to the selected authentic encryption algorithm at the time restored by decryption using the selected authentic encryption algorithm. do.

Thus, according to this system 400, the type of encryption algorithm for time, that is, the encryption method, is changed for each station 20, that is, the type of encryption algorithm for time is changed with respect to the position of station 20. The station 20 is identified from the encryption 66 without using a unique station ID assigned to each station 20 or encrypting the station ID into a dynamic encryption in a broad sense. can.

In addition, since the code 66 is dynamic with respect to time, the user can impersonate the user who returned the bicycle at the same station 20 as when renting the bicycle by using the same code as the code 66 when renting the bicycle. Is stopped, thereby deterring fraud.

Each execution of the lending / returning program in the present embodiment is started in step S1601 shown in FIG. 16, and in the step S1601, the user makes a request to the management center 40 via the communication device 90 this time. Information for specifying whether the type of the user is lending or returning, the chassis number 60, and the encryption 66 are received together with the member ID and password pre-assigned to the user this time.

Next, in step S1602, it is determined whether or not the personal authentication for the user this time has succeeded from the collation result between the received member ID and password and the registered information. If the personal authentication is successful, in step S1603, it is determined whether or not the current request from the user is a lending request. If the current request is a return request, the determination is NO, and then the process proceeds to the step group shown in FIG. 17, but if the current request is a lending request, the determination is YES, and step S1604. Move to.

In this step S1604, the number i for specifying the candidate encryption algorithm EA to be selected this time is set to 1. Subsequently, in step S1605, among the plurality of candidate encryption algorithms EA, the one to which the current value of the number i is assigned is selected in the memory 202.

Then, in step S1606, the selected candidate encryption algorithm EAi is read from the memory 202, and by using the read candidate encryption algorithm EAi, the received encryption 66 is decrypted, whereby the received encryption 66 is decrypted. Candidate lending time is restored.

Subsequently, in step S1607, it is determined whether or not the difference between the candidate lending time and the current time is equal to or less than the reference value. If the difference is larger than the reference value, the determination is NO, and then in step S1608, the number i is incremented by 1. Then, the process returns to step S1605.

On the other hand, when the difference between the candidate lending time and the current time is equal to or less than the reference value, the determination in step S1607 is YES, and subsequently, in step S1609, the current candidate encryption algorithm EAi is used for this time. It is selected as the authentic encryption algorithm suitable for breaking the encryption 66.

Then, in step S1610, the current candidate lending time is selected as the genuine lending time. Subsequently, in step S1611, according to the predetermined relationship between the station ID and the genuine encryption algorithm number i, which is stored in the memory 202 in advance, the authentic encryption algorithm number i of this time is set. The corresponding rental station ID is determined.

After that, in step S1612, it is determined whether or not the current rental station ID is genuine by determining whether or not the rental station ID matches any of the plurality of station IDs in the first table. To. If the lending station ID this time is not genuine, the execution of this lending / returning program ends immediately.

On the other hand, when the current rental station ID is genuine, the determination in step S1612 is YES, and subsequently, in step S1613, the current chassis number 60 is any of the plurality of chassis numbers in the second table. By determining whether or not it matches with, it is determined whether or not the chassis number 60 this time is genuine. If the chassis number 60 this time is not genuine, the execution of this lending / returning program ends immediately.

On the other hand, when the chassis number 60 this time is genuine, the determination in step S1613 is YES, and subsequently, in step S1614, the bicycle 12 having the chassis number 60 is allowed to be rented to the user. After that, in step S1615, the current rental time and the rental station are stored in the memory 202 in association with the current chassis number 60 in preparation for later use.

Subsequently, in step S1616, by referring to the third table, the user himself / herself unlocks the password corresponding to the chassis number 60 of this time, that is, the dial lock 84 locked in the bicycle 12 of this time. The number to be given to the dial lock 84 (for example, a multi-digit number) is acquired.

Then, in step S1617, the acquired personal identification number and a message indicating that the bicycle 12 is to be rented are transmitted to the user's communication device 90. This completes the execution of the part of the rental / return program for renting the bicycle 12.

On the other hand, when the current request issued by the user is a return request, the determination in step S1603 becomes NO, and the process proceeds to step S1701 shown in FIG.

In this step S1701, the number j for specifying the candidate encryption algorithm EA to be selected this time is set to 1. Subsequently, in step S1702, among the plurality of candidate encryption algorithms EA, the one to which the current value of the number j is assigned is selected in the memory 202.

Then, in step S1703, the selected candidate encryption algorithm EAj is read from the memory 202, and by using the read candidate encryption algorithm EAj, the received encryption 66 is decrypted, whereby the received encryption 66 is decrypted. The candidate return time is restored.

Subsequently, in step S1704, it is determined whether or not the difference between the candidate return time and the current time is equal to or less than the reference value. If the difference is larger than the reference value, the determination is NO, and then in step S11705, the number j is incremented by 1. Then, the process returns to step S1702.

On the other hand, when the difference between the candidate return time and the current time is equal to or less than the reference value, the determination in step S1704 is YES, and subsequently, in step S1706, the current candidate encryption algorithm EAj uses the current candidate encryption algorithm EAj. It is selected as the authentic encryption algorithm suitable for breaking the encryption 66.

Then, in step S1707, the current candidate return time is selected as the true return time. Subsequently, in step S1708, the number j of the authentic encryption algorithm is changed to the number j of the authentic encryption algorithm according to the predetermined relationship between the station ID and the number j of the authentic encryption algorithm and which is stored in the memory 202 in advance. The corresponding return station ID is determined.

After that, in step S1709, it is determined whether or not the return station ID this time is genuine by determining whether or not the return station ID matches any of the plurality of station IDs in the first table. To. If the return station ID this time is not genuine, the execution of this lending / returning program ends immediately.

On the other hand, when the return station ID this time is genuine, the determination in step S1709 is YES, and subsequently, in step S1710, the chassis number 60 this time is any of the plurality of chassis numbers in the second table. By determining whether or not it matches with, it is determined whether or not the chassis number 60 this time is genuine. If the chassis number 60 this time is not genuine, the execution of this lending / returning program ends immediately.

On the other hand, when the chassis number 60 this time is genuine, the determination in step S1710 is YES, and subsequently, in step S1711, the user returns the bicycle 12 having the chassis number 60 to the station 20 this time. Is allowed. After that, in step S1712, the rental time and the rental station of the bicycle 12 to be returned this time are read out from the memory 202 in association with the chassis number 60 this time.

Subsequently, in step S1713, the length of the elapsed time from the rental time to the return time is calculated as the length of the usage time when the user uses the bicycle 12. Then, in step S1714, it is determined whether or not the return station ID matches the rental station ID.

Subsequently, in step S1715, by referring to the fourth table based on the calculated length of the usage time and the determination result of whether or not the return station ID matches the rental station ID, this time. The amount of rental fee is calculated. After that, in step S1716, the calculated rental fee is settled to the current user, whereby the current rental fee is collected from the user.

Subsequently, in step S1717, a message indicating that the return has been completed and a payment statement for the rental fee this time are transmitted to the user's communication device 90. This completes the execution of the part of the lending / returning program for returning the bicycle 12.

As is clear from the specific description of some of the embodiments described above, in those embodiments, the encryption unit 112 of the station-side units 30 installed in each station 20 is before encryption. By encrypting information (for example, station ID, current time) using an encryption algorithm, encryption 66 is generated every moment.

Here, the process of encryption can be compared to the process of multiplying the information before encryption and the encryption algorithm for the sake of simplicity. Then, in order for the cipher that is the result of the multiplication to be dynamic with respect to time and station position, one of the pre-encrypted information and the encryption algorithm is at least dynamic with respect to time. , The other is required to be at least dynamic with respect to station location, or at least one of those pre-encrypted information and encryption algorithms is required to be dynamic with respect to time and station location.

Therefore, the pre-encryption information includes information regarding at least one of the time and the station position. Is the combination of the pre-encrypted information and the encryption algorithm dynamic at least one of the pre-encrypted information and the encryption algorithm with respect to time, but at least with respect to the station position? , Or at least one of those pre-encrypted information and encryption algorithms is configured to be dynamic with respect to time and station location.

The encryption 66 has a property that the user cannot decipher it due to its nature. The cipher 66 is further configured to be dynamic with respect to time and station position, so that if the user is actually at any station 20 at any time, then exactly at that time. The property that the user cannot obtain the genuine code 66 unless he / she is actually at the station 20 and the fact that the user is actually at the station 20 at that exact time are the center-side units 50 of the management center 40. It has the property of being able to decipher and estimate the code 66.

When the type of the encryption algorithm is common to the plurality of stations 20, the center-side unit 50 has a plurality of ciphers that can be generated, a plurality of decryption results, and the positions of the plurality of stations 20 (for example, the plurality of stations 20). Multiple unique ciphers and multiples that can be generated according to a predetermined relationship with (multiple unique station IDs pre-assigned to) or if the type of encryption algorithm is unique to each station 20. According to the predetermined relationship between the decryption result of the above, the type of the plurality of encryption algorithms, and the positions of the plurality of stations 20 (for example, the plurality of unique station IDs pre-assigned to the plurality of stations 20), from the user. The received code 66 is decrypted, thereby estimating the station 20 where the user is actually present and the time when the user is actually present at the station 20.

Here, focusing on the station ID-related partial cipher among the ciphers 66, the station ID-related partial cipher is dynamic with respect to time and station ID. This means that the station ID-related partial cipher changes with time, even though it is about the same station. However, since the number taken by the station ID-related partial cipher at each time is known for each station, the time when the station ID-related partial cipher is valid (for example, the time displayed on the screen 68) is known. Then, the corresponding station ID can be estimated.

When the time when the management center 40 receives the station ID-related partial cipher is known without the help of the current time-related partial cipher (for example, in the case of the rental scene, the rental time is the station ID of the management center 40. (It is substantially the same time as the time when the related partial cipher is received), the station ID related partial cipher can be decrypted in association with the found time without the help of the current time related partial cipher. , The corresponding station ID can be estimated.

On the other hand, when the time when the management center 40 receives the station ID-related partial cipher cannot be determined without the help of the current time-related partial cipher (for example, in the return scene, the lending time preceding the lending time). Is required), first, the lending time is restored by decrypting the current time-related partial encryption, and then the station ID-related partial encryption is decrypted in association with the restored time. The corresponding station ID can be estimated.

<Fourth Embodiment of the present invention>

Next, the bicycle rental system 500 according to the exemplary fourth embodiment of the present invention will be described with reference to FIGS. 18 to 22. However, since this bicycle rental system 500 has many common elements with the bicycle rental system 10 according to the first embodiment described above, only different elements will be described in detail, and the common elements have the same name or the same name. Duplicate explanations are omitted by quoting with reference numerals.

First, to be schematically described, the bicycle rental system (hereinafter, simply referred to as “system”) 500 is the bicycle rental system 10 according to the first embodiment described above, whereas the station side unit 30 is shown in FIG. As shown in the functional block diagram, the unit 50 on the center side is common except that at least the communication device 510 that communicates with the management center 40 is added instead of the encryption unit 112 being deleted. Is common except that an encryption unit 520 having the same function as the encryption unit 112 is added as shown in the functional block diagram in FIG. 21.

In this system 500, unlike the system 10, the station side unit 30 does not encrypt the current time and the station ID in association with the corresponding station 20, but each station 20 in the center side unit 50. The current time and station ID are encrypted in association with. In the center side unit 50, when a new code 66 is generated, the code 66 is transmitted to the corresponding station 20 in substantially real time.

The transmission of the encryption 66 from the center side unit 50 to each station 20 is realized as, for example, wireless transmission, for example, wireless transmission using a telephone line, and wireless transmission using the Internet as an example of a global network. To. In one example, on the Internet, a destination address unique to each station 20 is assigned to each station 20, and the center-side unit 50 specifies a corresponding destination address for each station 20 and performs each. The encryption 66 unique to the station 20 is individually transmitted to the destination station 20 (for example, a monocast method).

Further, in the system 500, when the cipher 66 is received in the station side unit 30, the cipher 66 is displayed on the screen 68 in substantially real time, so that the cipher 66 corresponds to the station 20. The same cipher 66 is transmitted in substantially real time to the user's communication device 90 at the corresponding station 20 using the local area network, while being directly known to the user at. , Cryptography 66 is indirectly known to the user via the communication device 90.

The local area network is configured so that the signal transmitted from the station-side unit 30 does not reach the user's communication device 90 unless the user is actually at the corresponding station 20. For example, the reach of the signal transmitted from the station side unit 30 is set so as not to substantially exceed the area of the corresponding station 20.

In such a local area network, as a communication method, for example, an area of the corresponding station 20 (for example, a geographical area physically occupied by the station 20, a signal from the station 20 can be normally received. There is no method (eg, broadcast or multicast) of transmitting data to an unspecified number of users or a specified number of users within an area (eg, located so as to at least partially overlap the geographical area). Exclusively adopted. Further, as the communication standard, for example, Ethernet (registered trademark), Token Ring, serial transfer (for example, IrDA (optical wireless data communication by infrared rays), USB, IEEE 1394, etc.) are non-exclusively adopted.

In this system 500, in the station side unit 30, unlike the system 10, the same encryption 66 is provided to the user via both the display using the screen 68 and the data transmission, but there are two types thereof. It suffices if at least one of the methods is adopted.

FIG. 19 typically shows a corresponding station-side unit 30 in a functional block diagram for one of a plurality of stations 20 that are remotely and centrally managed by the management center 40.

The station-side unit 30 has the screen 68, the computer 104, and the display unit 114 (for example, a driver and a controller for driving a plurality of elements (for example, LEDs as light emitting elements) constituting the screen 68). Further, it has a communication device 510.

The communication device 510 includes a transmission unit 512, a reception unit 514, and a controller 516. The controller 516 includes, for example, an interface, a MAC, a memory, and the like. The receiving unit 514 receives the encryption 66 transmitted from the management center 40. The transmission unit 512 transmits the received encryption 66 to the communication device 90 of the user at the corresponding station 30.

FIG. 20 conceptually shows a flow chart of a cryptographic providing program executed by the computer 104 of the station-side unit (station-side unit installed in the plurality of stations 20 that are of interest this time) 30 shown in FIG. It is represented by. This encryption providing program is stored in the memory 102 in advance like the other programs described above, and is read from the memory 102 by the processor 100 and executed as needed.

The execution of the encryption providing program is repeated at a time interval of a length not exceeding the execution cycle of the encryption program described later in the center side unit 50, for example, at a time interval of 5 minutes. Each execution of the encryption providing program is started in step S2001, in which the latest encryption 66 is received from the management center 40 via the receiving unit 514.

Next, in step S2002, the received cipher 66 is displayed on the screen 68. This display is performed in the same manner as in the system 10. This allows the user at the corresponding station 20 to directly perceive the latest cipher 66.

Subsequently, in step S2003, the received signal representing the cipher 66 is transmitted via the transmission unit 512 toward the communication device 90 of the user at the corresponding station 20 in substantially real time. As a result, the user at the corresponding station 20 can indirectly perceive the latest encryption 66 via his / her own communication device 90.

This completes one execution of this encryption providing program. When the display on the screen 68 and the transmission from the transmission unit 512 are started, the encryption 66 is maintained in the display state and the transmission state until the next execution of the encryption providing program is started.

21 and 5 and 6 show a functional block diagram of the center-side unit 50 installed in the management center 40. However, FIG. 21 shows the portion of the center-side unit 50 that operates to iteratively encrypt and transmit the current time and station ID, and FIG. 5 shows the center-side unit. 50 is shown by paying attention to a part that functions when the bicycle is rented (represented by a flowchart in FIG. 7), and FIG. 6 shows a part in which the center side unit 50 functions when the bicycle is returned (FIG. 8). (Represented in the flow chart) is noted and shown.

In this system 500, since the center side unit 50 has the same part as the system 10 in terms of the part that functions when the bicycle is rented and the part that functions when the bicycle is returned, explanations and illustrations in duplicate sentences are omitted, and the current time is present. And only the part that works to iteratively encrypt and transmit the station ID will be described in detail.

As described above, the center-side unit 50 is mainly composed of a computer 204 having a processor 200 and a memory 202 for storing a program executed by the processor 200. The hardware configuration realized by the computer 204 is represented by a functional block diagram in FIGS. 21 and 5 and 6.

To specifically explain the hardware configuration, as shown in FIG. 21, the center side unit 50 has a clock 216, a transmission unit 222, and encryption for encryption and transmission of the current time and station ID. The chemical unit 520 is operated.

Further, as shown in FIG. 5, the center side unit 50 transmits a receiving unit 210, a decryption unit 212, a rental permission unit 214, a clock 216, a password acquisition unit 220, and a password acquisition unit 220 for renting a bicycle. The unit 222 and the unit 222 are operated.

Further, as shown in FIG. 6, the center side unit 50 includes a receiving unit 210, a decryption unit 212, a clock 216, a return permission unit 230, a reading unit 232, and a rental fee calculation for returning the bicycle. The unit 234, the payment processing unit 236, and the transmission unit 222 are operated.

Therefore, in the center-side unit 50, the clock 216 and the transmission unit 222 are operated for encryption and transmission of the current time and station ID, for renting a bicycle, and for returning the bicycle. Further, the receiving unit 210, the decryption unit 212, the clock 216, and the transmitting unit 222 are operated for both the bicycle rental and the bicycle return.

With the hardware configurations shown in FIGS. 21 and 5 and 6, the encryption / transmission process represented by the encryption program described later and the plurality of steps shown in FIG. 7 (bicycle rental among the above-mentioned rental / return programs). Bicycle rental including the bicycle rental process represented by (the part related to the return of the bicycle) and the bicycle return process represented by the plurality of steps shown in FIG. 8 (the part related to the return of the bicycle in the above-mentioned rental / return program). The method (which is an example of the "rental method" described above) is executed.

In FIG. 22, the encryption program executed in the center side unit 50 is conceptually represented by a flowchart.

Execution of this encryption program is repeated at time intervals of, for example, 15 minutes. Each execution of this encryption program is started in step S2201, and in this step S2201, the number i assigned to one station 20 to be executed this time is set to "1" among the plurality of stations 20. Will be done. The station ID is stored in advance in the memory 202 in association with each number i.

Next, in step S2202, the current time is measured using the clock 216.

After that, in step S2203, an encryption algorithm for time, which is static in terms of both the position of the station 20 and the time, is read from the memory 202, and the static encryption algorithm is used. The measured current time is encrypted.

Subsequently, in step S2204, the station ID assigned to the station 20 this time is read from the memory 202 by referring to the current value of the number i.

Then, in step S2205, an encryption algorithm for the station ID, which is static with respect to the position of the station 20 but dynamic with respect to the time, is read from the memory 202.

As described above, the encryption algorithm for the station ID is dynamic with respect to the time, and specifically, it is configured as a collection of a plurality of individual algorithms that are used properly for each time. The individual algorithms are stored in the memory 202 in association with a time (for example, a plurality of times that elapse every 15 minutes), and in step S2205, among the individual algorithms, those corresponding to the current time are stored. It is selected and read in the memory 202.

Subsequently, in step S2206, the read station ID is encrypted by using the selected individual algorithm.

After that, in step S2207, the encrypted current time and the encrypted station ID are combined to generate a cipher 66, and a signal representing the generated cipher 66 is directed toward the station 20 this time. Is sent individually (by specifying a unique destination address).

When the transmission of the cipher 66 is started one time, the transmission of the previous cipher 66 is continued until the next execution of this encryption program starts the transmission of the next cipher 66.

Subsequently, in step S2208, it is determined whether or not the current value of the number i is equal to or greater than the threshold value _i0 . It is determined whether or not the process of generating the encryption 66 unique to each of the plurality of stations 20 and transmitting them to each station 20 is completed.

This time, assuming that the current value of the number i is smaller than the threshold value i0, the determination in step S2208 becomes NO, and then in step S2209, the number i is incremented by " ₁ ". Subsequently, the process returns to step S2202, and the same processing as described above is performed for the next station 20.

As a result of repeating the execution of steps S2202 to S2209 several times, when the current value of the number i becomes the threshold value i ₀ or more, the determination of step S2208 becomes YES, and the above is the execution of this encryption program once. Is finished.

Although some embodiments of the present invention have been described in detail with reference to the drawings, taking the case where the rental object is a bicycle as an example, the present invention can also be applied to other rental objects.

For example, the rental target is a motorcycle (for example, the password is applied to the engine key of the motorcycle), a vehicle (for example, the password is applied to the door key or engine key of the vehicle). ), An engineed boat or jet ski (the password applies to, for example, the engine key of the boat or jet ski), or a go-cart running on a particular course (the password is, for example, the go-cart). The present invention can also be applied when it is applied to a door key or an engine key).

Further, the rental target is furniture (the PIN is applied to, for example, a door key of a closed space for storing the furniture), an electric product (the PIN is, for example, a closed for storing the electric equipment). (Applies to space door keys), accessories that are detachably attached to electrical appliances (the PIN applies, for example, to closed space door keys that store the accessories), or A recording medium (eg, a CD) on which audiovisual content is recorded that is user playable (the PIN applies, for example, to a closed space door key that stores the storage medium). Also, the present invention can be applied.

In addition, the rental target is a room in a hotel or apartment where the user can live (the PIN is applied to the door key of the room, for example), and an individual storage space in a coin locker (the PIN is, for example, the door key of the room). An individual parking space in a parking lot (applies to the door key of each room in Coinrocka), or an individual parking space (the PIN code is used, for example, in a device that manages the rental of the parking lot for each individual parking space). The present invention can also be applied in the case of (associated and input by the user).

Although some embodiments of the present invention have been described in detail with reference to the drawings, these are examples, and are based on the knowledge of those skilled in the art, including the embodiments described in the above [Summary of the invention] column. It is possible to carry out the present invention in other forms with various modifications and improvements.

Claims (9)

It is a parking lot management system that manages lending or returning to users of multiple parking lots for each parking lot.
A parking lot unit that transmits parking lot information for identifying each parking lot to the communication device of the user in each parking lot by a local communication method.
Including an out-of-parking server that remotely and centrally manages lending or returning to users of the plurality of parking lots by communicating with the communication equipment of the user who wishes to use one of the parking lots.
When the user's communication device receives the parking lot information corresponding to any of the parking lots from the parking lot unit as a repeater between the parking lot unit and the parking lot outside server, the received parking lot is received. Send the parking lot information to the server outside the parking lot,
The server outside the parking lot
A receiving unit that receives the parking lot information from the user's communication device,
Based on the received parking lot information, the parking lot identification unit that identifies any of the above parking lots, and
It includes a transmitter that permits the specified parking lot to be rented to the user and transmits the password associated with the specified parking lot as visualization data to the user's communication device.
The personal identification number is a parking lot management system input by the user in association with the specified parking lot. The parking lot unit transmits payment-related information necessary for the user to settle the parking fee to the communication device of the user who uses the parking lot in which the parking lot unit is installed.
The parking lot according to claim 1, wherein when the communication device of the user who intends to make a payment receives the payment-related information from the unit in the parking lot, the payment-related information is transmitted to the server outside the parking lot together with the parking lot information. Management system. The payment-related information is described in claim 2, which includes time information necessary for a user using any of the parking lots to settle a parking fee, and a parking lot ID unique to any of the parking lots. Parking lot management system. A program executed by a computer of a communication device to carry out the communication device according to any one of claims 1 to 3. A program executed by a computer of an in-parking unit to carry out the in-parking unit according to any one of claims 1 to 3. A program executed by the computer of the out-of-parking server to implement the out-of-parking server according to any one of claims 1 to 3. A recording medium in which the program according to claim 4 is recorded so as to be readable by a computer. A recording medium in which the program according to claim 5 is recorded so as to be readable by a computer. A recording medium in which the program according to claim 6 is recorded so as to be readable by a computer.

Images