TW201643816A - Contour encryption and decryption - Google Patents

Abstract

A method of encrypting information includes converting an information sequence represented as a strings of bits into a curvilinear coding system, where each element of the curvilinear coding system corresponds to a sub-sequence of successive same-valued bits, converting said curvilinear coding system into a at least one closed curve, and embedding said at least one closed curve in a 2-dimensional pattern. A method for decrypting information includes extracting at least one closed curve from a digitized 2-dimensional pattern, and converting the at least one closed curve into an information sequence represented as a string of bits.

Description

Contour encryption and decryption technology

The present invention relates to a method of encoding and decoding information in a two-dimensional curve embedded in, for example, a camouflage pattern.

One method of identifying a product is to attach an identification mark to the item, such as a trademark, barcode, or QR code that identifies the source of the item. However, these identification marks can be detached from the product, and the counterfeit goods can be added with an identification code, which can falsely mark the counterfeit goods as a specific manufacturer or source, and can be identified through the specific identification code without abnormality.

Example embodiments of the inventive concepts described herein basically comprise systems and methods for encoding and decoding information in a two-dimensional curve. Any form of information that can be encoded into a string of bits to be digitized can also be encoded in a two-dimensional curve. Through the embodiments of the inventive concept, two examples of non-limiting codes that can be encoded into a two-dimensional curve and have commercial importance are one-dimensional product barcodes and two-dimensional barcodes. The digitized two-dimensional curve can be embedded in the two-dimensional pattern to hide the existence of the two-dimensional curve, and the two-dimensional pattern can be printed on the commodity, or become part of the article in the commodity such as clothing, DVD or integrated circuit, or can be a product All or part of the logo.

According to an embodiment of the inventive concept, a method for encrypting information includes converting a sequence of information represented as a one-bit string into a curve coding system to provide at least one closed curve; and embedding the at least one closed curve In the two-dimensional pattern.

According to another embodiment of the inventive concept, the method includes converting each substring of consecutive equi-valued bits in the bit string into an arc, wherein the radius of each arc corresponds to the number of bits in each subsequence And an arc corresponding to the sequence of high value bits has a contour signature opposite to an arc corresponding to the sequence of low value bits; and by connecting the end point of the arc sequence to the arc sequence The starting point, which converts the sequence of arcs into a closed curve.

According to another embodiment of the inventive concept, the method includes converting the bit string into a plurality of closed curves, and embedding each of the closed curves into the two-dimensional pattern.

According to another embodiment of the inventive concept, one of the closed curves embedded in the two-dimensional pattern is a reference curve, and the reference curve includes coding information of the remaining closed curves, and the coding information One or both of the start/end points in each closed curve and a traversal order of the closed curves are included.

According to another embodiment of the inventive concept, the two-dimensional pattern has a camouflage pattern of a plurality of color shades. According to another embodiment of the inventive concept, the at least one closed curve is a simple closed curve. According to another embodiment of the inventive concept, the bit string is represented as a QR Code.

According to another embodiment of the inventive concept, the method includes receiving a reference point, generating an arc from a substring of the same value bit in the bit string; wherein the length of the substring of the same value bit Corresponding to a distance from a selected point to the reference point on the arc, and a bit value in the substring of the same value bit corresponds to a contour feature of the closed curve with respect to the reference point at the selected point The selection point from the reference point to a predetermined direction stores an angle of a vector; and the step of repeatedly generating an arc and saving an angle until the bit string is completely converted into a series of arcs. According to another embodiment of the inventive concept, the method includes generating a connecting arc between adjacent pairs of unconnected arcs when one or more of the arcs are not connected to generate at least one closed curve.

According to another embodiment of the inventive concept, the method includes receiving a closed boundary curve and a reference point; and within the closed boundary curve, from the bit string A substring of the same value bit generates an arc, wherein the length of the substring of the same value bit corresponds to an offset of the arc relative to the closed curve, and the sub-bit of the same value bit The bit value of the string corresponds to a contour feature of the arc; from a selected point on the arc to the reference point, the length of a vector and an angular offset of the vector relative to a predetermined direction are saved; and the generation is repeated An arc and a step of saving a length and an offset angle until the bit string is all converted into a series of arcs.

According to another embodiment of the inventive concept, the method includes generating a connection between adjacent pairs of unconnected arcs when one or more of the arcs of the same offset from the closed boundary curve are not connected An arc produces a plurality of nested curves in the closed boundary curve representing a contour map.

According to another embodiment of the inventive concept, the method includes generating the closed curves, wherein one of the closed curves is a reference curve, and each of the other closed curves is passed through an affine transformation The reference curve is derived, wherein each of the affine transformations is a combination of at least two transformations selected from the group consisting of translation, reflection, rotation, scaling transformation, homothetic transformation, and shear mapping, wherein Converting the bit string into the closed curve includes converting a substring of each equi-valued bit into one of the closed curves, wherein the number of the same-valued bits corresponds to the at least two One of the transforms, and the bit values of the equi-valued bits correspond to other transforms in the at least two transforms.

According to another embodiment of the inventive concept, the method includes converting each substring of the same value bit into a sub-region inside the at least one closed curve, each sub-region being bounded by a pair of parallel line segments, wherein The parallel line segment has a predetermined separation extending through at least one of the closed curve interior and the pair of curved line segments, wherein an area of each of the sub-regions corresponds to a length of a corresponding sub-string of the same-valued bit, and the same-valued bit a bit value corresponding to a contour feature of the at least one pair of curved line segments delimiting the sub-region; and a continuous sub-region along a plurality of adjacent pairs of parallel line segments, wherein the pair of curved line segments form at least one closed curve .

According to another embodiment of the inventive concept, a non-temporary computer readable program storage device is provided, tangibly including instructions processed by the computer The program executes the method steps for decrypting the information. The method includes extracting at least one closed curve from a digitized two-dimensional pattern; and converting the at least one closed curve into a sequence of information represented as a one-bit string.

According to another embodiment of the inventive concept, the method includes splitting the at least one closed curve into a sequence of arcs, and determining a contour feature and a radius of each arc; and converting the arc of the sequence into the bit A string, wherein each subsequence of consecutive equivalence bits corresponds to an arc, wherein the length of each subsequence corresponds to the radius of each arc, and the bit value of each subsequence corresponds to a contour feature of each arc. According to another embodiment of the inventive concept, the two-dimensional pattern is a camouflage pattern having a plurality of gray scales.

According to another embodiment of the inventive concept, the method includes extracting the closed curves from the two-dimensional pattern, and concatenating the bit sequences derived from each of the closed curves into the information sequence a single bit string.

According to another embodiment of the inventive concept, one of the closed curves extracted from the two-dimensional pattern is a reference curve, and the reference curve includes remaining decoding information of the closed curve, and the decoding information includes each One or both of the start/end points in the closed curve and a traversal order of the closed curves. According to another embodiment of the inventive concept, the at least one closed curve is a simple closed curve. According to another embodiment of the inventive concept, the bit string is represented as a QR Code.

According to another embodiment of the inventive concept, the method includes extending a vector from a reference point to a selection point on the closed curve; wherein a length of the vector from the reference point to the selection point corresponds to the bit The number of equi-valued bits of the substring of the metastring, and the bit value in the substring of the equivalence bit is determined by a contour feature of the closed curve at the selected point.

According to another embodiment of the inventive concept, the method includes receiving a reference point and a starting angle relative to a preset direction, and extending a vector from the starting point to a selection point on the closed curve Offseting the vector by a predetermined angular offset to extend another vector from the reference point to another point on the closed curve; and repeatedly shifting the vector by a predetermined angular offset to Reference The step of extending another vector to another point on the closed curve until the closed curve has been traversed, wherein the length of the vector corresponds to the number of identical bits in a substring and is in the same value bit The bit value in the substring is determined by a contour feature of the closed curve at the point, wherein the at least one closed curve is converted into a sequence of information represented as a one-bit string.

According to another embodiment of the inventive concept, the at least one closed curve includes a plurality of nested closed curves represented by a contour map, wherein converting the at least one closed curve into a one-dimensional string comprises receiving a reference point and a relative a starting angle of a predetermined direction; and extending a vector from the reference point to a point of one of the nested closed curves by a predetermined distance of the starting angle, and by continuously offsetting a predetermined angle offset, the nested closed curve being converted into the bit string, wherein an offset of one of the nested closed curves from the outer contour of the nested closed curve Corresponding to the number of equi-valued bits of the sub-string in the bit string, and the bit value in the sub-string of the same-valued bit is one of the nested closed curves A contour feature of the point is determined.

According to another embodiment of the inventive concept, the closed curves are extracted from the digitized two-dimensional pattern, wherein one of the closed curves is a reference curve, and each of the other closed curves passes through An affine transform is derived from the reference curve, wherein each of the affine transforms is a combination of two or more transforms selected from the group consisting of: translation, reflection, rotation, scale transformation, bit transformation, and shear mapping; Converting the closed curves into a one-bit string comprises converting the each closed curve into a substring of the same value bit, wherein the number of the same value bits corresponds to the two or more transformations One, and the bit values of the equi-valued bits correspond to other transforms of two or more transforms.

According to another embodiment of the inventive concept, the method includes dividing an interior of the at least one closed curve into a plurality of sub-regions, each sub-region being bounded by a pair of parallel line segments, wherein the pair of parallel line segments have an extension to the less a predetermined separation of the interior of the closed curve and a pair of curved line segments on either side of the curve; and converting the closed curve into a sequence of information represented as a one-bit string, wherein the area of each sub-region corresponds to the bit The number of bits of the same value bit of the substring of the string, and The bit value of the equi-valued bit corresponds to a contour feature of the at least one pair of curved line segments delimiting the sub-region.

According to another embodiment of the inventive concept, there is provided a method of encrypting information, comprising: converting each substring of consecutive equi-valued bits in a one-bit string into an arc, representing one of the bit strings The information sequence is converted into a curve coding system, wherein the length of each substring of the same value bit corresponds to a distance from a selection point to a reference point on the arc, and one bit of the substring in the same value bit The element value corresponds to a contour feature of the arc at the selected point relative to the reference point; the arc lines are connected into a closed curve; and the closed curve is embedded in a two-dimensional pattern.

11‧‧‧Area

31‧‧‧ graphics

32‧‧‧ graphics

33‧‧‧ graphics

70‧‧‧Closed curve

71‧‧‧ reference point

72‧‧‧ reference point

73‧‧‧ Vector

74‧‧‧ Vector

80‧‧‧Closed curve

81‧‧‧ contour map

82‧‧‧ reference point

83‧‧‧start vector

84‧‧ points

100‧‧‧ Curve

101‧‧‧Sub-area

110‧‧‧ Curve

111‧‧‧ reference point

112‧‧‧ Vector

113‧‧‧ Vector

114‧‧‧Vector

115‧‧‧ Vector

116‧‧‧ Vector

117‧‧‧ vector

118‧‧‧Vector

121‧‧‧Steps

122‧‧‧Steps

123‧‧‧Steps

131‧‧‧Steps

132‧‧‧Steps

133‧‧‧Steps

141‧‧‧ computer system

142‧‧‧Central processor

143‧‧‧ memory

144‧‧‧Input/Output (I/O) interface

145‧‧‧ display

146‧‧‧ input device

147‧‧‧Common programs

148‧‧‧ signal element

1 is a diagram showing an example of a camouflage pattern jacket having a two-dimensional barcode embedded in a verification according to an embodiment of the inventive concept; and FIG. 2 is an enlarged view showing a camouflage pattern taken from FIG. 1 according to an embodiment of the inventive concept. Part 3; FIG. 3 shows a plurality of white shapes embedded in a binary camouflage pattern in a black background, as shown in FIG. 3; FIG. 4(a) to FIG. 4 (in FIG. 4) c) showing an arc for three examples of the shapes shown in FIG. 3, respectively, according to an embodiment of the inventive concept; FIGS. 5(a) to 5(c) are diagrams showing the concept according to the present invention. Embodiments, a bit string derived from a simple closed curve comprising a plurality of arcs of different contour features and radii; FIG. 6 shows a bit string formed from the bit string shown in FIG. 5 according to an embodiment of the inventive concept A QR code; a seventh diagram is a closed curve describing two reference points having vectors respectively projected from two reference points, in accordance with an embodiment of the inventive concept; FIG. 8(a) is a diagram according to the inventive concept Embodiment, describing the outer boundary of the contour map Closed curve 80; FIG. 8 (b) based concepts according to an embodiment of the present invention, is described comprising a contour map of a plurality of nested curves offset by FIG. 8 (a) to form a closed curve to And a reference point from which the vector is projected onto a point on the contour map; FIGS. 9(a) through 9(c) depict three closed curves, ninth, in accordance with an embodiment of the inventive concept The curve of FIG. (a) is a reference curve, and the curves of FIGS. 9(b) to (c) are generated from the reference curve by affine transformation; FIG. 10 is another curve according to an embodiment of the inventive concept. Internally divided into a plurality of sub-regions, wherein each sub-region corresponds to a sub-sequence of the same-valued bit; FIGS. 11(a) to 11(c) illustrate a closed curve according to an embodiment of the inventive concept An example of conversion to a bit string; FIG. 12 is a flowchart of a method of encrypting information in a sequence of outlines according to an embodiment of the inventive concept; FIG. 13 is an embodiment of the present invention, encrypted according to an embodiment of the inventive concept A flowchart of a method for decrypting information in a sequence of profiles; and a block diagram of an exemplary computer system for implementing encoding and decoding of information in a two-dimensional curve, in accordance with an embodiment of the inventive concept.

Example embodiments of the inventive concepts described herein basically comprise a method of encoding and decoding information in a two-dimensional curve. The present invention may be embodied in various modifications and alternative forms. It should be understood that the above-described embodiments are not intended to limit the scope of the embodiments of the present invention. And change.

One way to ensure that the item is properly verified to avoid false verification of counterfeit goods is to embed the identification mark in the item so that the identification mark is substantially hidden in the item under normal viewing, but can be visualized by imaging techniques. For example, Figure 1 shows an example of a camouflage pattern jacket with an embedded verification two-dimensional barcode. Figure 2 shows an enlarged view of the camouflage pattern of the area 11 of Figure 1, a camouflage pattern having a plurality of similar colors, the colors being transparent to a plurality of colors Show. A one-bit pattern can be hidden in such a pattern, for example, changing the bit value of the lowest order two bits. This type of encoding method makes the bit pattern substantially indistinguishable from the camouflage pattern. With a specific color key software, the camouflage pattern can be binarized into black and white images and displayed in Figure 3. Figure 3 shows a plurality of white graphics embedded in a black background. Note that selecting a black background is merely an example and not a limitation, and a particular color key software produces a black background with a white background. The boundary between the graphic and the background can be represented by a two-dimensional simple closed curve, each boundary having a well-defined interior, ie the interior of the graphic, and a well-defined external, ie background. Once the start/end point of each curve is defined, the curve can be disassembled into a continuous sequence of arcs. The contour of the arc is positive or negative through the arc to the inner concave of the simple closed curve, or to the external convexity. . As shown in Figures 4(a) through 4(c), given a set of two-dimensional simple closed curves, in the existing mathematical computing environment, for example, the built-in functions provided by MathWorks' MATLAB can be derived from a curve. Extract an arc and judge the radius and center of the arc. Figures 4(a) through 4(c) show three example arcs extracted from graphs 31, 32 and 33 of Fig. 3, respectively. Thus, as shown in Figures 5(a) through 5(c), a simple closure of a plurality of arcs of different contour features and radii, by combining contour features with bit values, and radius and bit lengths The curve can be converted into a string of bits. The bit string may represent all or part of a product code, such as a code, or a two-dimensional bar code as shown in FIG.

In another embodiment of the inventive concept, a plurality of arcs may be combined to form a plurality of two-dimensional curves, and an array of the curves may be embedded in the camouflage pattern. In addition, in another embodiment of the inventive concept, one of the arrays of curves may be a reference curve, and the reference curve includes coding information of the remaining curves. The encoded information may include one or both of the start and end points of the curve, a traversal sequence of the array of curves, and a type of information encoded by the curve, such as whether the curve is represented as a two-dimensional bar code. If the array of curves is represented by a two-dimensional bar code, the reference curve may further include information on the size of the two-dimensional bar code, and how the two-dimensional bar code is split into individual closed curves. The information at the start and end points of each curve may include, for example, a centroid point inside each curve, and an offset angle that intersects the curve as a start/end point through the centroid. According to an embodiment of the inventive concept, the reference curve may be in a curved array The upper left of the column, however, the position of the reference curve is merely exemplary and not limiting, and the reference curve can be located anywhere in the array of curves.

7 through 10 illustrate other methods of encoding information in a contour, in accordance with other embodiments of the inventive concept.

Figure 7 depicts a closed curve 70 with vectors 73, 74 projected from two reference points 71, 72, respectively. The reference point 72 may be a centroid of the enclosed curve, but is not limited thereto. In other cases, the length of the vector from the reference point to a point on the curve corresponds to the length of the same-valued bit, and the contour feature of the curve corresponds to the bit value, which is whether the point of the curve on the curve is concave/ Convex situation. A subsequence of the next equivalence bit is found by advancing a vector of a pre-specified angular offset from the reference point.

Figure 8(a) depicts a closed curve 80 representing the outer boundary of the contour map, while Figure 8(b) depicts a plurality of nests formed by offsetting the closed curve of Figure 8(a). The contour map 81 of the curve, and the vector 83 are projected to the reference point 82 of the point 84 on the contour map 81. The new curve can be defined from the inward fixed increment of the outer boundary until a curve crosses itself, and the inner curve can define its height above the outer boundary. By extending the starting vector 83 from the reference point 82 by a predetermined distance, a starting point corresponding to the beginning of a sequence of information can be found, which can be found in a database, the number of bits of the same value bit. Corresponds to the contour height at the starting point, and the bit value is given by the curve being concave/convex at that point. The predetermined angle increment is also obtained by offsetting the start vector 83 by a predetermined angular increment and by extending the vector by a predetermined distance to a point of one of the nested curves. Found in the database.

Figures 9(a) to 9(c) depict three closed curves, wherein the curve of Fig. 9(a) can be regarded as a reference curve, and the others are as shown in Fig. 9(b) to Fig. 9(c). The illustrated curve can be generated by a reference line through an affine transformation, wherein each successive curve is combined with a series of substrings of the same value bit, which can be translation, reflection, rotation, scaling, A combination of two or more of a bit-like transform, a cut map. For example, the distance of translation, the degree of scaling, the magnitude of the tilt due to clipping, etc. may correspond to the number of bits of the same value bit in the information sequence, while reflecting or The angular offset of the rotation corresponds to the bit value. For example, in an embodiment, the non-restricted bit value encoding may represent the first n-degree angular offset as 1, and the second n-degree angle as 0, the third n-degree. The angle is expressed as 1 or the like. It should be noted that translation, scaling or cropping can also be used in the aforementioned method for formulating the rotational offset into a bit value, from which the coding scheme can be judged.

Figure 10 depicts another curve 100 in which the inner portion is divided into sub-regions 101, where each sub-region corresponds to a sub-sequence of a same-valued bit, and it should be noted that for clarity, only some sub-regions are indicated in the figure. 101. The area of each sub-area may correspond to the number of identical-valued bits, and the value of the bit may be determined by the concave/convex at both ends of the boundary curve. For example, a concave upper curve can be 0, any other combination can be 1, allowing for other combinations of definitions.

In other embodiments of the inventive concept, an item may have a mark such as a star, the mark containing a key database of keys containing all information for reading the outline code, such as defining a vertical line, a position of a reference point And the angular offset of the point on the other curve.

11(a) to 11(c) illustrate an example of converting a closed curve into a bit string, according to an embodiment of the inventive concept. Fig. 11(a) depicts a curve 110 embedded in a camouflage pattern, and Fig. 11(b) depicts a curve 110 extracted from a camouflage pattern. Figure 11 (b) further depicts reference point 111 and a plurality of vectors 112, 113, 114, 115, 116, 117 and 118 extending from reference point to curve 110. The position of the reference point 111 and the angular offset of each of the vectors 112 to 118 can be read from the above-described confidential database. In one example, the unrestricted angular offsets of the vectors 112, 113, 114, 115, 116, 117, and 118 may be 0°, 40°, 53°, 54°, 48°, 44°, and 62°, respectively. It should be noted that in this example, the angular offset is the angle between successive vectors. By reading the contour features of the arc intersecting the curve, it is possible to determine the bit value of the bit substring connected to each vector. In this example, the bit value 0 or black is concatenated with an outwardly convex arc, and the bit value 1 or white is connected to an inwardly recessed arc, and the number of homomorphic bits corresponds to the length of the correlation vector. In one set of examples, the unrestricted bit lengths of vectors 112, 113, 114, 115, 116, 117, and 118 can be 7 black, 2 white, 1 black, 1 white, 2 black, 1 white, and 7 black, respectively. Need to pay attention to, the display The display length of the vectors 112 to 118 in Fig. 11(b) does not necessarily correspond to the number of connected bits. Figure 11 (c) depicts a bit string derived from curve 110, wherein the reference number of each substring of the same value bit corresponds to the vector associated with Fig. 11(b).

Figure 12 is a flow diagram of a method of converting a sequence of information represented as a bit string into a curve coding system to provide at least one closed curve, in accordance with an embodiment of the inventive concept. A sequence of information may represent a string of bits, each of which contains a low value and a high value, generally represented by 0 and 1, respectively, and the bit string may be, for example, a representation of all or part of a product barcode or a two-dimensional barcode. The bit string contains consecutive 0-bit and 1-bit subsequences. Referring now to Figure 12, the method begins with step 121 by converting the information sequence into a curve coding system. In an example, the unconstrained curve coding system is a sequence of arcs, wherein each symbol of the unconstrained curve coding system is a system. An arc corresponding to a subsequence of consecutive identical value bits. The radius of each arc corresponds to the number of bits in each subsequence, and an arc of the sequence corresponding to the high value bit has a contour feature that is opposite to an arc of the sequence corresponding to the low value bit. For example, according to an embodiment of the inventive concept, an arc radius corresponding to a 0-bit string may point in a different direction from an arc radius corresponding to a 1-bit string. Since a one-bit string can contain a plurality of consecutive 1-bit subsequences and consecutive 0-bit sub-sequences, a plurality of arcs can be generated.

In step 122, the curve coding system represented by a sequence of arcs is converted into a closed curve by connecting the start of the sequence of arcs to the end point. According to an embodiment of the inventive concept, the closed curve may be a simple closed curve of a plane. A plane curve is embedded in a plane relative to a curved surface, and a simple closed curve itself does not intersect. A conventional feature of a simple closed curve is that the simple closed curve divides a plane into two regions that are not intersecting, namely the inner and outer regions of the curve. According to an embodiment of the inventive concept, the end point may be connected to the starting point such that the arc feature having the 0 bit subsequence is inwardly recessed toward the closed curve, and the arc feature having the 1-bit subsequence is convex toward the closed curve. Or according to another embodiment of the inventive concept, the end point may be connected to the starting point such that the arc feature having the 0 bit subsequence is convex toward the closed curve, and the arc characteristic having the 1-bit subsequence is inward toward the closed curve Depression.

In step 123, the closed curve is embedded in the two-dimensional pattern and This way hides the existence of a closed curve. According to an embodiment of the inventive concept, the pattern may be a digital camouflage pattern having a plurality of gray scales, and the closed curve may be encoded into at least two important bits. The processing of hidden data is an example of Steganography, which is the processing of hidden messages, regardless of whether the message is encrypted or not, so that no one will be aware of the existence of the message except for the sender and the intended recipient.

13 is a flow chart of a method for decrypting information encoded in a series of contour lines according to an embodiment of the inventive concept. Referring now to FIG. 13, the method starts from step 131 and is performed from a digitized two-dimensional pattern. Extracting at least one closed curve. According to an embodiment of the inventive concept, the two-dimensional pattern may be a camouflage pattern, and the camouflage pattern has a plurality of gray scales. In other embodiments of the inventive concept, a plurality of closed curves may be extracted from the two-dimensional pattern. According to an embodiment of the invention, each closed curve can be a simple closed curve. In step 132, at least one (closed) curve is detachable into a curve coding system. In one embodiment, the unrestricted curve coding system is a series of arcs, wherein each arc represents a symbol in the curve coding system. Next, in step 133, each arc of the series of arcs is converted into a substring of the same value bit, the length of each subsequence corresponds to the radius of each arc, and the bit value in each subsequence corresponds to The contour features of each arc. According to an embodiment of the inventive concept, the bit string can be represented as a two-dimensional bar code. Further, according to the above disclosed content, one of the closed curves extracted from the two-dimensional pattern can be used as a reference curve. The reference curve contains decoding information for the remaining closed curves.

As described above, any type of information can be encoded into a string of bits, i.e., can be digitized, or can be encoded in a two-dimensional curve by a method in accordance with the teachings of the present invention. By way of two examples, non-limiting coding systems of commercial importance that can be encoded in a two-dimensional curve by embodiments of the inventive concept are one-dimensional product barcodes and two-dimensional barcodes. In addition, as described above, a digitized two-dimensional curve can be embedded in the two-dimensional pattern to hide the existence of the two-dimensional curve, and the two-dimensional pattern can be printed on a product such as a clothing, a DVD, or an integrated circuit or become an object in a commodity. Part of, or may be all or part of a product logo.

Those skilled in the art can understand the implementation of the inventive concept. The examples may be implemented in different forms, such as hardware, software, firmware, special purpose processes, or combinations thereof. In one embodiment, the inventive concept can be implemented on a software as an application tangibly embodied on a computer readable program storage device, the application can be uploaded to a machine containing a suitable architecture, for example The central processing unit of a computer workstation, a desktop computer, a notebook computer, a smart phone, etc., is executed by the machine.

Figure 14 is a block diagram of an exemplary computer system for implementing a method of encoding or decoding information in a two-dimensional curve, in accordance with an embodiment of the present invention. Referring now to Figure 14, a computer system 141 for implementing the present invention may specifically include a central processing unit 142, a memory 143, and an input/output (I/O) interface 144. The computer system 141 is generally Output interface 144 is coupled to a display 145 and different input devices 146 such as a mouse and keyboard. The support circuit may include, for example, a cache memory, a power supply, a clock circuit, and a communication bus, and the body 143 may include a random access memory (RAM), a read only memory (ROM), a disk drive, and a magnetic tape. Machine, etc., or a combination thereof. The present invention can be implemented as a common program 147, which is stored in the memory 143 and executed by the central processing unit 142 to process the signal from the signal element 148. Therefore, when the computer system 141 executes the commonly used program 147 of the present invention, From a general-purpose computer system to a special-purpose computer.

The computer system 141 also includes an operating system and microinstruction code. The different processing and functions described herein may be part of the microinstruction code or part of the application (or a combination of the two), which is executed by the operating system. . In addition, different peripheral devices such as additional data storage devices and photocopying devices can be connected to the computer platform.

It should be understood by those of ordinary skill in the art that since some of the constituent system components and method steps described in the figures can be implemented on software, the actual connections between system components (or processing steps) will vary, depending on The method input by the present invention. In view of the teachings of the present invention as set forth herein, those skilled in the art will be able

The concept of the present invention has been described in detail by reference to example embodiments, and those of ordinary skill in the art should understand that various modifications and substitutions are The spirit and scope of the patent application scope of the present invention proceeds.

121‧‧‧Steps

122‧‧‧Steps

123‧‧‧Steps

Claims (24)

A method of encrypting information, comprising the steps of: converting a sequence of information represented as a one-bit string into a curve coding system to provide at least one closed curve; and embedding the at least one closed curve into a two-dimensional pattern. The method of encrypting information according to claim 1, wherein the step of converting a one-bit string into a curve coding system to provide at least one closed curve comprises: each of consecutive same-valued bits in the bit string The substrings are converted into an arc, wherein the radius of each arc corresponds to the number of bits in each subsequence, and an arc of the sequence corresponding to the high value bit has an arc opposite to the sequence corresponding to the low value bit a contour feature; and converting the arc sequence into a closed curve by connecting the end point of the arc sequence to the beginning of the arc sequence. The method of encrypting information according to claim 1, further comprising converting the bit string into a plurality of closed curves, and embedding each of the closed curves in the two-dimensional pattern. According to the method of encrypting information according to claim 3, wherein one of the closed curves embedded in the two-dimensional pattern is a reference curve, and the reference curve includes the remaining codes of the closed curves. Information, the encoded information includes one or both of the start/end points of each closed curve and a traversal sequence of the closed curves. The method of encrypting information according to claim 1, wherein the two-dimensional pattern has a camouflage pattern of a plurality of color shades. The method of encrypting information according to claim 1, wherein the at least one closed curve is a simple closed curve. The method of encrypting information according to claim 1, wherein the bit string is represented as a QR code. The method of encrypting information according to claim 1, wherein converting the one-bit string into a curve coding system to provide at least one closed curve comprises: receiving a reference point; Generating an arc from a substring of the same value bit in the bit string, wherein the length of the substring of the same value bit corresponds to the distance from a selected point to the reference point on the arc, and the same value A bit value in the substring of the bit corresponds to a contour feature of the closed curve relative to the reference point at the selected point; a vector is saved from the reference point to the selected point relative to a predetermined direction The angle; and the step of repeatedly generating an arc and saving an angle until the bit string is all converted into a series of arcs, wherein when the one or more arcs are not connected, the adjacent pairs are not connected A connecting arc is created between the arcs to produce at least one closed curve. The method of encrypting information according to claim 1, wherein converting the one-bit string into a curve coding system to provide at least one closed curve comprises: receiving a closed boundary curve and a reference point; Inside the curve, an arc is generated from a substring of the same value bit in the bit string, wherein the length of the substring of the same value bit corresponds to an offset from the arc of the closed boundary curve, and A bit value in the substring of the same value bit corresponds to a contour feature of the arc; a length of the vector is saved from a selected point on the arc to the reference point and the vector is relative to a predetermined direction An angular offset; and repeating the step of generating an arc and storing a length and an angular offset until the bit string is fully converted into a series of arcs, wherein when the closed boundary curve is at the same offset of one or When a plurality of the arcs are not connected, a connecting arc is generated between adjacent pairs of unconnected arcs to generate a plurality of nested closed curves in the closed boundary curve representing a contour map. The method of encrypting information according to claim 1, wherein the step of converting a bit string into a curve coding system to provide at least one closed curve comprises: generating the closed curves, wherein the closed curves are One is a reference curve, and the other Each of the equal closed curves is derived from the reference curve by an affine transformation, wherein each of the affine transformations is at least two selected from the group consisting of: translation, reflection, rotation, scaling, positional transformation, and shear mapping. a combination of transformations, wherein the step of converting the bit string into the closed curves comprises converting a substring of each equivalence bit into one of the closed curves, wherein the number of the same value bits Corresponding to one of the at least two transforms, and the bit value of the equi-valued bit corresponds to other transforms in the at least two transforms. The method of encrypting information according to claim 1, wherein converting the one-bit string into a curve coding system to provide at least one closed curve comprises: converting each sub-string of the same-valued bit into At least one sub-region inside the closed curve, each sub-region being bounded by a pair of parallel segments having a predetermined separation extending through the interior of the at least one closed curve and a pair of curved segments, wherein each of the sub-regions The area corresponds to the length of a corresponding substring of the same value bit, and the bit value of the same value bit corresponds to a contour feature of the at least one pair of curved line segments delimiting the sub-region; A plurality of adjacent parallel line segments are adjacent to successive sub-regions, wherein the pair of curved line segments form at least one closed curve. A non-temporary computer readable program storage device tangibly embodying a program program processed by the computer to perform a method step for decrypting information, the method comprising the steps of: extracting from a digitized two-dimensional pattern At least one closed curve; and converting the at least one closed curve into a sequence of information represented as a one-bit string. According to the computer readable program storage device of claim 12, the step of converting the at least one closed curve into a one-bit string comprises: splitting the at least one closed curve into a sequence of arcs, and determining each a contour feature of the arc and a radius; and converting the arc of the sequence into the string of bits, wherein each of the consecutive same-valued bits The subsequences correspond to an arc, wherein the length of each subsequence corresponds to the radius of each arc, and the bit value of each subsequence corresponds to a contour feature of each arc. The computer readable program storage device according to claim 12, wherein the two-dimensional pattern is a camouflage pattern having a plurality of gray scales. The computer readable program storage device of claim 12, the method further comprising extracting the closed curves from the two-dimensional pattern, and deriving the bit from each of the closed curves The serial sequence is connected to a single bit string representing the information sequence. The computer readable program storage device of claim 15, wherein one of the closed curves extracted from the two-dimensional pattern is a reference curve, and the reference curve includes the remaining closed curves Decoding information that includes one or both of the start/end points in each closed curve and a traversal sequence of the closed curves. The computer readable program storage device of claim 12, wherein the at least one closed curve is a simple closed curve. The computer readable program storage device of claim 12, wherein the bit string is represented as a QR Code. The computer readable program storage device of claim 12, wherein the converting the at least one closed curve into a one-bit string comprises: extending a vector from a reference point to a selection on the closed curve a point; wherein a length of a vector from the reference point to the selection point corresponds to a number of parity bits of a substring in the bit string, and the substring in the same value bit The bit value is determined by a contour feature of the closed curve at the selected point. The computer readable program storage device of claim 12, wherein the converting the at least one closed curve into a one-bit string comprises: receiving a reference point and a starting angle with respect to a predetermined direction; On the closed curve, a vector is extended from the reference point of the starting angle to a selection point; the vector is offset by a predetermined angular offset to extend from the reference point a vector to another point on the closed curve; and repeating the step of shifting the vector by a predetermined angular offset to extend another vector from the reference point to another point on the closed curve until the closed curve Has been traversed, wherein the length of the vector corresponds to the number of identical bits in a substring, and the value of the bit in the substring of the same value is one of the closed curves at that point The contour feature is determined, wherein the at least one closed curve is converted into a sequence of information represented as a one-bit string. The computer readable program storage device of claim 12, wherein the at least one closed curve comprises a plurality of nested closed curves represented by a contour map, wherein the at least one closed curve is converted into a bit The step of the string includes: receiving a reference point and a starting angle with respect to a predetermined direction; and extending a vector from the reference point to the nested closed curve by a predetermined distance from the starting angle One of the points, and by continuously offsetting the vector by a predetermined angular offset, converting the nested closed curve into the bit string, wherein an external contour from the nested closed curve An offset of one of the nested closed curves corresponds to the number of equal-valued bits in the sub-string of the bit string, and the bits in the sub-string of the same-valued bit The value is determined by a profile characteristic of one of the nested closed curves at that point. The computer readable program storage device of claim 12, wherein the closed curves are extracted from the digitized two-dimensional pattern, wherein one of the closed curves is a reference curve, and Each of the other closed curves is derived from the reference curve by an affine transformation, wherein each of the affine transformations is selected from the group consisting of: translation, reflection, rotation, scaling transformation, bit transformation, and shear mapping. a combination of more than one transformation; and wherein the step of converting the closed curves into a one-bit string comprises converting each of the closed curves into a substring of the same value bit, wherein the number of parity bits corresponds to One of the two or more transforms, and the bit values of the equi-valued bits correspond to other transforms of the two or more transforms. A computer readable program storage device according to claim 12, The step of converting the at least one closed curve into a one-bit string comprises: dividing an interior of the at least one closed curve into a plurality of sub-regions, each sub-region being bounded by a pair of parallel line segments, wherein the pair of parallel line segments have an extension a predetermined separation of the interior of the at least one closed curve and a pair of curved line segments on either side of the curve; and converting the closed curve into a sequence of information represented as a one-bit string, wherein the area of each sub-region corresponds to the The number of bits of the same-valued bit of the substring of the bit string, and the bit value of the same-valued bit corresponds to a contour feature of the at least one pair of curved line segments delimiting the sub-region. A method of encrypting information, comprising the steps of: converting a sequence of information represented by the bit string into a curve coding system by converting each substring of consecutive equivalence bits in a metastring into an arc, The length of each substring of the same value bit corresponds to the distance from a selected point to a reference point on the arc, and the one-bit value of the sub-string of the same-valued bit corresponds to the arc at the Selecting a contour feature of the point relative to the reference point; connecting the arcs into a closed curve; and embedding the closed curve into a two-dimensional pattern.