CN112634492B - Intelligent door lock encryption method and equipment based on Jilin code and storage medium - Google Patents

Intelligent door lock encryption method and equipment based on Jilin code and storage medium Download PDF

Info

Publication number
CN112634492B
CN112634492B CN202011437785.0A CN202011437785A CN112634492B CN 112634492 B CN112634492 B CN 112634492B CN 202011437785 A CN202011437785 A CN 202011437785A CN 112634492 B CN112634492 B CN 112634492B
Authority
CN
China
Prior art keywords
hash value
password
door lock
binary sequence
code
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011437785.0A
Other languages
Chinese (zh)
Other versions
CN112634492A (en
Inventor
王杰林
欧阳斌
肖镭
李增应
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hunan Yaosheng Communication Technology Co ltd
Original Assignee
Xintong Construction Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xintong Construction Technology Co ltd filed Critical Xintong Construction Technology Co ltd
Priority to CN202011437785.0A priority Critical patent/CN112634492B/en
Publication of CN112634492A publication Critical patent/CN112634492A/en
Application granted granted Critical
Publication of CN112634492B publication Critical patent/CN112634492B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C9/00—Individual registration on entry or exit
    • G07C9/00174—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys
    • G07C9/00563—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys using personal physical data of the operator, e.g. finger prints, retinal images, voicepatterns
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C9/00—Individual registration on entry or exit
    • G07C9/00174—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys
    • G07C9/00309—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys operated with bidirectional data transmission between data carrier and locks
    • G07C2009/00412—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys operated with bidirectional data transmission between data carrier and locks the transmitted data signal being encrypted

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Lock And Its Accessories (AREA)

Abstract

The invention discloses an intelligent door lock encryption method, equipment and a storage medium based on Jelin code, wherein the method comprises the following steps: receiving a first password input by a user side, converting the first password into a first binary sequence, coding based on a Jielin code to obtain a first hash value and storing the first hash value; receiving a second password input by a user side, converting the second password into a second binary sequence, and coding based on the Jelin code to obtain a second hash value; if the first hash value is the same as the second hash value, an unlocking instruction is sent to the intelligent door lock, and the unlocking instruction is used for enabling the intelligent door lock to execute unlocking operation; and if the first hash value is different from the second hash value, sending unlocking failure information to the user side. According to the intelligent door lock, the Jielin code encryption is carried out on the initial password of the intelligent door lock, the digital fingerprint lengths with different lengths can be selected and set, and the hash value lengths output after the digital fingerprint lengths with different lengths are subjected to Jielin code encoding are different, so that the difficulty of brute force cracking is increased.

Description

Intelligent door lock encryption method and equipment based on Jilin code and storage medium
Technical Field
The invention relates to the technical field of intelligent door lock encryption, in particular to an intelligent door lock encryption method based on Jelin code, equipment and a storage medium.
Background
At present, the core technology in the field of intelligent electronic coded locks is embodied in: the password management, password verification, password encryption, password storage and other aspects are actually focused on a series of operations of setting or inputting the password by the user to complete door opening.
The most important technology related to the above is a one-way hash function (also called a hash algorithm). The function is to perform an irreversible conversion operation on a string of plain texts (in the intelligent door lock, the cipher is set by a user or input cipher), and generate a string of cipher texts (also called hash value) with fixed length. The ciphertexts generated after different plaintexts are encrypted are completely different, and the ciphertexts can not be reversely deduced to obtain the plaintexts theoretically, so that the Hash algorithm is one of the most widely applied cipher encryption algorithms at present.
Once the plaintext is encrypted and becomes a ciphertext, only a person who knows the plaintext can obtain the same ciphertext by using the same plaintext and the same hash algorithm, so that the ciphertext can be used as a verification basis; if the two hash values are different, the input password is different from the set password, and the instruction of opening the door cannot be sent out.
At present, the one-way hash function part of the intelligent door lock on the market is mostly arranged by using a plurality of hash algorithms, and the plaintext is subjected to one-way hash calculation for many times, so that a string of hash values is obtained. Common hash algorithms include MD5 and SHA algorithms, but the output lengths of all hash algorithms on the market are correspondingly fixed, for example, the output of SM3 is 32 bytes, and the output of MD5 is 16 bytes or 32 bytes; and the output hash value is fixed, namely under any condition, the same algorithm and the same input password can obtain the same hash value output. For example, the MD5-32 algorithm is given 123456 in any case, the output result of which is fixed, all e10adc3949ba59abbe56e057f20f883 e. In this case, the possibility of being broken by violence is extremely high.
Disclosure of Invention
The present invention is directed to solving at least one of the problems of the prior art. Therefore, the invention provides an intelligent door lock encryption method based on Jelin code, equipment and a storage medium. The risk that intelligence lock was cracked by violence can be reduced.
The invention provides an intelligent door lock encryption method based on a Jelin code, which is used for an intelligent door lock terminal and comprises the following steps:
s100, receiving a first password input by a user side, converting the first password into a first binary sequence, coding the first binary sequence based on a Jielin code to obtain a first hash value and storing:
s101, randomly generating a positive integer Len as a preset digital fingerprint length, storing the positive integer Len, and setting a positive real number
Figure BDA0002829042130000021
Wherein H (X)1) Normalized information entropy, n, representing said first binary sequence1Representing a sequence length of the first binary sequence;
s102, according to a coding formula Ri＝Ri-1r1p (x) and Li＝Li-1+Ri-1F(x-1,r1) Coding the ith bit symbol x in the first binary sequence, and coding the ith bit symbol x
Figure BDA0002829042130000022
As the first hash value and storing; wherein R is0＝1，L00, p (x) denotes the normalized probability of x, F (x-1, r)1) A non-normalized distribution function representing x-1;
s200, receiving a second password input by the user side, converting the second password into a second binary sequence, and coding the second binary sequence based on the Jelin code to obtain a second hash value:
s201, setting a positive real number
Figure BDA0002829042130000023
Wherein H (X)2) Normalized information entropy, n, representing the second binary sequence2Representing a sequence length of the second binary sequence;
s202, according to a coding formula Ri＝Ri-1r2p (x) and Li＝Li-1+Ri-1F(x-1,r2) Coding the ith bit symbol x in the second binary sequence, and coding the ith bit symbol x
Figure BDA0002829042130000031
As the second hash value;
s300, comparing the first hash value with the second hash value, and if the first hash value is the same as the second hash value, sending an unlocking instruction to the intelligent door lock, wherein the unlocking instruction is used for enabling the intelligent door lock to execute unlocking operation; and if the first hash value is different from the second hash value, sending unlocking failure information to the user side.
According to the embodiment of the invention, at least the following technical effects are achieved:
according to the method, the smart door lock is encrypted by the Jielin code, digital fingerprint lengths with different lengths can be selected and set, and the lengths of hash values output after the digital fingerprint lengths with different lengths are encoded by the Jielin code are different, so that the difficulty of brute force cracking is increased. For a user, a plurality of door locks can use the same password, and different digital fingerprint lengths are set on different door locks only when the initial password is set, so that the difficulty of brute force cracking by any third party is improved, and the safety is improved; for door lock enterprises, the same algorithm sets different digital fingerprint lengths, various different lock cylinders can be produced, the difficulty of breaking by violence can be improved, and the safety is improved.
In a second aspect of the present invention, there is provided an intelligent door lock encryption device based on a jerrin code, comprising: at least one control processor and a memory for communicative connection with the at least one control processor; the memory stores instructions executable by the at least one control processor to enable the at least one control processor to perform the jalin code based smart door lock encryption method of the first aspect of the present invention.
In a third aspect of the present invention, a computer-readable storage medium is provided, which stores computer-executable instructions for causing a computer to execute the smart door lock encryption method based on the jerry code according to the first aspect of the present invention.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a schematic flow chart of an intelligent door lock encryption method based on a jerry code according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of the intelligent door lock according to the embodiment of the present invention for changing the length of the digital fingerprint;
fig. 3 is a schematic flow chart of a user replacing a password of an intelligent door lock according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of an intelligent door lock encryption device based on a jerry code according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention.
A first embodiment;
referring to fig. 1, an intelligent door lock encryption method based on the jerrin code is provided, and is characterized in that the intelligent door lock encryption method is used for an intelligent door lock terminal, and comprises the following steps:
s100, the intelligent door lock terminal receives a first password input by a user side, converts the first password into a first binary sequence, codes the first binary sequence based on Jielin codes, obtains a first hash value and stores the first hash value:
s101, randomly generating a positive integer Len as a preset digital fingerprint length, storing the positive integer Len, and setting a positive real number
Figure BDA0002829042130000051
Wherein H (X)1) Normalized information entropy, n, representing a first binary sequence1Representing a sequence length of the first binary sequence;
s102, according to a coding formula Ri＝Ri-1r1p (x) and Li＝Li-1+Ri-1F(x-1,r1) Coding the ith bit symbol x in the first binary sequence, and encoding the coded symbol
Figure BDA0002829042130000052
As a first hash value and storing; wherein R is0＝1，L00, p (x) denotes the normalized probability of x, F (x-1, r)1) Representing a non-normalized distribution function of x-1.
In step S100, the user terminal may be a mobile terminal such as a mobile phone and a tablet, or an interaction terminal where the smart door lock interacts with the user. The intelligent door lock terminal may be a computing port inside the intelligent door lock, or may be a server side remotely connected to the intelligent door lock, which is not particularly limited herein.
Step S100 provides a process in which a user (resident) or a door lock employee sets an initial password and generates a corresponding hash value from the initial password based on the jilin code. As an alternative embodiment, the first password (initial password) is composed of any one or more than one symbol that can be recognized by the computer. For example, it may be generated from numbers, letters, special symbols, chinese characters, or even any computer-recognizable symbol. Take the example of converting Chinese characters into binary system: 3755 primary Chinese characters, 3008 secondary Chinese characters, 682 graphic symbols and 7445 graphic symbols are collected in a character set of a national standard code (national standard information exchange Chinese character code of the people's republic of China, with the code number of GB 2312-80). A Chinese character corresponds to a zone bit code and consists of four digits, wherein the first two digits are zone codes (0-94), and the last two digits are bit codes (0-94). Meanwhile, the Chinese characters of the whole part, the Japanese and the Korean (CJK) are supported at the level of the vocabulary according to ISO/IEC 10646-1 and GB 13000-1, and the total number is 20902 characters. The information of characters, graphics, sound, animation, etc. is changed into binary number coded according to a certain rule. The machine code means that the machine code of Chinese characters in the computer takes up two bytes, which are called the high order and low order of the machine code. Their relationship to the region bit code is as follows: the high-order of the machine code is area code + A0H, and the low-order of the machine code is bit code + A0H.
The process of encoding the binary sequence in step S102 is specifically as follows:
initial setting: i is 0, R0＝1，L0＝0；
The first step, coding the ith symbol, and entering the second step if the ith symbol is symbol 0; if the ith symbol is symbol 1, entering a third step;
second, substituting the symbol 0 into the coding formula to obtain Ri＝Ri-1r1p (0) due to F (-1, r)1) Not equal to 0, so Li＝Li-1And proceeding to the fourth step;
thirdly, substituting the symbol 1 into a coding formula to obtain Ri＝Ri-1r1p (1) due to F (0, r)1)＝r1p (0), so Li＝Li-1+Ri-1r1p (0), and proceeds to the fourth step;
fourthly, if the cyclic variable i is equal to i +1, judging that i is less than or equal to n1Entering the first step; if i>n1If the coding is finished, outputting V, wherein V is L after the binary sequence is codediThe value of (c).
Wherein the code formula of Jielin code is
Figure BDA0002829042130000061
And Li＝Li-1+Ri-1F(x-1,r1)；
The following describes the encoding process and principle of the jalin code used in this embodiment:
let the discrete random variable x have a fixed normalized probability p (x), and have a positive real number r acting on the normalized probability p (x) at any time, and mark the non-normalized probability of the discrete random variable x as
Figure BDA0002829042130000062
The following formula is satisfied:
Figure BDA0002829042130000063
the sum of the probabilities of all variables at any time is then:
Figure BDA0002829042130000064
k is the number of variables, and when r is 1,
Figure BDA0002829042130000065
and is
Figure BDA0002829042130000066
Assuming that the distribution function of the non-normalized probability model is F (x, r), F (x) is the distribution function of the normalized probability model, and s ∈ {0,1, …, k }, then:
Figure BDA0002829042130000071
let R0＝1，L00; the calculation formula of the ith bit symbol entropy coding is as follows:
Figure BDA0002829042130000072
Li＝Li-1+Ri-1F(x-1,r) (5)
according to the information entropy theory, the size of the probability of a symbol determines the size of its self-information volume, i.e. the self-information volume i (x) with a symbol x having a probability p (x) is:
I(x)＝logp(x) (6)
the unit of the self-information quantity I (x) is related to the used logarithmic base number, the commonly used logarithmic base number in the information theory is 2, the unit corresponding to the self-information quantity is bit (bit), and therefore the information entropy is:
Figure BDA0002829042130000073
Figure BDA0002829042130000074
from the above, the information entropy formula of the normalized probability model of the independent discrete random sequence is as follows:
H(X)＝-p(0)log2p(0)-p(1)log2p(1) (9)
where the unit of H (X) is a bit. The information entropy formula of the non-normalized probability model of the random sequence is as follows:
Figure BDA0002829042130000075
where the unit of H (X, r) is bit, let the length of the digital fingerprint be Len, then we can obtain:
Figure BDA0002829042130000076
where p (0) + p (1) ═ 1, n is the bit length of the random sequence, and the reduction formula can be obtained:
Len/n＝-log2r+H(X) (12)
r＝2H(X)-Len/n (13)
obviously, h (x) is obtained from the normalized probability of the independent discrete random sequence symbol 0 or symbol 1, Len is a set digital fingerprint length, and the random sequence length after encoding is also Len obtained by substituting known r, p (0), and p (1) into equations (3), (4), and (5) according to the information entropy theory. A digital fingerprint extracting process for binary sequence in the coding process of Jielin code includes such steps as setting digital fingerprint length Len according to random sequence, converting to positive real number r, setting up a positive real number r to make it satisfy formula (13), coding, and decodingiAs a digital fingerprint, it is also Len in length.
Table 1 below provides a digital fingerprint of a portion of the initial password generated by the jalin code of this embodiment:
Figure BDA0002829042130000081
TABLE 1
It should be understood that in daily life, the password used by the user is more than numbers, letters, "+" and "#" for convenience of use, but the password that can be used in the present embodiment may be any symbol that can be recognized by a computer (i.e., can be converted into a binary system).
The following provides a digital fingerprint output by setting different digital fingerprint lengths (i.e. setting Len with different lengths in bits) when the initial password is G2020010106M:
32bit:6d3f61f0；
64bit:2d9fef7877f6dd85；
128bit:d9e5a02ce5c6c970072ca0bfdb095739；
256bit:7031ff8e3e4a470f849ddc099b6d9bf38aa978b39dec12402c9596045b86ff90；
512bit:4c58ec611e35eba29899b369f4a4fc078f826e7e19dda95af31998db5be495e30750a9cf1f65e5a03d8e485629a0d33c8cfc5f2875281e7c8fbe5a8c630a726e。
s200, the intelligent door lock terminal receives a second password input by the user side, converts the second password into a second binary sequence, and codes the second binary sequence based on the Jielin code to obtain a second hash value:
s201, setting a positive real number
Figure BDA0002829042130000091
Wherein H (X)2) Normalized information entropy, n, representing a second binary sequence2Representing a sequence length of the second binary sequence;
s202, according to a coding formula Ri＝Ri-1r2p (x) and Li＝Li-1+Ri-1F(x-1,r2) Coding the ith bit symbol x in the second binary sequence, and encoding the coded symbol x
Figure BDA0002829042130000092
As a second hash value.
S300, the intelligent door lock terminal compares the first hash value with the second hash value, and if the first hash value is the same as the second hash value, an unlocking instruction is sent to the intelligent door lock, and the unlocking instruction is used for enabling the intelligent door lock to execute unlocking operation; and if the first hash value is different from the second hash value, sending unlocking failure information to the user side.
The steps S200 and S300 are steps in which the user unlocks the lock through the user terminal. Firstly, a user inputs a password (corresponding to the second password in the step S200) at a user end; after the intelligent door lock terminal receives the digital fingerprint, jielin code is adopted to perform the same coding processing, the length of the digital fingerprint adopted in the coding process is the same as that in the step S100, namely Len in the cache, and the coding process is explained above, so that the details are not repeated here. After the intelligent door lock terminal finishes encoding, a hash value (corresponding to the second hash value in the step S200) is obtained, the intelligent door lock terminal compares the hash value with a hash value in storage (the hash value obtained after the initial password encoding, namely the first hash value in the step S100), and if the two hash values are the same, the password input by the user is correct, the intelligent door lock terminal sends an unlocking instruction to the intelligent door lock, so that the intelligent door lock is unlocked; if the two hash values are different, the password input by the user is wrong, and at the moment, unlocking failure information is returned to prompt the user that the input is wrong, and the password can be input again.
The beneficial effects produced by the embodiment are as follows:
according to the prior art, it is assumed that a plurality of intelligent door locks of the same company are purchased in the same family and the same password is set. When any third party cracks, the hash value stored inside is obtained, the fact that the hash values are the same is found, the fact that the intelligent door locks use the same password can be determined, the result that the intelligent door locks are completely cracked when the intelligent door locks are broken easily occurs, the solution can only be that a user sets different passwords for each intelligent door lock, the password management is inconvenient for the user, and the password management is easy to forget.
According to the method, the smart door lock is encrypted by the Jielin code, digital fingerprint lengths with different lengths can be selected and set, and the lengths of hash values output after the digital fingerprint lengths with different lengths are coded by the Jielin code are different, so that the difficulty of brute force cracking is increased. For a user, a plurality of door locks can use the same password, and different digital fingerprint lengths are set on different door locks only when the initial password is set, so that the difficulty of brute force cracking by any third party is improved, and the safety is improved; for door lock enterprises, the same algorithm sets different digital fingerprint lengths, various different lock cylinders can be produced, the difficulty of breaking by brute force can be improved, and the effect of safety is improved.
A second embodiment;
referring to fig. 2, based on the first embodiment, the method further includes the steps of:
s401, after the unlocking instruction is sent to the intelligent door lock in the step S300, the intelligent door lock terminal randomly generates a positive integer, the positive integer is used as a new Len and is stored, and a new positive real number is set
Figure BDA0002829042130000101
Wherein H (X)1) Normalized information entropy, n, representing a first binary sequence1Representing a sequence length of the first binary sequence; in this step, a positive integer is used as a new Len, which replaces the old Len in the cache. New positive real number r1The new Len generated from a positive integer is used in (1). S402, according to a coding formula Ri＝Ri-1r1p (x) and Li＝Li-1+Ri-1F(x-1,r1) Coding the ith bit symbol x in the second binary sequence, and encoding the coded symbol x
Figure BDA0002829042130000102
As a new first hash value;
r in the coding formula of this step1Is the new r described in step S4011。
And S403, the intelligent door lock terminal removes the cached old first hash value and the cached second binary sequence, and stores the new first hash value.
The process of changing the digital fingerprint length to the intelligent door lock that this embodiment means:
the intelligent door lock needs to verify the password of the user at first when the digital fingerprint length is changed, and the intelligent door lock can be used after the intelligent door lock gives a door opening instruction only when the user inputs the correct password. After the intelligent door lock terminal sends a door opening instruction, the terminal can randomly generate a positive integer, as an implementation mode, the positive integer is any positive integer in the range of 32-512, then the positive integer is used as a new Len, then coding is carried out according to a Jielin code coding formula, a new hash value is obtained, the old hash value in the cache is removed, and the new hash value is stored.
The beneficial effect that this embodiment brought: according to the method, the Len value is changed after the door opening instruction is sent every time, so that the stored hash value is changed, the risk of brute force cracking can be reduced, and the safety is improved.
A third embodiment;
referring to fig. 3, based on the first embodiment, the method further includes the steps of:
s501, the intelligent door lock terminal receives a third password sent by the user side, converts the third password into a third binary sequence, and codes the third binary sequence based on the Jielin code to obtain a third hash value.
S5011, setting positive real number
Figure BDA0002829042130000111
Wherein H (X)3) Normalized information entropy, n, representing a ternary binary sequence3Representing the sequence length of the third binary sequence, Len being the length of the stored preset digital fingerprint;
s5012, according to the coding formula Ri＝Ri-1r3p (x) and Li＝Li-1+Ri-1F(x-1,r3) Coding the ith bit symbol x in the third binary sequence, and encoding the coded symbol x
Figure BDA0002829042130000112
As a third hash value.
S502, the intelligent door lock terminal compares the first hash value with the third hash value, if the first hash value is the same as the third hash value, password authentication success information is sent to the user side, and the step S503 is carried out; and if the first hash value is different from the third hash value, sending password authentication failure information to the user side and finishing the operation.
S503, the intelligent door lock terminal receives a fourth password sent by the user side, converts the fourth password into a fourth binary sequence, and codes the fourth binary sequence based on the Jielin code to obtain a fourth hash value.
S5031, randomly generating a positive integer, taking the positive integer as a new Len and storing the Len, and setting a positive real number
Figure BDA0002829042130000121
Wherein H (X)4) Normalized information entropy, n, representing a fourth binary sequence4Represents a sequence length of the fourth binary sequence;
in this step, a positive integer is used as a new Len, which replaces the old Len in the cache. Positive real number r4The new Len generated from a positive integer is used.
S5032, according to the coding formula Ri＝Ri-1r4p (x) and Li＝Li-1+Ri-1F(x-1,r4) Coding the ith bit symbol x in the fourth binary sequence, and encoding the coded symbol x
Figure BDA0002829042130000122
As a fourth hash value.
S504, the intelligent door lock terminal removes the cached old first hash value and the cached fourth binary sequence, and the intelligent door lock terminal takes the fourth hash value as a new first hash value and stores the new first hash value.
The step of the user replacing the password in this embodiment is as follows:
firstly, the intelligent door lock terminal verifies the password input by the user, and the password can be replaced only after the password is successfully verified. After the intelligent door lock terminal verifies the correct password, the steps S503 and S504 are carried out, the terminal receives a new password (corresponding to the fourth password in the step) input by a user, sets a new digital fingerprint length Len, carries out Jielin code coding on the password to obtain a new hash value (corresponding to the fourth hash value in the step), then cleans up the old hash value in the cache, stores the new hash value, finishes password replacement, and changes the hash value in the intelligent door lock after the step is finished.
The beneficial effect that this embodiment brought: the user changes the password by the method of the embodiment, after the same password is used for a long time, the risk that the password is leaked in daily life is increased, and the user can modify the password, so that the password security can be improved.
As an optional implementation manner, when receiving the fourth password, the user may be required to input twice, and if the received next fourth password is different from the previous fourth password, the information that the former password and the later password are inconsistent is sent to the user side. The advantage of requiring two inputs is that errors in the user input (e.g. inputting the number 3 to 5) are avoided, the user's impression of the password is enhanced, and the user cannot easily forget.
A fourth embodiment;
referring to fig. 4, a smart door lock encryption device based on the jerrin code is provided, which may be any type of smart terminal, such as a mobile phone, a tablet computer, a personal computer, etc. Specifically, the apparatus includes: one or more control processors and memory, here exemplified by a control processor. The control processor and the memory may be connected by a bus or other means, here exemplified by a connection via a bus.
The memory, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the smart door lock encryption device based on the jerry code in the embodiments of the present invention. The control processor implements the smart door lock encryption method based on the jerry code of the above method embodiments by running non-transitory software programs, instructions and modules stored in the memory.
The memory may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function. Further, the memory may include high speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory remotely located from the control processor, and these remote memories may be connected to the smart jerry code-based door lock encryption device over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof. The one or more modules are stored in the memory and, when executed by the one or more control processors, perform the smart doorlock encryption method based on the jerry code in the above method embodiments.
An embodiment of the present invention further provides a computer-readable storage medium, which stores computer-executable instructions for causing a computer to execute a smart door lock encryption method based on a jerry code according to the first embodiment of the present invention.
Through the above description of the embodiments, those skilled in the art can clearly understand that the embodiments can be implemented by software plus a general hardware platform. Those skilled in the art will appreciate that all or part of the processes in the methods of the above embodiments may be implemented by a computer program that can be executed by associated hardware, and the computer program may be stored in a computer readable storage medium, and when executed, may include the processes of the above embodiments of the methods. The storage medium may be a magnetic disk, an optical disk, a Read Only Memory (ROM), a Random Access Memory (RAM), or the like.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an illustrative embodiment," "an example," "a specific example," or "some examples" or the like mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an illustrative embodiment," "an example," "a specific example," or "some examples" or the like mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.

Claims (8)

1. An intelligent door lock encryption method based on Jelin codes is characterized by being used for an intelligent door lock terminal and comprising the following steps:
s100, receiving a first password input by a user side, converting the first password into a first binary sequence, coding the first binary sequence based on a Jielin code to obtain a first hash value and storing:
s101, randomly generating a positive integer Len as a preset digital fingerprint length, storing the positive integer Len, and setting a positive real number
Figure FDA0002829042120000011
Wherein H (X)1) Normalized information entropy, n, representing said first binary sequence1Representing a sequence length of the first binary sequence;
s102, according to a coding formula Ri＝Ri-1r1p (x) and Li＝Li-1+Ri-1F(x-1,r1) Coding the ith bit symbol x in the first binary sequence, and coding the ith bit symbol x
Figure FDA0002829042120000012
As the first hash value and storing; wherein R is0＝1，L00, p (x) denotes the normalized probability of x, F (x-1, r)1) A non-normalized distribution function representing x-1;
s200, receiving a second password input by the user side, converting the second password into a second binary sequence, and coding the second binary sequence based on the Jelin code to obtain a second hash value:
s201, setting a positive real number
Figure FDA0002829042120000013
Wherein H (X)2) Normalized information entropy, n, representing the second binary sequence2Representing a sequence length of the second binary sequence;
s202, according to a coding formula Ri＝Ri-1r2p (x) and Li＝Li-1+Ri-1F(x-1,r2) Coding the ith bit symbol x in the second binary sequence, and coding the ith bit symbol x
Figure FDA0002829042120000014
As the second hash value;
s300, comparing the first hash value with the second hash value, and if the first hash value is the same as the second hash value, sending an unlocking instruction to the intelligent door lock, wherein the unlocking instruction is used for enabling the intelligent door lock to execute unlocking operation; and if the first hash value is different from the second hash value, sending unlocking failure information to the user side.
2. The smart door lock encryption method based on jerrin code as claimed in claim 1, further comprising the steps of:
S401. after the step S300 executes the unlocking instruction sent to the intelligent door lock, a positive integer is randomly generated, the positive integer is used as the new Len and is stored, and a new positive real number is set
Figure FDA0002829042120000021
Figure FDA0002829042120000022
S402, according to a coding formula Ri＝Ri-1r1p (x) and Li＝Li-1+Ri-1F(x-1,r1) Coding the ith bit symbol x in the second binary sequence, and coding the ith bit symbol x
Figure FDA0002829042120000023
As a new said first hash value;
s403, removing the cached old first hash value and the cached second binary sequence, and storing the new first hash value.
3. The smart door lock encryption method based on jerrin code as claimed in claim 1, further comprising the steps of:
s501, receiving a third password sent by the user side, converting the third password into a third binary sequence, and encoding the third binary sequence based on the Jielin code to obtain a third hash value:
s5011, setting positive real number
Figure FDA0002829042120000024
Wherein H (X)3) Normalized information entropy, n, representing the ternary binary sequence3Representing a sequence length of the third binary sequence;
s5012, according to the coding formula Ri＝Ri-1r3p (x) and Li＝Li-1+Ri-1F(x-1,r3) For the ith bit in the third binary sequenceCoding the symbol x, and encoding the coded symbol x
Figure FDA0002829042120000025
As the third hash value;
s502, comparing the first hash value with the third hash value, if the first hash value is the same as the third hash value, sending password verification success information to the user side, and entering the step S503; if the first hash value is different from the third hash value, sending password authentication failure information to the user side and finishing operation;
s503, receiving a fourth password sent by the user, converting the fourth password into a fourth binary sequence, and encoding the fourth binary sequence based on the jielin code to obtain a fourth hash value:
s5031, randomly generating a positive integer, taking the positive integer as a new Len and storing the Len, and setting a positive real number
Figure FDA0002829042120000031
Wherein H (X)4) Normalized information entropy, n, representing the fourth binary sequence4Representing a sequence length of the fourth binary sequence;
s5032, according to the coding formula Ri＝Ri-1r4p (x) and Li＝Li-1+Ri-1F(x-1,r4) Coding the ith bit symbol x in the fourth binary sequence, and coding the ith bit symbol x
Figure FDA0002829042120000032
As the fourth hash value;
s504, removing the cached old first hash value and the cached fourth binary sequence, taking the fourth hash value as a new first hash value, and storing the new first hash value.
4. The smart door lock encryption method based on the jerrin code as claimed in claim 3, wherein the step of receiving the fourth password sent by the user terminal further comprises the steps of:
and receiving the fourth password sent by the user side twice continuously, and if the received next fourth password is different from the previous fourth password, sending inconsistent information of the previous password and the next password to the user side.
5. The smart door lock encryption method based on jerrin code as claimed in claim 1, wherein the first password is composed of any one or more than one symbol that can be recognized by computer.
6. The smart door lock encryption method based on jerrin code as claimed in claim 1, wherein the Len is any positive integer in the range of 32 to 512.
7. An intelligent door lock encryption device based on a jerrin code, comprising: at least one control processor and a memory for communicative connection with the at least one control processor; the memory stores instructions executable by the at least one control processor to enable the at least one control processor to perform the smart jersey code-based door lock encryption method of any of claims 1 to 6.
8. A computer-readable storage medium storing computer-executable instructions for causing a computer to perform the smart door lock encryption method based on jerry code of any one of claims 1 to 6.
CN202011437785.0A 2020-12-10 2020-12-10 Intelligent door lock encryption method and equipment based on Jilin code and storage medium Active CN112634492B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011437785.0A CN112634492B (en) 2020-12-10 2020-12-10 Intelligent door lock encryption method and equipment based on Jilin code and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011437785.0A CN112634492B (en) 2020-12-10 2020-12-10 Intelligent door lock encryption method and equipment based on Jilin code and storage medium

Publications (2)

Publication Number Publication Date
CN112634492A CN112634492A (en) 2021-04-09
CN112634492B true CN112634492B (en) 2022-03-01

Family

ID=75309170

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011437785.0A Active CN112634492B (en) 2020-12-10 2020-12-10 Intelligent door lock encryption method and equipment based on Jilin code and storage medium

Country Status (1)

Country Link
CN (1) CN112634492B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113407875B (en) * 2021-05-06 2022-10-04 湖南幻影三陆零科技有限公司 Jelin code-based disinfectant effect testing method and system

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101777115A (en) * 2009-11-25 2010-07-14 中国科学院自动化研究所 Safe fingerprint verification method and system
KR101566416B1 (en) * 2014-07-07 2015-11-09 건국대학교 산학협력단 Method and device of data encription with increased security
CN111277405A (en) * 2020-01-04 2020-06-12 浙江科技学院 Method for accessing intelligent equipment by using timeliness password in semi-offline environment
CN111385103A (en) * 2020-05-29 2020-07-07 腾讯科技（深圳）有限公司 Authority processing method, system and device and electronic equipment
CN111918305A (en) * 2020-07-24 2020-11-10 湖南遥昇通信技术有限公司 Same-frequency self-organizing self-healing network method and device
EP3736780A1 (en) * 2019-05-06 2020-11-11 Universitat Pompeu Fabra A method for remotely controlling features of a device and a remote keyless entry instrument

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101777115A (en) * 2009-11-25 2010-07-14 中国科学院自动化研究所 Safe fingerprint verification method and system
KR101566416B1 (en) * 2014-07-07 2015-11-09 건국대학교 산학협력단 Method and device of data encription with increased security
EP3736780A1 (en) * 2019-05-06 2020-11-11 Universitat Pompeu Fabra A method for remotely controlling features of a device and a remote keyless entry instrument
CN111277405A (en) * 2020-01-04 2020-06-12 浙江科技学院 Method for accessing intelligent equipment by using timeliness password in semi-offline environment
CN111385103A (en) * 2020-05-29 2020-07-07 腾讯科技（深圳）有限公司 Authority processing method, system and device and electronic equipment
CN111918305A (en) * 2020-07-24 2020-11-10 湖南遥昇通信技术有限公司 Same-frequency self-organizing self-healing network method and device

Also Published As

Publication number Publication date
CN112634492A (en) 2021-04-09

Similar Documents

Publication Publication Date Title
Ignatenko et al. Biometric systems: Privacy and secrecy aspects
US7620818B2 (en) Biometric based user authentication and data encryption
CN109658078B (en) Block chain private key generation method, device and medium based on biological characteristics
CN106161006B (en) Digital encryption algorithm
CN107181600B (en) Password login authentication method and system, user equipment and authentication server
CN112883386B (en) Digital fingerprint processing and signature processing method, device and storage medium
JP2004534333A (en) Integrated protection method and system for distributed data processing in computer networks
US20060123239A1 (en) Biometric based user authentication with syndrome codes
CN116032474A (en) Safety protection system based on big data computer network
CN110717151A (en) Digital fingerprint processing and signature processing method
CN112634492B (en) Intelligent door lock encryption method and equipment based on Jilin code and storage medium
WO2020243000A1 (en) Vaultless format-preserving tokenization systems and methods
CN115426101B (en) Data transmission method of cloud intercommunication platform
WO2017107530A1 (en) Electronic password lock for spark databases and method for operating same
CN110688092B (en) Random number generation method, device, equipment and storage medium
CN111222177A (en) Digital fingerprint processing and signature processing method
CN116132977A (en) Mouse safety encryption authentication method
CN107239693B (en) Analysis method and system based on password coding rule
Abiega-L’Eglisse et al. A new fuzzy vault based biometric system robust to brute-force attack
CN115065471A (en) Method for safely and remotely upgrading password card
TW201843613A (en) Personal identity authentication method and system using graphic lock capable of ensuring a high-security identity authentication
CN112019327A (en) White box implementation method and device, electronic equipment and computer storage medium
CN116663041B (en) RPA flow robot data intelligent processing method and system
CN110941815A (en) Novel password
CN116737741B (en) Platform merchant balance data real-time updating processing method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20230724

Address after: 10 / F, business incubation building, No.001 Jinzhou North Road, Ningxiang high tech Industrial Park, Changsha, Hunan 410000

Patentee after: Hunan Yaosheng Communication Technology Co.,Ltd.

Address before: Room 2605, office building 3, area C, Kaifu Wanda Plaza, 589 Zhongshan Road, Kaifu District, Changsha City, Hunan Province, 410000

Patentee before: Xintong Construction Technology Co.,Ltd.