CN105550121B - A kind of RFID tag and user area reading/writing method - Google Patents
A kind of RFID tag and user area reading/writing method Download PDFInfo
- Publication number
- CN105550121B CN105550121B CN201510883355.4A CN201510883355A CN105550121B CN 105550121 B CN105550121 B CN 105550121B CN 201510883355 A CN201510883355 A CN 201510883355A CN 105550121 B CN105550121 B CN 105550121B
- Authority
- CN
- China
- Prior art keywords
- sub
- district
- read
- space
- password
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/0284—Multiple user address space allocation, e.g. using different base addresses
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Bioethics (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Databases & Information Systems (AREA)
- Storage Device Security (AREA)
Abstract
The present invention relates to a kind of RFID tag, multiple index markers are set, the digit L of each index marker is more than or equal to log2 in index area(M/N)And L is integer, M is user area space, N is assignable minimum space, it is integer that the quantity G of index marker, which is less than or equal to M/N and G, and each index marker is successively numbered according to natural number and is corresponding in turn to all N.In the present invention, user area by dynamically distributed to son using, its distribution that sub-district is carried out according to the required space of son application, continuous large space can be distributed to biggish son application, and lesser son application distributes small space, the case where avoiding prior art neutron discontinuous using space and space waste, and cipher mode can be arranged in each sub-district, for the son application three kinds of password storage modes of distribution for needing high secret grade, higher security level is realized, the space of sub-district will not be also wasted.
Description
Technical field
The invention belongs to passive RFID electronic label user area configuration technologiesField, especially a kind of RFID tag and use
Family area reading/writing method.
Background technique
Passive RFID (Radio Frequency Identification) technology, also known as radio frequency identification is a kind of
The communication technology can be identified specific objective by radio signals and read and write related data, without identifying system and specific objective
Between establish mechanical or optical contact.Passive RFID tags storage region can be divided into four kinds at present, be respectively as follows: label information area,
Code area, safety zone, user area, label information area therein are used to store the unique identification of label, are label manufacturer
It is written, can not modify in label chip factory；Code area is used to store the coded data of label, and user can answer according to respective
Label is encoded with rule；Safety zone is used to store the password and safe mode parameter of label；It is used for storing user area
User data.User area can be divided into one or more user's sub-districts again, and each user's sub-district has respective access password, access
Permission control.
Above-mentioned each user area memory space mean allocation and can not dynamic regulation, under complicated application demand, for number
According to the demand of security isolation, it is desirable that son applies independent partitions, and son differs greatly using required memory headroom, in needing
Two may be distributed or more with more user's sub-districts by depositing the big son application in space, and need separately to access cannot for each sub-district data
It crosses the border, so that the time of data access lengthens, speed slows down, and the son application of memory headroom very little is needed also to distribute one solely
Vertical user's sub-district, the occupied waste for causing memory source of memory headroom that son takes less than, low efficiency.Each use simultaneously
Family sub-district is all assigned with independent access password storage area, separates according to agreement 32 read-write passwords, occupies memory space 64
Position, no matter whether application needs read-write password to control access authority, this region all fixed allocations cannot be used to store user
Data cause the waste of data space.
Summary of the invention
It is an object of the invention to overcome the deficiencies of the prior art and provide carry out space distribution according to sub- application size and press
A kind of RFID tag of password setting is written and read using encryption level according to son.
The technical solution adopted by the present invention is that:
Index area is arranged in the safety zone of label in a kind of RFID tag, it is characterised in that: multiple ropes are arranged in index area
The digit L of tendering will, each index marker is more than or equal to log2(M/N)And L is integer, M is user area space, N is assignable
Minimum space, it is integer that the quantity G of index marker, which is less than or equal to M/N and G, and each index marker is successively compiled according to natural number
Number and be corresponding in turn to all N；
User area space is divided according to the quantity sequence of sub- application, every height application the space occupied is named as sub-district and son
Area is successively labeled according to natural number, and each sub-district occupies the total of the space of at least one N and all sub-district the space occupied
Be less than or equal to M；
The end position number of a upper sub-district for first sub-district is equal to -1, the end position of each remaining sub-district
Number is the number for the corresponding index marker of the last one N that the sub-district occupies, and the end position number of each sub-district is successively write
Enter in index marker, the subsequent all index markers of index marker that the last one sub-district occupies fill in identical numerical value and the number
Value is equal to the number for the corresponding index marker of the last one N that the last one sub-district occupies；
Each sub-district starts setting up a cipher mode mark, which is used to show the encryption side of the sub-district
Formula, cipher mode is divided into no password, read-write password separates and read-write password unification, removes cipher mode mark in the sub-district of no password
Whole spaces other than will are memory block, and read-write password separates and the space of the sub-district of read-write password unification is cipher mode mark
Will, password area and the summation of memory block.
It is a further object to provide a kind of division methods of RFID tag, it is characterised in that: including following step
It is rapid:
According to sub- application quantity sequence divide user area space, every height application the space occupied be named as sub-district and
Sub-district is successively labeled according to natural number, and each sub-district occupies the space of at least one N and all sub-district the space occupied
Summation is less than or equal to M；
(2) the end position number of a upper sub-district for first sub-district is equal to -1, the stop bits of each remaining sub-district
The number that number is the corresponding index marker of the last one N that the sub-district occupies is set, the end position number of each sub-district is successively
It is written in index marker；
(3) the subsequent all index markers of index marker that the last one sub-district occupies fill in identical numerical value and the numerical value
More than or equal to the number for the corresponding index marker of the last one N that the last one sub-district occupies；
(4) each sub-district starts setting up a cipher mode mark, which is used to show the encryption of the sub-district
Mode, cipher mode is divided into no password, read-write password separates and read-write password unification；
(5) the cipher mode according to step (4) carries out space allocation to every sub- application area, removes in the sub-district of no password
Whole spaces other than cipher mode mark are memory block, and read-write password separates and the space of the sub-district of read-write password unification is to add
Close mode mark, password area and memory block summation.
It is a further object to provide a kind of reading/writing methods of RFID tag, it is characterised in that: including following step
It is rapid:
(1) the index marker in the index area of safety zone is read, the end position number of each sub-district is obtained, calculates every height
The formula of area's occupied space: the number of each sub-district end position subtracts after a sub- end of extent Position Number multiplied by N；
(2) whether judgment formula result is 0,
If not being 0, the information of each sub-district is obtained, into next step；
If it is 0, return address Access Violation is exited；
(3) judge cipher mode, read the cipher mode mark in each sub-district, judge the cipher mode of each sub-district；
When cipher mode is no password, the read-write operation of memory block is carried out, and return to operation successful information；
When cipher mode is that read-write password is unified, enter step (4)；
When cipher mode separates for read-write password, enter step (5)；
(4) when cipher mode is that read-write password is unified, judge whether 32 read-write passwords are correct,
When correct, the read-write operation of memory block is carried out, and returns to operation successful information；
Cryptographic acess mistake is returned when incorrect, is exited；
(5) when cipher mode separates for read-write password, judge that current operation is reading or write operation, and judgement is read respectively
Password or whether write password correct；
When correct, read operation or the write operation of memory block are carried out, and returns to operation successful information；
Cryptographic acess mistake is returned when incorrect, is exited.
The advantages and positive effects of the present invention are:
In the present invention, son is dynamically distributed to using according to son application required space progress sub-district in user area
Distribution, the summation that each sub-district occupies the space of at least one N and all sub-district the space occupied is less than or equal to M, each sub-district
Beginning and end position determined by its number of the corresponding index marker of the last one N occupied, it is possible thereby to give biggish
Son application distributes continuous large space, and lesser son application distributes small space, avoids prior art neutron using sky
Between discontinuous and space waste the case where, and cipher mode can be arranged in each sub-district, to need the son of high secret grade to answer
With three kinds of password storage modes of distribution, memory block as big as possible is provided for the lower son application of secret grade, is realized higher
Security level, will not also waste the space of sub-district.
Detailed description of the invention
Fig. 1 is the relational graph of the number of each N and index marker in existing user area；
Fig. 2 is the schematic diagram that the present invention is dynamically distributed according to sub- application size；
Fig. 3 is the schematic diagram that password area and memory partitioning are matched in the sub-district of Fig. 2；
Fig. 4 is the read-write process of the sub-district of Fig. 2.
Specific embodiment
Below with reference to embodiment, the present invention is further described, following embodiments be it is illustrative, be not restrictive,
It cannot be limited the scope of protection of the present invention with following embodiments.
Index area, innovation of the invention is arranged as shown in Figure 1,2,3, 4 in a kind of RFID tag in the safety zone of label
It is: multiple index markers is set in index area, the digit L of each index marker is more than or equal to log2(M/N)And L is integer, M is
User area space, N are assignable minimum space, and the quantity G of index marker is less than or equal to M/N and G is integer, each index mark
Will is successively numbered according to natural number and is corresponding in turn to all N；
User area space is divided according to the quantity sequence of sub- application, every height application the space occupied is named as sub-district and son
Area is successively labeled according to natural number, and each sub-district occupies the total of the space of at least one N and all sub-district the space occupied
Be less than or equal to M；
The end position number of each sub-district is sequentially written in index marker, the end of a upper sub-district for first sub-district
Position Number is equal to -1, and the end position number of each remaining sub-district is the corresponding rope of the last one N that the sub-district occupies
The assignment of the number of tendering will, the subsequent all index markers of the corresponding index marker of the last one N is more than or equal to last
The number for the corresponding index marker of the last one N that a sub-district occupies；
Each sub-district starts setting up a cipher mode mark, which is used to show the encryption side of the sub-district
Formula, cipher mode is divided into no password, read-write password separates and read-write password unification, removes cipher mode mark in the sub-district of no password
Whole spaces other than will are memory block, and read-write password separates and the space of the sub-district of read-write password unification is cipher mode mark
Will, password area and the summation of memory block.
Above structure is described as follows:
As shown in Figure 1, setting L=4=log2(M/N), the total capacity of user area is M=4096bits, and sub-district is assignable
Minimum space is N=256bits, and the quantity G of sub-district is less than or equal to M/N, and G is that the remainder of above formula is rounded downwards, calculated result G=
16, i.e. sub-district 0~15, i.e. index marker share 16, and number is 0~15 respectively and corresponding with 16 N sequences, in figure most
Fritter 0~15 is N0~N15.
As shown in Fig. 2, being actually subjected to using the son application of user area be 5, if be allocated according to above-mentioned 16 N, gesture
A little application must be had and need to occupy discontinuous space, so being allocated according to the following rules:
Be allocated according to the space dosage of sub- application: son occupies a N using 0, is named as sub-district 0；Son is occupied using 1
2 N, are named as sub-district 1；Son occupies 3 N using 2, is named as sub-district 2；Son occupies 4 N using 3, is named as sub-district 3；Son is answered
5 N are occupied with 4, are named as sub-district 4；One N of residue is unallocated.
- 1 end position of a upper sub-district and index marker -1 of sub-district 0 are not present, institute upper one taking human as regulation
The number for the corresponding index marker of the last one N that sub-district -1 occupies is -1, i.e. the number of -1 end position of sub-district is -1.
Sub-district 0 occupies a N, so its end position number is the number of the corresponding index marker of the last one N, i.e., it is sub
The end position number in area 0 is 0, and similarly the number of the index marker of 1 the last one N of sub-district is 2, and the end position of sub-district 1 is compiled
Number be 2；The end position number of sub-district 2 is 5；The end position number of sub-district 3 is 9；The end position number of sub-district 4 is 14；
The end position number of sub-district 0~4 is sequentially written in index marker 0~4, completes the division of sub-district.
The number that the size in each sub-district space is equal to current sub-district end position subtracts a sub- end of extent position
Multiplied by N after number, specifically: the size of sub-district 0 subtracts -1 for 0, occupies 1 sub-district, space is assigned as 0~255bits；
The size of sub-district 1 subtracts 0 for 2, occupies 2 sub-districts, and 256~767bits is distributed in space, and so on, 2 allocation space of sub-district
For 768~1535bits, 3 allocation space of sub-district is 1536~2559bits, sub- 4 allocation space of application area is 2560~
The space of 3839bits, the last one remaining N are 3840~4095bits.
In order to avoid the influence that subsequent 5~15 pairs of sub-district spaces of index marker calculate, the index marker that sub-district 4 is occupied
4 subsequent all index markers 5~15 extend this as the number of the corresponding index marker 14 of the last one N14 of the occupancy of sub-district 4, tool
Body is equal to 14, two adjacent index markers number (being equivalent to sub-district end position number) in such index marker 5~15
Difference is 0 and index marker 5 is filled in numerical value and 4 end position of sub-district number the difference of (numerical value filled in index marker 4)
Value is also 0, indicates not corresponding to any sub-district in these index markers 5~15, also unallocated any space.
Each sub-district starts setting up a cipher mode mark, which is used to show the encryption side of the sub-district
Formula, cipher mode is divided into no password, read-write password separates and read-write password unification, removes cipher mode mark in the sub-district of no password
Whole spaces other than will are memory block, and read-write password separates and the space of the sub-district of read-write password unification is cipher mode mark
Will, password area and the summation of memory block.
As shown in figure 3, cipher mode mark occupies 2bits, numerical value is respectively 00,01,10 and 11, specifically: sub-district 0
Cipher mode mark is 00, means sub-district 0 without password；The cipher mode mark of sub-district 1 is 01, and reading and writing password separates and is
16；The cipher mode mark of sub-district 2,3 is 10, and read-write password is unified and length is 32；The cipher mode mark of sub-district 4 is
11, reading and writing password separates and is 32.
The division methods of the structure of above-mentioned RFID tag user area the following steps are included:
According to sub- application quantity sequence divide user area space, every height application the space occupied be named as sub-district and
Sub-district is successively labeled according to natural number, and each sub-district occupies the space of at least one N and all sub-district the space occupied
Summation is less than or equal to M；
(2) the end position number of a upper sub-district for first sub-district is equal to -1, the stop bits of each remaining sub-district
The number that number is the corresponding index marker of the last one N that the sub-district occupies is set, the end position number of each sub-district is successively
It is written in index marker；
(3) the subsequent all index markers of index marker that the last one sub-district occupies fill in identical numerical value and the numerical value
Equal to the number for the corresponding index marker of the last one N that the last one sub-district occupies；
(4) each sub-district starts setting up a cipher mode mark, which is used to show the encryption of the sub-district
Mode, cipher mode is divided into no password, read-write password separates and read-write password unification；
(5) the cipher mode according to step (4) carries out space allocation to every sub- application area, removes in the sub-district of no password
Whole spaces other than cipher mode mark are memory block, and read-write password separates and the space of the sub-district of read-write password unification is to add
Close mode mark, password area and memory block summation.
The reading/writing method of the structure of above-mentioned RFID tag user area the following steps are included:
(1) the index marker in the index area of safety zone is read, the end position number of each sub-district is obtained, calculates every height
The formula of area's occupied space: the number of each sub-district end position subtracts after a sub- end of extent Position Number multiplied by N；
(2) whether judgment formula result is 0,
If not being 0, the information of each sub-district is obtained, into next step；
If it is 0, return address Access Violation is exited；
(3) judge cipher mode, read the cipher mode mark in each sub-district, judge the cipher mode of each sub-district；
When cipher mode is no password, the read-write operation of memory block is carried out, and return to operation successful information；
When cipher mode is that read-write password is unified, enter step (4)；
When cipher mode separates for read-write password, enter step (5)；
(4) when cipher mode is that read-write password is unified, judge whether 32 read-write passwords are correct,
When correct, the read-write operation of memory block is carried out, and returns to operation successful information；
Cryptographic acess mistake is returned when incorrect, is exited；
(5) when cipher mode separates for read-write password, judge that current operation is reading or write operation, and judgement is read respectively
Password or whether write password correct；
When correct, read operation or the write operation of memory block are carried out, and returns to operation successful information；
Cryptographic acess mistake is returned when incorrect, is exited.
In the present invention, son is dynamically distributed to using according to son application required space progress sub-district in user area
Distribution, the summation that each sub-district occupies the space of at least one N and all sub-district the space occupied is less than or equal to M, each sub-district
Beginning and end position determined by its number of the corresponding index marker of the last one N occupied, it is possible thereby to give biggish
Son application distributes continuous large space, and lesser son application distributes small space, avoids prior art neutron using sky
Between discontinuous and space waste the case where, and cipher mode can be arranged in each sub-district, to need the son of high secret grade to answer
With three kinds of password storage modes of distribution, memory block as big as possible is provided for the lower son application of secret grade, is realized higher
Security level, will not also waste the space of sub-district.
Claims (3)
1. index area is arranged in the safety zone of label in a kind of RFID tag, it is characterised in that: multiple indexes are arranged in index area
The digit L of mark, each index marker is more than or equal to log2(M/N)And L is integer, M is user area space, N be it is assignable most
Small space, it is integer that the quantity G of index marker, which is less than or equal to M/N and G, and each index marker is successively numbered according to natural number
And it is corresponding in turn to all N；
According to sub- application quantity sequence divide user area space, every height application the space occupied be named as sub-district and sub-district by
It is successively labeled according to natural number, each sub-district occupies the space of at least one N and the summation of all sub-district the space occupied is small
In equal to M；
The end position number of a upper sub-district for first sub-district is equal to -1, and the end position of each remaining sub-district is numbered
End position number for the number for the corresponding index marker of the last one N that the sub-district occupies, each sub-district is sequentially written in rope
In tendering will, the subsequent all index markers of index marker that the last one sub-district occupies fill in identical numerical value and the numerical value etc.
In the number for the corresponding index marker of the last one N that the last one sub-district occupies；
Each sub-district starts setting up a cipher mode mark, which is used to show the cipher mode of the sub-district,
Cipher mode is divided into no password, read-write password separates and read-write password unification, removes cipher mode mark in the sub-district of no password
Whole spaces in addition be memory block, read-write password separate and read-write password unification sub-district space be cipher mode mark,
The summation of password area and memory block.
2. a kind of division methods of RFID tag according to claim 1, it is characterised in that: the following steps are included:
(1) user area space is divided according to the quantity sequence of sub- application, every height application the space occupied is named as sub-district and sub-district
It is successively labeled according to natural number, each sub-district occupies the summation in the space of at least one N and all sub-district the space occupied
Less than or equal to M；
(2) the end position number of a upper sub-district for first sub-district is equal to -1, and the end position of each remaining sub-district is compiled
Number for the sub-district occupy the corresponding index marker of the last one N number, each sub-district end position number is sequentially written in
In index marker；
(3) the subsequent all index markers of index marker that the last one sub-district occupies fill in identical numerical value and the numerical value is equal to
The number for the corresponding index marker of the last one N that the last one sub-district occupies；
(4) each sub-district starts setting up a cipher mode mark, which is used to show the encryption side of the sub-district
Formula, cipher mode is divided into no password, read-write password separates and read-write password unification；
(5) the cipher mode according to step (4) carries out space allocation to every sub- application area, removes encryption in the sub-district of no password
Whole spaces other than mode mark are memory block, and read-write password separates and the space of the sub-district of read-write password unification is encryption side
Formula mark, password area and the summation of memory block.
3. a kind of reading/writing method of RFID tag according to claim 1, it is characterised in that: the following steps are included:
(1) the index marker in the index area of safety zone is read, the end position number of each sub-district is obtained, calculates each sub-district and account for
With the formula in space: the number of each sub-district end position subtracts after upper one sub- end of extent Position Number multiplied by N；
(2) whether judgment formula result is 0,
If not being 0, the information of each sub-district is obtained, into next step；
If it is 0, return address Access Violation is exited；
(3) judge cipher mode, read the cipher mode mark in each sub-district, judge the cipher mode of each sub-district；
When cipher mode is no password, the read-write operation of memory block is carried out, and return to operation successful information；
When cipher mode is that read-write password is unified, enter step (4)；
When cipher mode separates for read-write password, enter step (5)；
(4) when cipher mode is that read-write password is unified, judge whether 32 read-write passwords are correct,
When correct, the read-write operation of memory block is carried out, and returns to operation successful information；
Cryptographic acess mistake is returned when incorrect, is exited；
(5) when cipher mode separates for read-write password, judge that current operation is reading or write operation, and password is read in judgement respectively
Or whether write password correct；
When correct, read operation or the write operation of memory block are carried out, and returns to operation successful information；
Cryptographic acess mistake is returned when incorrect, is exited.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510883355.4A CN105550121B (en) | 2015-12-04 | 2015-12-04 | A kind of RFID tag and user area reading/writing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510883355.4A CN105550121B (en) | 2015-12-04 | 2015-12-04 | A kind of RFID tag and user area reading/writing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105550121A CN105550121A (en) | 2016-05-04 |
| CN105550121B true CN105550121B (en) | 2019-01-25 |
Family
ID=55829315
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510883355.4A Expired - Fee Related CN105550121B (en) | 2015-12-04 | 2015-12-04 | A kind of RFID tag and user area reading/writing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105550121B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112101502B (en) * | 2020-08-28 | 2022-06-21 | 智汇芯联(厦门)微电子有限公司 | RFID (radio frequency identification) tag chip and EPC (evolved packet core) area and user area size distribution method thereof |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104142979A (en) * | 2014-07-15 | 2014-11-12 | 武汉理工大学 | Index method for realizing RFID (Radio Frequency Identification Devices) tag storage management |
| CN104281529A (en) * | 2013-07-12 | 2015-01-14 | 北京金辉东方科技有限公司 | High-capacity RFID (radio frequency identification device) electronic tag dynamic partitioning method as well as electronic tag and application |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100964374B1 (en) * | 2007-12-17 | 2010-06-17 | 한국전자통신연구원 | Device and Method for Managing Memory in RFID Tag |
-
2015
- 2015-12-04 CN CN201510883355.4A patent/CN105550121B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104281529A (en) * | 2013-07-12 | 2015-01-14 | 北京金辉东方科技有限公司 | High-capacity RFID (radio frequency identification device) electronic tag dynamic partitioning method as well as electronic tag and application |
| CN104142979A (en) * | 2014-07-15 | 2014-11-12 | 武汉理工大学 | Index method for realizing RFID (Radio Frequency Identification Devices) tag storage management |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105550121A (en) | 2016-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107357534A (en) | A kind of dynamic switching method and system of flash block pattern | |
| CN104903842B (en) | Method and system for asynchronous naked core operation in the nonvolatile memory | |
| RU2438173C1 (en) | Method of managing access rights in smart card | |
| CN106056003A (en) | Apparatus and method for generating identification key | |
| CN103827879A (en) | Method of securing memory against malicious attack | |
| CN105550121B (en) | A kind of RFID tag and user area reading/writing method | |
| CN209402526U (en) | The key storage device of safety chip | |
| CN104518987A (en) | Method and device for processing parallel multithreading messages | |
| CN105787392B (en) | A kind of data read-write control method and control device | |
| CN104714894A (en) | Layered phase-change memory abrasion equilibrating method and system based on random mapping | |
| CN107665097A (en) | A kind of method, apparatus and computer-readable recording medium of solid state hard disc subregion | |
| CN104142979B (en) | A kind of indexing means for realizing RFID tag storage management | |
| CN107391035B (en) | A method of being perceived by misprogrammed reduces solid-state mill damage | |
| CN104506563A (en) | Process access control method, process access control system and terminal | |
| CN105389266A (en) | Data management method and apparatus | |
| CN103377135A (en) | Addressing method, device and system | |
| MXPA05013842A (en) | Method for carrying out update writing and allocating a memory used for file writing on a memory carrier in the form of a chip card. | |
| CN104281529B (en) | Large Copacity RFID dynamic zoning method and electronic tag and application | |
| CN102651079A (en) | IC (integrated circuit) card management method occupying memory space for a short time and IC card management system | |
| CN111159767A (en) | Key container management method for V2X application in smart card mode | |
| CN107203479A (en) | Hierarchical storage system, storage control and hierarchical control method | |
| CN108241468A (en) | I/O command processing method and solid storage device | |
| CN105959350A (en) | Distributed data storage method and device | |
| CN108460074A (en) | Multiple row based on BloomFilter indexes establishment and application method in row deposit data library | |
| CN1369086A (en) | Portable data carrier and method for using the same in plurality of application |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20191121 Address after: 300308 unit 1, floor 4, building 7, Zhongxing Industrial base, No. 2, Dongqi Road, free trade zone (Airport Economic Zone), Binhai New Area, Tianjin Patentee after: Tianjin IOT Xinyuan Technology Development Co., Ltd Address before: 300308, Tianjin Binhai New Area Airport Economic Zone business park on the eastern side of E10 building, 5 floor Patentee before: TIANJIN ZHIHUI XINYUAN TECHNOLOGY CO., LTD. |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190125 Termination date: 20201204 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |