TW588246B - ANS. 1 encoding/decoding system using table lookup method - Google Patents

Abstract

The present invention provides an ANS. 1 encoding/decoding system using table lookup method, which comprises the steps of: receiving a data; attaching specific index to the received data; determining whether the received data has explicit, implicit and optional data; if affirmative, adjusting the specific index in the range stored with the explicit, implicit and optional data; comparing whether the adjusted specific index conforms to a specific index of a target table, and if affirmative, determining that the data is completely decoded. The object of the present invention is to make the ANS. 1 encoding/decoding system easy to use, improve the requirement in the conventional skill to use a program-generator to match with the data structure format, and to simplify the conventional flowchart of processing formatted files. The conventional flowchart includes: (1) updating defined data, (2) executing the program-generator, (3) re-compiling, and (4) applying new functions. The new flowchart includes: (1) updating defined data, and (2) applying new functions, so as to encode/decode files without modifying programs.

Description

588246

FIELD OF THE INVENTION The present invention is an ASN · 1 encoding / decoding system that refers to a table lookup method. This table lookup method can directly refer to the data in the file slot, thereby encoding or decoding ASN · 1 data, and any ASN · i data structure. The update is only for the data in the document slot, no program changes are needed. BACKGROUND OF THE INVENTION In recent years, due to the popularity of computers and the vigorous development of the Internet, coupled with the promotion of WWW (World Wide Web) technology, the Internet has become the largest modern information dissemination network and marketing medium. , 1 ▼ The full rise of e-commerce has been launched. E-commerce is a method of using computer and network technology to automate business transactions. It can be said to be electronic data "," Electronic Date Interchange "and value-added network use extension Electronic data exchange refers to the exchange between different enterprises due to transactions—the exchange of materials, and the data of this exchange will trigger a series of processing operators in the information system of the other company or the business system. "You can also say that one computer's application system uses the agreed standards and data grids to send data to another computer's application system through electronic transmission, so that the computer can automatically" understand "," "Processing" and "Response", L to improve operational efficiency, increase productivity, reduce industry costs, improve profitability, and improve the competitiveness of enterprises. For a long time, many electronic data exchange network management ^ ^ ASN · 1 Abstract Syntax Notation 1) ^ ^ ^, described in order to describe, the purpose is to use a uniform syntax between different machines to work 588246 5. Description of the invention (2) Things are computer languages that describe the structure of data. ASN · 1 proposes a standard method to converge various types of data structures, so that there is a unified way of data representation. A set of data encoding that matches ASN · 1 is called the Basic Encoding Rule (BER). Its purpose is to encode the data structure described in ASN · 1 in a certain way for transmission on the network. ASN · 1 is a standard method for describing the format of information transmitted on the network. It has two parts. One part describes the data in the message, the data type and the sequence format. The other part describes how to compose each part into a message. ASN · 1 疋 A data encoding format widely used in cryptographic messaging, electronic identification, message exchange, etc. Due to the prevalence of the Internet, safety and security are all sought after, i'y added, ASN · The use of 1-coded data has therefore become increasingly widespread. However, in order to transfer data using the program, it is inconvenient to adjust the program for the ASN · 1 data mode. In this case, another struggle: hand, tool XML is on the rise. Wentong's encoding / decoding program without xml data structure adjustment is easy to make. However, in pursuit of formula 3 :: 2, other inconveniences also arise at the same time. Hunger and Vice. "The following disadvantages exist: (1) Too much information passed. The information of the data that needs to be transmitted is from Fang Qian, who also evaluates the talent of the film: = more than five times that of. ⑴Encryption protection ί t ° xml ^ ^ ^ # ^ tt i 花 = Γ requires careful planning to protect it. () The time spent in changing the data is for data conversion. The xml encoding is passed, and the computer is using and sending it = line. If you can let the editor edit 2 :: 2 :: 1, the choice of delivery application will increase the commercial or Internet transmission. 588246 5. Infinite convenience in the description of the invention (3). The traditional method must adjust the program for the ASN · 1 data format, and use pre-processors or program generators to meet the requirements of the data structure format. It is more troublesome and time-consuming. : (1) update definition data, (2) run program generator, (3) recompile, (4) apply new functions (Functions);

Please refer to Figure 1. This is a traditional method, and it is necessary to adjust the program for the ASN · i data format using a pre-processor (Program-Generator) or a Program-Generator to match the data format. The requirements are as follows: (1) update the definition data (2) execute the program generator (3) recompile (4) the program uses the new function (Functi〇I〇. ° In the traditional ASN · 1 data format adjustment program The input data is not a text file but a series of digital, linear octet data.

The series of digitized data described in the previous paragraph may still contain other digitized materials, so all the data form a tree structure (T π e St Two Cture). This series of digitized data contains other digitized resources. The deeper the depth of Xiao, in order to achieve the purpose of restoring the input data to the original form, we must expand the Tree structure into a series of digital data and then input. Each node (Node) of the tree structure is a series of digitized data. The data format adjustment program of ASN · 丨 uses preorder (reorder), middle order (In〇rder), or postorder. (P〇st〇rder) algorithm

Page 7 588246 V. Description of the invention (4)-The program expands the serial data in the node, and the last series of digital data forms the input data. The more nodes there are in the tree structure, the more code generated by the traditional "^ 1 encoding / decoding system, and the more complicated it is. In order to restore a long list of input data to the original form, For the purpose, the traditional ASN · 1 data format adjustment program must refer to many different target tables (Reference Table) to find the correspondence between a long list of input data and the target table, and then restore a long list of input data to The original form and the contents of the original form. Because the original form is not the same, the traditional method must make some corrections to the Asn 1 data format adjustment program, including the pre-processor (Pre-Prcess) and the program to generate n (Pr〇gram A Generator is not only complicated but also slow. From the above, since the program of ASN · 1 must be adjusted, it must be recompiled. This traditional method is then followed by the execution of a new function (Function). Therefore, in view of the lack of the look-up table method of the current ASN. 1 (Abstract Syntax Notation One) encoding / decoding system, the applicant has carefully tested and studied, and A spirit of perseverance eventually developed the "ASN. 1 encoding / decoding system using a table lookup method" in the present case. The first object of the present invention is to make the ASN. 1 encoding / decoding system easier to use. The present invention The second invention aims to improve the traditional program-generator method to meet the requirements of the data structure format.

588246

V. Description of the invention (5) The third invention of the present invention aims to simplify the traditional process of processing archives. In detail, the traditional process is as follows: (1) update the definition data, (2) execute the program generator, (3) recompile, (4) apply new functions' (Functions); the new process is as follows: (1) update Define data and apply new functions. The fourth object of the present invention is to process formatted files without changing the program. The fifth invention aims at eliminating the two steps of executing the program generator and recompiling. The update process of the present invention only needs to: (1) update definition data and (2) apply new functions. Eliminating the need to run the program generator and recompiling two steps, so that any update of the ASN · 1 data structure only needs to be documented, and no program changes are required. The table lookup method of the present invention includes a loader for ASN · 1 definition data, (1) establishing an ASN. 1 dedicated data directory to indicate various data tags including IMPLICIT / EXPLICIT , Set / s3et OF / SEQUENCE / SEQUENCE OF / INSTANCE OF / CHO I CE and other data structure categories, as well as optional / default / any and other characteristics of ASN j, and can (2) let ASN · 1 encoding / decoding program Read at any time, so that there is no need to change the ASN. 1 encoding / decoding program when (3) is modified. According to a specific concept of the present invention, the implementation of the watch list method of the ASN · 1 encoding / decoding system includes the steps of accepting a piece of data, adding a custom marker (fpeci fied Index) to the accepted piece of data, and determining the Whether the received data has explicit reference data (Explicit), if so, adjust the existence of this explicit data

588246 V. Description of the invention (6) The customized mark (Specified dex) within the scope of the explicit reference data (Explicit) is compared with whether the adjusted customized mark (S pecified I nde X) matches one of the tables of a target. The order tags match, and if they match, it is determined that the data has been completely decoded. According to the above-mentioned data transmission method, comparing the input data with a target form 'if the target form contains the' Exp 1 i c i tπ string, it is known that the input data contains explicit reference data (Explicit). According to the above-mentioned data transmission method, the explicit reference (^ Explicit) 's custom index (specif ied Index) and its data content must be merged into adjusted data. ) As mentioned above, the ASN · 1 encoding / decoding system that refers to the table lookup method, wherein the plus = custom mark is to create a data directory dedicated to ASN · 1 to indicate various data marks (taS), SET / SET OF / The data structure category of SEQUENCE OF / OSTANCE OF / CH0ICE, and the characteristics of ASN.1 of OPTIONAL / DEFAULT / ANY. The ASN · 1 encoding / decoding system using the table lookup method as described above, wherein the accepted data is digital linear data. The accepted information also includes OPTIONAL / DEFAULT / ANY. —The ASN · 1 encoding / decoding system that refers to the table lookup method described in $, wherein the custom mark is used to determine the format of the target list corresponding to the accepted data. According to the ASN · 1 encoding / decoding system using the table lookup method described above, the accepted data also includes implicit reference data (Implicit). The source text also includes optional information (e.g., ^^^).

Page 10 588246

According to the ASN j that refers to the table lookup method described above, if the content of the optional data (Optional) has not been used for the office / decoding system, the data is deleted. If you do not fill in the note, you will use another specific idea of the present invention, which refers to the ASN · 1 encoding / decoding system, and its steps include accepting a data ~ table method (Specified Index) in the accepted data, , Hungarian's comment whether there is implicit reference data (lmplicit), if there is a custom mark within the range of implicit reference (Implicit) of the accepted asset (s ^ adjusted to store the Index), Compare the adjusted custom mark with a custom mark, and if it matches, it is judged that the data has been & two = ASN. 1 of the form according to the reference table lookup method described above, where the ratio is For = input data and a target form, if the target form ㊁: has π I mp 11 c: tπ string, it is known that the input data contains an implicit reference (Implicit). ,, 'According to the above-mentioned reference to the table lookup method ", 1 encoding / decoding system, which compares the implicit reference data (Implicit) with the target form to know the data attributes and restore the adjusted data. ^ The ASN.1 encoding / decoding system that refers to the table lookup method described above, wherein the accepted data is a digital linear data. The accepted spoon is OPTIONAL / DEFAULT / ANY. ASN · i encoding / decoding system based on the table method, wherein the accepted data also includes optional data ("" ⑽ 丨). "As mentioned above, the ASN · 丨 encoding / decoding system that refers to the table lookup method, if one is selected If the content of sexual information (OptiOnal) is not filled in,

588246 V. Description of the invention (8)-material deletion. The ASN · 1 encoding / decoding system that refers to the table lookup method described above, wherein the custom index is used to determine the format of the corresponding target form of the accepted data. The ASN · 1 encoding / decoding system that refers to the table lookup method described above, wherein the annotation custom mark is to create a data directory dedicated to ASN · 1 to indicate that it contains various data tags (SET / SET OF / SEQUENCE OF / INSTANCE OF / CHOICE data structure category, and the characteristics of 〇pTI〇NAL / DEFAULT / ANY ASN · 1. According to another specific concept of the present invention, the steps include accepting a data, annotating from δ 丁 标 圮 (specified Inde X) to the accepted data, f = private form comparison, to determine whether the accepted data is There are optional 2 materials (optional). If there is no data corresponding to the optional data (〇pti〇nal) section, 'delete the corresponding optional data (〇pti〇nal)' from the target table. Consistent with the information accepted. The ASN · 1 encoding / decoding system using the table lookup method described above, wherein the accepted data also includes explicit reference data (explicit). Among them, the accepted information also includes implicit reference data (implicit). The ASN · 1 encoding / decoding system that refers to the table look-up method as described above, wherein the annotation custom mark is to create a ML 1-specific data directory to indicate the package a various shell material tags (SET / SET OF) / SEQUENCE OF / INSTANCE OF / CHOICE 5 OPTIONAL / DEFAULT / ANY of ASN · 1 features. According to the ASN · 1 encoding / decoding system referring to the table lookup method described above,

588246 V. Description of the invention (9) The accepted data is a digital linear data. The accepted materials include OPTIONAL / DEFAULT / ANY. In summary, the ASN. 1 encoding / decoding system that refers to the table lookup method, wherein the custom mark (Spe c i f i e d I n d e X) is used to determine the format of the form corresponding to the accepted data.

Page 13 588246

The formula and detailed description are further understood. The invention is illustrated by the following figures. = The diagram is an illustration of the traditional technical flow for adjusting the data format adjustment program. The second diagram is an illustration of the mechanism of the present invention, which refers to the table lookup method (Abstract Syntax No. 0ne) encoding / decoding system. The third diagram is an illustration. The present invention adjusts a general tree structure diagram to linear data as input data; the fourth diagram illustrates a step of adjusting data to show that the present invention adjusts the photographic data and hidden data to one of the original marks | and the fifth diagram This is an example of a step of adjusting data to show the adjustment of selective data of the present invention. Detailed description of the invention The mechanism of the present invention is shown in Figure 2. An update process is as follows (丨) Update definition data (4) The program uses a new function (Function), which simplifies the steps of the traditional method that must execute the program generator and recompile. The method of implementing the encoding / decoding system is the same as the input data definition in the traditional ASN · 1 data format adjustment program. The input data is not a text file but a series of digital, linear (Ser ial) Octet data. The digitized data described in the previous paragraph may contain other numbers

Page 14 588246

Schematic illustration of the shell material, so all the data formed a tree structure (Tree Structure), the more material in this series of digital data, the deeper the tree, in order to achieve; The binarized assets, ^ Q, ^ y O j are shipped to the purpose of restoring the rotation data to the original ^ =. We must expand the tree structure into a series of digitized data and then enter it. Tree structure (T r e e string of data

Structure) Each node (No) is ’ASN · 1 data format adjustment program using the preamble

), Inorder, or Postorder algorithm, one by one, expands the serial data in the node, and the last series of digital data forms the input data. 2. The main difference between the method of implementing the encoding / decoding system and the data format adjustment program of ASN · 1 is ASN .; [The data format adjustment program of [is a tree structure (Tree)-layer by layer node (Node) Expand each separately, and the method of implementing the encoding / decoding system is to expand the nodes (Node) of the tree structure (Tree) at a time 'the last series of digital data to form the input data.

According to the definition of ASN · 1, when an explicit reference is contained in the input data, the tag marked with the explicit reference forms a node. The present invention redefined this node Is a custom index (Specif ied Index), the pointer (Pointer) points to this custom index (Speci fi ed Index), and the actual data forms the child nodes of the above nodes, we must merge these two nodes into a node To get real data, and then point the indicator (P〇inter) to this adjustment

Page 15 588246 Schematic description of the node (Node), which is the custom index (speci fied Index). According to the definition of ASN · 1, when the input data contains implicit references, the tags that indicate the implicit references form a node. The present invention refers to this node (Node). Redefined as a custom index (Speci fied Index), the pointer (pointer) points to this custom index (Speci fied Index), but the attributes of the actual data have been lost 'we must refer to the target form of ASN · 1 (reference τ ab 1 e) In order to find the data attributes to obtain the real data, and then point the pointer (Pointer) to the node (Node) containing the real data, that is, the Customized Index (Specified Index). According to the definition of ASN · 1, when the input data contains optional information (optional), the tag (Tag) and content (c ο ntent) indicating the optional data (optinal) form a node (N ode). In the present invention, the node is redefined as a custom index (Specif ied Index). We must check whether the content of the data is empty (Nu 1 1) according to the reference table of ASN · 1. If it is empty, delete this data (ie node (Node)). As shown in Fig. 2 (a), the head end (ie the root node R 〇 t) contains three child nodes A, B and C. A node (Node) contains a child node Al, c node (Node) contains four child nodes Cl, C2, C3, C4, this tree structure (Tree Structure) is unique, we-visit the nodes of the tree structure And convert it into a linear data, as shown in Figure 3 (b), the output order is A \ A1, B2, C, Cl, C2, C3, C4, of which 1, 11, 2, 2, 3, 31, 32, 33 '34 indicates that the data is in a tree structure; the s level starts with

588246 Schematic description ------- and location. As shown in Figure 4 (a), the head end (ie, the root node Root) contains three child nodes A, B, and C. A node (Node) represents a remote reference mark (Explicit), C node (Node) represents a near reference mark (Implicit), and A node (Node) contains a child node ^, the present invention refers to this A node ( Node) is redefined as a custom index (Specif ied Index), the index (point) points to this custom index (Specified I / iidex) ', and the actual data forms the child nodes of the above nodes, we must change this The two nodes are combined into one node A3 to obtain real data, and then the pointer is pointed at this adjusted node 4300 (10). The present invention redefines C node (Node) as another custom marker ( Specif ied Index). The index points to this custom index, but the attributes of the actual data have been lost. We must refer to the ASN · 1 target table (Reference Tab 1 e) to find the data attributes. To get the real data, then point the index (point) to this node (Node) c that contains the real data. This tree structure is unique, we adjust the nodes of this tree structure, Will Converted to source code mark. Figure 4 (b) is the adjusted tree structure. As shown in Figure 5 (a), the head end (ie root node Root) contains three child nodes A, B, C and D. Among them, the D node (Node) represents an optional data (optional). When the input data contains optional data (〇pti〇nai) D, the tag and content of the optional data (〇pt i〇nal) ) Formed a node (Node) D, the present invention redefined this node (Node) as a custom index (Specified Index), our 588246 diagram simply illustrates that we must refer to the target form of ASN · 1 ( Reference Table) Check whether the content of data D is empty (Nul 1). If the content of data D is empty, delete this data (ie Node). As shown in Figure 5 (b) after adjusting the table (ie, deleting D) Tree Structure. According to the above drawings and the detailed description of the invention, the present invention may be modified by anyone who is familiar with this ^ Γ, but it is not as good as the attached scope of application protector.

Page 18

Claims (1)

588246 • The ASN · 1 encoding / decoding system that refers to the table lookup method, the steps include: (a) accessing the double-one data; (b) adding a custom tag (Specif ied Index) to the accepted data; (c) identifying the Whether the accepted data has explicit reference data, (Explicit); (d) > If 'adjust the existence of a custom marker (Specif ied Index) within the scope of the explicit reference data (Explicit); (e) jt Whether the adjusted customized mark (Speci f 丨 to 丨) matches one of the customized marks of a target list; (f) If it matches, it is judged that the data is completely decoded. 2. The ASN.1 encoding / decoding system which refers to the table lookup method as described in item 1 of the scope of the patent application, where step (c) is compared with the input data and a target form, if the target form contains " "Explicit" string to know that the input data contains Explicit. 3. The ASN. 1 encoding / decoding system that refers to a table lookup method as described in item 1 of the scope of the patent application, wherein in step (d), the explicit index (Specified Index) of the explicit reference (Explicit) ) And its information must be merged into adjusted information. 4. The ASN. 1 encoding / decoding system that refers to the meter look-up method as described in item 1 of the scope of the patent application, wherein the annotation custom mark is to create an ASN. I dedicated data directory to indicate various data marks ( tag), the data structure category of SE1V SET OF / SEQUENCE OF / INSTANCE OF / CHOICE, and the characteristics of ASN · 1 of OPTIONAL / DEFAULT / ANY. 588246 6. Scope of patent application '' A " 5. ASN.i encoding / decoding system that refers to the table look-up method as described in item 1 of the scope of the patent application / application, where the accepted data is digital linear data. 6 · If you apply for / claim the scope of patents! One of the items mentioned above refers to the ASN.i encoding / decoding system of the table lookup method, where the accepted data also includes OPTIONAL / DEFAULT / ANY. 7. The ASN. 1 encoding / decoding system that refers to a table lookup method as described in item 1 of the scope of the patent application, wherein the custom mark is used to determine the format of the form corresponding to the accepted data. 8. The ASN. 1 encoding / decoding system that refers to the meter look-up method as described in item 1 of the scope of patent application, wherein the accepted data also includes implicit reference data (Implicit). One of the references refers to the ASN. 1 encoding / decoding system of a table lookup method, wherein the accepted data also includes optional data (Optional). 10 · ASN. 1 encoding / decoding system that refers to the meter look-up method as described in item 9 of the scope of the patent application, if the content of the optional data (0pti〇nal) is not filled in, the data is deleted . Π · An ASN · 1 encoding / decoding system that refers to a table lookup method, the steps include: (a) accepting a data; (b) adding a custom marker (Speci fied Index) to the accepted data; (c) judging Whether the accepted data contains implicit reference data (Implicit); (d) if there is a 'adjusted existence of the implicit reference data (I _ 1 丨 c 丨 VII) within the custom marker (Specif ied Index); Page 20 588246 6. Scope of patent application (e) Compare whether the adjusted custom mark matches one of the forms of a target; (f) If it matches, it is judged that the information has been completely solved. 12. The ASN. 1 encoding / decoding system using a table lookup method as described in item 8 of the scope of patent application, wherein step (c) compares the input data with a target form, if the target form contains The "Imlicit" string indicates that the input data contains Implicit. 13. The ASN. 1 encoding / decoding system that refers to a table lookup method as described in item 8 of Shen Qing's patent scope, where the implicit reference data (Implicit) is compared with an underlying form to know its data attributes and restore it to Adjusted information. 14. The ASN. 1 encoding / decoding system using a table lookup method as described in item 8 of the scope of patent application, wherein the accepted data is a digital linear data. 15. The ASN. 1 encoding / decoding system that refers to the meter look-up method as described in item 8 of the scope of the patent application, wherein the accepted data also includes OPTIONAL / DEFAULT / ANY. 16. The ASN. 1 encoding / decoding system that refers to the meter look-up method as described in item 8 of the scope of patent application, where the accepted data also includes optional information (Optional) 〇17. One of the references mentioned above refers to the ASN · 1 encoding / decoding system of the table lookup method. If the content of the optional data (Optional) is not filled in, the data is deleted. 18. The ASN · 1 encoding / decoding system that refers to a table lookup method as described in item 11 of the scope of patent application, wherein the custom mark (S pecified Inde X) is used to identify one of the forms corresponding to the accepted data. formula. 588246 6. Scope of patent application 19. The asn] encoding / decoding system that refers to the table lookup method described in item η of the scope of patent application, wherein the self-marking annotation is to establish an ASN · i dedicated data directory to indicate Includes various data tags, SET / SET 叩 / SEQUENCE OF / INSTANCE OF / CHOICE data structure categories, and ASN · 1 features of OPTIONAL / DEFAULT / ANY. . '20 · —ASN · 1 encoding / decoding system that refers to the table lookup method, the steps include: (a) accepting a data; each (b) adding a custom mark (Speci fied Index) to the accepted data · (c ) Compare with the target form to determine whether the accepted data contains optional data (optional); '(d) If there is no data corresponding to the optional data (opt inai) part, delete the corresponding data from the target form. The optional data (optionai) part should be selected; w (e): The subject form is consistent with the accepted data. 21 · Asn i encoding / decoding system that refers to a table lookup method as described in one of the 20th scope of the patent application, where the accepted data also includes explicit reference data · (explicit) ° 22 · As the second scope of the patent application An ASN1 encoding / decoding system that refers to a table look-up method as described in one of the above items, wherein the accepted data also includes implicit reference data (implicit). 23. The ASN; 1 encoding / decoding system that refers to a table lookup method as described in item 20 of the scope of the patent application, wherein the annotation custom mark is an ASN · i dedicated material catalog to indicate that it contains various data marks (Tag), SET / SET OF / SEQUENCE OF / INSTANCE OF / CHOICE data structure category, and OPTIONAL / DEFAULT / ANY special feature of ASN · 1. . Page 22 588246 6. Scope of patent application 2 4. The ASN. 1 encoding / decoding system that refers to the table lookup method described in item 20 of the scope of patent application, wherein the accepted data is a digital linear data. 25. The ASN. 1 encoding / decoding system that refers to a table lookup method as described in item 20 of the scope of the patent application, wherein the accepted materials include OPTIONAL / DEFAULT / ANY. 26. The ASN. 1 encoding / decoding system that refers to a table lookup method as described in item 20 of the scope of the patent application, wherein the custom mark (S pecified Inde X) is used to determine the format of the form corresponding to the accepted data . Page 23