WO2018165950A1 - Procédé et dispositif de mise en œuvre d'emv - Google Patents

Procédé et dispositif de mise en œuvre d'emv Download PDF

Info

Publication number
WO2018165950A1
WO2018165950A1 PCT/CN2017/076973 CN2017076973W WO2018165950A1 WO 2018165950 A1 WO2018165950 A1 WO 2018165950A1 CN 2017076973 W CN2017076973 W CN 2017076973W WO 2018165950 A1 WO2018165950 A1 WO 2018165950A1
Authority
WO
WIPO (PCT)
Prior art keywords
label
tag
target
data
dynamic memory
Prior art date
Application number
PCT/CN2017/076973
Other languages
English (en)
Chinese (zh)
Inventor
宋孝亮
Original Assignee
深圳大趋智能科技有限公司
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 深圳大趋智能科技有限公司 filed Critical 深圳大趋智能科技有限公司
Priority to PCT/CN2017/076973 priority Critical patent/WO2018165950A1/fr
Priority to CN201780000963.3A priority patent/CN107454953B/zh
Publication of WO2018165950A1 publication Critical patent/WO2018165950A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0608—Saving storage space on storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629—Configuration or reconfiguration of storage systems
    • G06F3/0631—Configuration or reconfiguration of storage systems by allocating resources to storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory

Definitions

  • the present invention relates to the field of EMV implementation, and in particular, to an implementation method and apparatus for an EMV.
  • TLV structure is a transmission structure, a buf, through T (tag) index, through L
  • the EMV standard is a bank card developed by the three major international bank card organizations - Europa y (European Card, which has been acquired by MasterCard), MasterCard (MasterCard) and Visa (Visa), from the magnetic stripe card to the smart IC card.
  • the technical standard is based on the financial payment standard of IC cards and has become a recognized global standard.
  • MPOS is a new payment product, which is connected with general intelligent mobile devices such as mobile phones and tablet computers, and transmits information through the Internet.
  • the external device performs operations such as card reading, password input, data encryption and decryption, and prompt information display.
  • the application of the payment function With the popularity of the mobile Internet, the process of using MPOS will be more convenient, the amount of MPOS will be larger and larger, and the cost pressure of the corresponding manufacturers will be greater and greater.
  • MPOS has become a trend with domestically produced less secure security chip solutions. However, due to the security chip storage space and memory limitations, many vendors have simplified EMV, and many functions have not been realized. It is also difficult for peers to be compatible with the non-contact fast payment methods of various card organizations. For the problem of resource shortage, a new type of EMV implementation method is urgently needed.
  • Disadvantage 1 The related TLV fixed length and variable length data add up to more than 100, different cards and different terminals have different TLV data, regardless of the chip resources, the program starts at the beginning The maximum memory is allocated for all TLV data first, or the maximum memory is defined, resulting in insufficient memory in the small-chip security chip solution.
  • Disadvantage 2 The EMV specification states that there is a need for a card, and the terminal needs to send the specified data list to the card. In order to reduce the processing of the data in the IC card, the specified data list is not TLV encoded, only A number of V values.
  • the list of TL (tag and length) used for V is pre-defined in the IC card, called Data Object List (DOL), ie the card will be fixed in format if needed
  • the DOL is transmitted to the terminal, and the terminal organizes the corresponding data in order according to the DOL request and returns it to the card.
  • the basic format of DOL is as follows: label 1 data length label 2 data length... label n data length, if the code processing is performed in the structure of pre-allocated memory, it is very troublesome to implement, need to remember each one
  • the position of the label in the structure, and the maximum length, in each place where the label needs to be used, the position in the structure must be read first, and then the data is retrieved from the structure, which has the problem of troublesome code maintenance.
  • Disadvantage 3 Different cards have the same definition of the same label, such as 9F79, the MasterCard organization uses as the protected data field 5, and the Visa organization indicates the available balance.
  • 9F79 the MasterCard organization uses as the protected data field 5
  • the Visa organization indicates the available balance.
  • Special labels are specially handled in special places. This program is not easy to read, the code is not easy to maintain, and it is easy to make mistakes.
  • the main object of the present invention is to provide an implementation method and device for an EMV, which aims to solve the problem of high memory resource occupancy.
  • the present invention provides an implementation method of an EMV, including,
  • the specific value includes a label identifier, a label minimum length, a label maximum length, a data format, and a supported card organization.
  • the step of allocating a dynamic memory for a plurality of tags includes:
  • the searching for the target label corresponding to the second label data to be written according to the label index table includes the following steps:
  • the second label data is written into the dynamic memory corresponding to the target label
  • the second tag data is written into the dynamic memory corresponding to the target tag.
  • the method includes
  • the present invention provides an apparatus for implementing an EMV, including
  • an initialization unit configured to clear original first tag data in the tag, and read a specific value of each tag
  • a memory allocation unit configured to allocate a piece of dynamic memory for multiple tags, and save the specific value of the tag to the corresponding dynamic memory
  • a table building unit configured to establish a label index table according to the specific value corresponding to the label and the label;
  • a data writing unit configured to search for a second to be written according to the label index table The target tag corresponding to the tag data, and the second tag data is written into the target tag.
  • the specific value includes a label identifier, a minimum length of the label, a maximum length of the label, and a data grid. And supported card organization.
  • the memory allocation unit includes a memory allocation module, and the memory allocation module is configured to allocate a piece of dynamic memory to the plurality of tags according to the specific value information of the tag, and record the use position of the dynamic memory.
  • the data writing unit further includes:
  • a first determining module configured to determine whether a label identifier of the target label exists in the label index table
  • a second determining module configured to determine, if the label of the target label exists, whether the card organization supported by the target label is a card organization corresponding to the second label data
  • the third determining module is configured to determine, if the card organization corresponding to the second tag data is written, whether the data format of the target tag is correct;
  • a fourth determining module configured to determine, if the data format of the target tag is correct, whether the tag identifier of the target tag exists in the tag index
  • a new module is configured to: if there is no label label of the target label in the label index, find an idle index, and create a new label as the target label;
  • a fifth determining module configured to determine whether there is sufficient storage space in the target tag to write the second tag data
  • the writing module is configured to write the second tag data into the dynamic memory corresponding to the target tag if the tag identifier of the target tag exists in the tag index or if there is sufficient storage space in the target tag.
  • the data writing unit further includes a copy module, where the copy module is configured to copy a specific value of the target tag in the tag index table into a tag index, where the tag index points to the dynamic memory. utilized location.
  • the beneficial effects of the present invention are: It is simple and convenient to access the tag data according to the tag, and the specific value and tag data of the specific tag can be obtained through the tag index, which is simple to read and maintain; by setting a piece of dynamic memory for multiple tags The way, multiple different tags share a dynamic memory. Compared to setting a maximum memory for each tag, the required memory resources are greatly reduced, and all the security chips of 4 8K and above can be realized. Complete EMV. Brief description of the drawing
  • FIG. 1 is a schematic flowchart of a method for implementing an EMV according to an embodiment of the present invention
  • FIG. 2 is a schematic flowchart of a method for implementing an EMV according to another embodiment of the present invention.
  • FIG. 3 is a specific flow diagram of a step of writing a corresponding second tag data for a target tag according to an embodiment of the invention.
  • FIG. 4 is a structural block diagram of an apparatus for implementing an EMV according to an embodiment of the present invention.
  • FIG. 5 is a structural block diagram of a data writing unit according to an embodiment of the present invention.
  • FIG. 6 is a structural block diagram of a tag index, a tag, and a dynamic memory according to an embodiment of the present invention.
  • first, second and the like in the present invention are used for the purpose of description only, and are not to be construed as indicating or implying their relative importance or implicitly indicating the number of technical features indicated.
  • features defining “first” and “second” may include at least one of the features, either explicitly or implicitly.
  • the technical solutions between the various embodiments may be combined with each other, but must be based on the realization of those skilled in the art, and when the combination of the technical solutions is contradictory or impossible to implement, it should be considered that the combination of the technical solutions does not exist. It is also within the scope of protection required by the present invention.
  • the present invention provides an implementation method of an EMV, including the following steps:
  • Sl l allocate a piece of dynamic memory for multiple tags, and save the specific value of the tag to the dynamic memory.
  • S12. Create a label index table according to specific values corresponding to the label and the label.
  • step S10 the label index is initialized, and the original first label data in each label is cleared.
  • the current label stores the number of the first label data as 0, and the current memory is used. Is 0.
  • the specific value of each label is read.
  • the specific values include label label, minimum label length, maximum label length, data format, and supported card organization.
  • a plurality of tags are jointly applied for a dynamic memory for writing/storing tag data, that is, multiple tags use the same piece of dynamic memory, and the specific size of the dynamic memory is smaller than that of each tag. Allocate a maximum memory sum size. When used normally, the same dynamic memory tag will not be used, that is, all the tags will not be written to the tag data. There are free tags in the tags of dynamic memory. This part of the tags does not occupy the size of dynamic memory. All dynamic memory can be used only for some tags.
  • step S12 a label index table is created, and all the specific values of the label, that is, the minimum length of the label, the maximum length of the label, the data format, and the data of the card organization are known from the label index table, and the reading is simple, and Easy to maintain.
  • step S13 after the label is initialized and the dynamic memory is allocated to the label, the second label data is written to the label index, where the second label data may be the label data in the terminal or may be obtained from the IC card.
  • the tag data which enables the writing of tag data of a specific tag, is straightforward.
  • Program reads can access data values through tags, rather than by accessing the structure, and define the card organization supported by each tag.
  • the implementation method of the EMV uses a dynamic memory application method to save various tag data, which greatly reduces the required storage resources and memory resources.
  • a complete EMV can be realized;
  • the program accesses the corresponding tag data through the tag, instead of accessing the structure, which can solve the reading, maintenance and compatibility issues, and defines the card organization supported by each tag.
  • the present invention provides an implementation method of an EMV, including the following steps:
  • S20 Clear the original first tag data in the tag, and read the specific value of each tag.
  • S2 allocates a piece of dynamic memory to the plurality of tags according to the specific value information of the tag, records the use position of the dynamic memory, and saves the specific value of the tag to the corresponding dynamic memory.
  • step S20 the label index is initialized, and the original first label data in each label is cleared.
  • the current label stores the number of the first label data as 0, and the current memory used position is also 0.
  • the specific value of each tag is read.
  • the specific values include label label, label minimum length, label maximum length, data format and supported card organization.
  • step S21 a plurality of tags are jointly applied for a dynamic memory for writing/storing tag data, that is, multiple tags use the same dynamic memory, and the specific size of the dynamic memory is smaller than that of each tag.
  • the size of a maximum memory sum when used normally, use the same block of dynamic memory Labels, not all of them will be used, that is, all the labels will not be written to the label data. Therefore, there are free labels in the labels belonging to the same dynamic memory. This part of the labels does not occupy dynamic memory. Size, all dynamic memory can be used only for some tags.
  • step S22 a label index table is created, and all the specific values of the label, that is, the minimum length of the label, the maximum length of the label, the data format, and the data of the card organization, etc., are known from the label index table.
  • step S23 after the label is initialized and the dynamic memory is allocated to the label, the label data is written to the label index, where the second label data may be the second label data in the terminal or may be obtained from the IC card.
  • the second tag data enables the writing of tag data of a specific tag to be simple and straightforward.
  • the program reads the tag data to access the tag data in the dynamic memory, rather than by accessing the structure, and defines the card organization supported by each tag.
  • step S23 specifically includes the following steps:
  • S237 Determine whether there is enough storage space in the target tag to write the second tag data.
  • step S234 write the second tag data into the dynamic memory corresponding to the target tag.
  • step S235 when it is determined that there is no label label of the target tag, an idle index is searched, and a new tag is created as a new target tag, the tag data is written, and then the target is obtained from the tag index table. The specific value of the tag is written to the tag index.
  • An index in which idle is an index of an unsaved label.
  • the label 9F79, the label 9F15, and the label 9F30 share a piece of dynamic memory.
  • the label 9F15 is directly determined by the label index.
  • the corresponding tag data is read from the dynamic memory, the whole structure is simple to program, convenient to maintain, not easy to make mistakes, and the memory resources occupied by the same are greatly reduced.
  • the implementation method of the EMV uses a dynamic memory application method to save various tag data, which greatly reduces the required storage resources and memory resources.
  • a complete EMV can be realized;
  • the program accesses the corresponding tag data through the tag, instead of accessing the structure, which can solve the reading, maintenance and compatibility issues, and defines the card organization supported by each tag.
  • FIG. 4 and FIG. 5 another embodiment of the present invention provides an apparatus for implementing an EMV, including: [0100] an initializing unit 10, configured to clear original first label data in a label, and read Take the specific value of each label; [0101] The memory allocating unit 20 is configured to allocate a piece of dynamic memory for the plurality of tags, and save the specific value of the tag to the dynamic memory;
  • the table building unit 30 is configured to establish a label index table according to the label and the specific value corresponding to the label; [0103] the data writing unit 40 is configured to search for the to-be-written according to the label index table. The target tag corresponding to the second tag data, and the second tag data is written into the target tag.
  • the label index is initialized, and the original first label data in each label is cleared.
  • the current label stores the number of the first label data as 0, and the current memory is used. Is 0.
  • the minimum length of the label the maximum length of the label, the data format, and the supported card organization.
  • a plurality of tags are jointly applied for a piece of dynamic memory for writing/storing tag data, that is, multiple tags use the same piece of dynamic memory, and the specific size of the dynamic memory is smaller than that of each tag.
  • the size of a maximum memory sum is separately allocated.
  • the same dynamic memory label will not be used, that is, all the labels will not be written to the label data.
  • dynamic memory can be A, 1-4
  • A is less than B.
  • a label index table is established, and all the specific values of the label can be known from the label index table, that is, the minimum length of the label, the maximum length of the label, the data format, and the data of the card organization, etc., and the reading is simple. And easy to maintain.
  • the second label data is written to the label, wherein the second label data may be the second label data in the terminal. It is the second tag data obtained from the IC card, and the tag data of the specific tag is written, which is simple. Directly.
  • the program reads the tag data to access the tag data, rather than by accessing the structure, and defines the card organization supported by each tag.
  • the memory allocation unit 20 includes a memory allocation module that allocates a piece of dynamic memory for a plurality of tags according to the specific value information of the tag, and records the use position of the dynamic memory.
  • the data writing unit 40 further includes the following modules:
  • the first determining module 41 is configured to determine whether a label identifier of the target label exists in the label index table.
  • the second determining module 42 is configured to determine, if the label of the target label exists, whether the card organization supported by the target label is a card organization corresponding to the write label data.
  • the third determining module 43 is configured to determine whether the data format of the target tag is correct if the card organization corresponding to the second tag data is written.
  • the fourth determining module 44 is configured to determine, if the data format of the target tag is correct, whether the tag identifier of the target tag exists in the tag index.
  • a new module 45 is configured to find a free index if there is no label label of the target label in the label index.
  • the fifth determining module 46 is configured to determine whether there is enough storage space in the target tag to write the second tag data.
  • the writing module 48 is configured to write the second tag data into the dynamic memory corresponding to the target tag if there is sufficient storage space in the target tag or if the tag identifier of the target tag exists in the tag index.
  • the copy module 47 is configured to copy the specific value of the target tag in the tag index table to the tag index, where the tag index points to the location of the dynamic memory.
  • the first determining module 41, the second determining module 42, the third determining module 43, the fourth determining module 44, and the fifth determining module 46 are determined to enter the next determining module after the former is determined, Step by step to judge, if one of the modules is not satisfied, the judgment process ends, the corresponding second tag data is not written, and the latter judgment module is performed under the premise that the condition of the previous judgment module is satisfied.
  • An apparatus for implementing an EMV which uses a dynamic memory application method to save various tag data, greatly reduces required storage resources and memory resources, and now all security chips of 48K and above can be used.
  • a complete EMV is implemented; the program accesses the corresponding tag data through tags, rather than accessing the structure, which can solve reading, maintenance and compatibility issues, and defines the card organization supported by each tag.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Software Systems (AREA)
  • Storage Device Security (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un procédé et un dispositif de mise en œuvre d'EMV, le procédé consistant : à effacer des données d'étiquettes d'origine dans des étiquettes, et à lire des valeurs spécifiques de toutes les étiquettes ; à attribuer une mémoire dynamique à la pluralité d'étiquettes ; à établir, selon les étiquettes et les valeurs spécifiques qui leur correspondent, une table d'index d'étiquettes ; à rechercher, conformément à la table d'index d'étiquettes, une étiquette cible correspondant à des données d'étiquette à écrire, et à écrire les données d'étiquette dans l'étiquette cible pour utiliser la mémoire dynamique. L'accès et la maintenance sont simples, et les exigences d'espace mémoire sont faibles.
PCT/CN2017/076973 2017-03-16 2017-03-16 Procédé et dispositif de mise en œuvre d'emv WO2018165950A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2017/076973 WO2018165950A1 (fr) 2017-03-16 2017-03-16 Procédé et dispositif de mise en œuvre d'emv
CN201780000963.3A CN107454953B (zh) 2017-03-16 2017-03-16 Emv的实现方法及装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/076973 WO2018165950A1 (fr) 2017-03-16 2017-03-16 Procédé et dispositif de mise en œuvre d'emv

Publications (1)

Publication Number Publication Date
WO2018165950A1 true WO2018165950A1 (fr) 2018-09-20

Family

ID=60497761

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/076973 WO2018165950A1 (fr) 2017-03-16 2017-03-16 Procédé et dispositif de mise en œuvre d'emv

Country Status (2)

Country Link
CN (1) CN107454953B (fr)
WO (1) WO2018165950A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112084197B (zh) * 2020-09-16 2023-10-31 艾体威尔电子技术(北京)有限公司 一种emv协议库中数据的存储方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012065266A2 (fr) * 2010-11-19 2012-05-24 Shaun Iversen Procédé pour la création d'un enregistrement de données dynamique dans une application de l'environnement d'un système de paiement
CN102521551A (zh) * 2011-12-23 2012-06-27 大唐微电子技术有限公司 一种实现ic卡个人化发行装置及方法
CN102867377A (zh) * 2012-09-20 2013-01-09 中国农业银行股份有限公司 在pos端机上实现业务的方法、系统与pos端机

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7103575B1 (en) * 2000-08-31 2006-09-05 International Business Machines Corporation Enabling use of smart cards by consumer devices for internet commerce
CN1900982B (zh) * 2006-07-05 2012-10-31 飞天诚信科技股份有限公司 一种单张智能卡支持多个金融规范的方法
EP2239712A1 (fr) * 2009-04-09 2010-10-13 Gemalto SA Procédé pour personnaliser un dispositif électronique, procédé de traitement de données et dispositif associés
CN104281529B (zh) * 2013-07-12 2018-01-16 北京金辉东方科技有限公司 大容量rfid电子标签动态分区方法及电子标签和应用
CN104090730B (zh) * 2014-07-08 2017-02-22 飞天诚信科技股份有限公司 一种对存储设备进行数据读写的方法及装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012065266A2 (fr) * 2010-11-19 2012-05-24 Shaun Iversen Procédé pour la création d'un enregistrement de données dynamique dans une application de l'environnement d'un système de paiement
CN102521551A (zh) * 2011-12-23 2012-06-27 大唐微电子技术有限公司 一种实现ic卡个人化发行装置及方法
CN102867377A (zh) * 2012-09-20 2013-01-09 中国农业银行股份有限公司 在pos端机上实现业务的方法、系统与pos端机

Also Published As

Publication number Publication date
CN107454953B (zh) 2020-11-03
CN107454953A (zh) 2017-12-08

Similar Documents

Publication Publication Date Title
US7895405B2 (en) Semiconductor memory card, and program for controlling the same
WO2003065298A1 (fr) Systeme et procede de communication proche, dispositif et procede de gestion de donnees, support d'enregistrement et programme informatique
CN102609741B (zh) 一种移动设备及其内、外部存储卡间数据交换的方法
US10248598B2 (en) Intelligent storage device signal transmission method for backing up data on intelligent storage module based on system type of electronic device
TWI459202B (zh) 資料處理方法、記憶體控制器與記憶體儲存裝置
TW201033807A (en) Data processing system, controller, and method thereof for searching specific memory area
CN109669622A (zh) 一种文件管理方法、文件管理装置、电子设备及存储介质
WO2017132797A1 (fr) Procédé d'agencement de données, appareil de stockage, contrôleur de stockage et réseau de stockage
CN101620758B (zh) 一种支持Web服务的智能卡
CN107479834A (zh) 一种基于cos的文件存储方法及装置
EP1283506A2 (fr) Méthode de gestion de fichiers, carte à mémoire et terminal faisant usage de la dite méthode
CN106484719A (zh) 一种扩展手机存储的方法及终端
CN113064553B (zh) 数据存储方法、装置、设备及介质
CN110460686A (zh) 一种区块链地址注册方法和装置
CN114296646A (zh) 基于io业务的缓存方法、装置、服务器和存储介质
WO2018165950A1 (fr) Procédé et dispositif de mise en œuvre d'emv
CN107148612A (zh) 一种扩展用户分区的方法和装置
JP4486828B2 (ja) 半導体メモリカード、コンピュータ読取可能なプログラム
CN105303208A (zh) 一种ic卡管理方法及系统
US8756425B2 (en) Data security authentication system and related multi-function memory card and computer program product
JP2004252968A (ja) 半導体メモリカード、制御プログラム。
CN105574425B (zh) 访问存储数据的方法及装置
US8477334B2 (en) Contactless IC chip, portable terminal, information processing method, and program
CN103678427A (zh) 检索并使用设置在智能卡内的应用的方法及系统
TW200919180A (en) Non-volatile memory apparatus and the access method thereof

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17900790

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 22/01/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 17900790

Country of ref document: EP

Kind code of ref document: A1