CN110942129B - Generating method of five-pointed star encryption code - Google Patents

Generating method of five-pointed star encryption code Download PDF

Info

Publication number
CN110942129B
CN110942129B CN201911292837.7A CN201911292837A CN110942129B CN 110942129 B CN110942129 B CN 110942129B CN 201911292837 A CN201911292837 A CN 201911292837A CN 110942129 B CN110942129 B CN 110942129B
Authority
CN
China
Prior art keywords
area
encryption
pointed star
encrypted
outer frame
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201911292837.7A
Other languages
Chinese (zh)
Other versions
CN110942129A (en
Inventor
桑海明
甘戈
谭亚楠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Moment Network Technology Co ltd
Original Assignee
Moment Network Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Moment Network Technology Co ltd filed Critical Moment Network Technology Co ltd
Priority to CN201911292837.7A priority Critical patent/CN110942129B/en
Publication of CN110942129A publication Critical patent/CN110942129A/en
Application granted granted Critical
Publication of CN110942129B publication Critical patent/CN110942129B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K19/00Record carriers for use with machines and with at least a part designed to carry digital markings
    • G06K19/06Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
    • G06K19/06009Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
    • G06K19/06046Constructional details
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K19/00Record carriers for use with machines and with at least a part designed to carry digital markings
    • G06K19/06Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
    • G06K19/06009Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
    • G06K19/06046Constructional details
    • G06K19/06075Constructional details the marking containing means for error correction
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K19/00Record carriers for use with machines and with at least a part designed to carry digital markings
    • G06K19/06Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
    • G06K19/06009Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
    • G06K19/06046Constructional details
    • G06K19/06131Constructional details the marking comprising a target pattern, e.g. for indicating the center of the bar code or for helping a bar code reader to properly orient the scanner or to retrieve the bar code inside of an image

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Storage Device Security (AREA)

Abstract

The invention discloses a generation method of a five-pointed star encryption code, which comprises the following steps: A. setting a five-pointed star outer frame; B. determining five vertex angle positions of the five-pointed star outer frame; filling positioning features in each vertex angle; C. and filling the other blank areas of the five-pointed star outer frame with encrypted data. The invention can improve the defects of the prior art, improve the identification reliability of the encryption code, reduce the use limit condition of the encryption code, and is particularly suitable for encrypting seal patterns.

Description

Generating method of five-pointed star encryption code
Technical Field
The invention relates to the technical field of data encryption, in particular to a generation method of a five-pointed star encryption code.
Background
QRcode two-dimensional codes are currently widely used identification codes. The identification form of the QRcode two-dimensional code comprises a positioning system, a description system, a data system and an error correction system. The two-dimensional code position can be quickly searched by using the positioning system, and meanwhile, the two-dimensional code safety degree can be checked by performing image projection perspective restoration. After the two-dimensional code position is correctly searched, the description system can be utilized to accurately know the two-dimensional code data format level information. The two-dimensional code damaged to a certain extent can be perfectly repaired through the data system and the error correction system. The two-dimensional code represents binary digits of 0 and 1 through black and white grids with the same size, and then the binary digits are converted into literal characters to obtain decrypted original data content. Besides the advantage of being capable of rapidly and accurately identifying data, the two-dimensional code has some problems, namely, the shape is fixed, the algorithm mechanism of the two-dimensional code causes that the two-dimensional code must follow the shape rule, and any modification of the appearance outline is not allowed. Meanwhile, the situation of three positioning points of the two-dimensional code is too unsafe, and any one of the three positioning points is missing or interfered to cause the failure of the whole two-dimensional code.
In the prior art of seal encryption, a plurality of encryption methods exist, such as the seal encryption methods disclosed in Chinese patent application CN 106570355B, CN 104504738B, CN 107944252A and the like, are based on the traditional two-dimensional code, and the problem of a plurality of using limiting conditions of the traditional two-dimensional code is not solved although specific encryption modes are different.
Disclosure of Invention
The invention aims to provide a generation method of a five-pointed star encryption code, which can solve the defects of the prior art, improve the identification reliability of the encryption code, reduce the use limit condition of the encryption code and is particularly suitable for encrypting seal patterns.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows.
A generation method of a five-pointed star encryption code comprises the following steps:
A. setting a five-pointed star outer frame;
B. determining five vertex angle positions of the five-pointed star outer frame; filling positioning features in each vertex angle;
C. and filling the other blank areas of the five-pointed star outer frame with encrypted data.
Preferably, in step B, the positioning feature comprises three similar triangles nested inside and outside, each triangle having a frame width of 1 unit width in the non-overlapping region.
Preferably, in the step C, an isolation interval is provided between the encrypted data and the positioning feature, and the width of the isolation interval is 1 unit width.
Preferably, in the step C, the encrypted data is formed by filling a plurality of square tiles with uniform sizes, and the side length of each square tile is 1.5 units wide.
Preferably, in the step C, a pentagon surrounded by extended lines of five vertex angles is defined as a main data area, five independent quadrilaterals outside the main data area are respectively defined as a first encryption area, a second encryption area, a third encryption area, a fourth encryption area and a fifth encryption area, and the result of number subtraction between any one encryption area and two adjacent encryption areas is respectively 2 and 3; the main data area is used for storing core data, and the first encryption area, the second encryption area, the third encryption area, the fourth encryption area and the fifth encryption area are used for storing calculation factors and error correction algorithm data for providing an encryption algorithm for the main data area.
Preferably, in the step C, the filling sequence of the encrypted data starts from the first encrypted area, passes through the main data area, reaches the second encrypted area, then passes through the main data area again, reaches the third encrypted area, then passes through the main data area again, reaches the fourth encrypted area, then passes through the main data area again, reaches the fifth encrypted area, and then passes through the main data area again, and reaches the first encrypted area; after the above-mentioned one cycle is completed, the path filled with the encrypted data is contracted toward the inner side of the five-pointed star outer frame, and then the above-mentioned cycle is repeated again until the blank area of the whole five-pointed star outer frame is filled with the encrypted data.
Preferably, the vertex angle of the five-pointed star outer frame is 30 degrees, the included angle between the central lines of two adjacent vertex angles is 120 degrees, and the included angle between the side edges of two vertex angles is 105 degrees; when the five-pointed star encrypted code image deflects, any vertex angle of the five-pointed star outer frame is adjusted to be vertical upwards, then the image is rotated, so that the vertex angle of the five-pointed star outer frame in the image is 30 degrees, the included angle between the central lines of two adjacent vertex angles is 120 degrees, and the included angle between the side edges of the two vertex angles is 105 degrees, and the correction of the five-pointed star encrypted code image is completed.
The beneficial effects brought by adopting the technical scheme are as follows: the invention can realize that the encryption code is filled in the five-pointed star area of the seal for encryption. And simultaneously, five vertexes of the five-pointed star area are utilized to realize the positioning of five positioning points, and the positioning of the encrypted graph can be realized only after any three of the five positioning points are determined. The encryption information filling mode can ensure that the encryption information and the error correction information can appear in different positions, and can have higher code reading reliability through algorithm identification.
Drawings
FIG. 1 is a schematic diagram of the generation of an encryption code in accordance with one embodiment of the present invention.
In the figure: 1. positioning features; 2. an isolation section; 3. a main data area; 4. a first encryption zone; 5. a second encryption area; 6. a third encryption zone; 7. a fourth encryption zone; 8. and a fifth encryption area.
Detailed Description
Referring to fig. 1, one embodiment of the present invention includes the steps of,
A. setting a five-pointed star outer frame;
B. determining five vertex angle positions of the five-pointed star outer frame; filling positioning features 1 in each vertex angle;
C. and filling the other blank areas of the five-pointed star outer frame with encrypted data.
In step B, the positioning feature comprises three similar triangles nested inside and outside, and the frame width of the non-overlapping area of each triangle is 1 unit width.
In the step C, an isolation interval 2 is arranged between the encrypted data and the positioning feature, and the width of the isolation interval 2 is 1 unit width.
In the step C, the encrypted data is formed by filling a plurality of square grids with the same size, and the side length of each square grid is 1.5 units of width.
In the step C, a pentagon surrounded by the extension lines of five vertex angles is defined as a main data area 3, five independent quadrilaterals outside the main data area 3 are respectively defined as a first encryption area 4, a second encryption area 5, a third encryption area 6, a fourth encryption area 7 and a fifth encryption area 8, and the result of the number subtraction between any encryption area and two adjacent encryption areas is respectively 2 and 3; the main data area 3 is used for storing core data, and the first encryption area 4, the second encryption area 5, the third encryption area 6, the fourth encryption area 7 and the fifth encryption area 8 are used for storing calculation factors and error correction algorithm data for providing an encryption algorithm for the main data area 3.
In step C, the filling sequence of the encrypted data starts from the first encrypted area 4, passes through the main data area 3, reaches the second encrypted area 5, passes through the main data area 3 again, reaches the third encrypted area 6, passes through the main data area 3 again, reaches the fourth encrypted area 7, passes through the main data area 3 again, reaches the fifth encrypted area 8, and passes through the main data area 3 again, and reaches the first encrypted area 4; after the above-mentioned one cycle is completed, the path filled with the encrypted data is contracted toward the inner side of the five-pointed star outer frame, and then the above-mentioned cycle is repeated again until the blank area of the whole five-pointed star outer frame is filled with the encrypted data.
The vertex angle of the five-pointed star outer frame is 30 degrees, the included angle between the central lines of two adjacent vertex angles is 120 degrees, and the included angle between the side edges of the two vertex angles is 105 degrees; when the five-pointed star encrypted code image deflects, any vertex angle of the five-pointed star outer frame is adjusted to be vertical upwards, then the image is rotated, so that the vertex angle of the five-pointed star outer frame in the image is 30 degrees, the included angle between the central lines of two adjacent vertex angles is 120 degrees, and the included angle between the side edges of the two vertex angles is 105 degrees, and the correction of the five-pointed star encrypted code image is completed.
In the description of the present invention, it should be understood that the terms "longitudinal," "transverse," "upper," "lower," "front," "rear," "left," "right," "vertical," "horizontal," "top," "bottom," "inner," "outer," and the like indicate or are based on the orientation or positional relationship shown in the drawings, merely to facilitate description of the present invention, and do not indicate or imply that the devices or elements referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus should not be construed as limiting the present invention.
The foregoing has shown and described the basic principles and main features of the present invention and the advantages of the present invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and that the above embodiments and descriptions are merely illustrative of the principles of the present invention, and various changes and modifications may be made without departing from the spirit and scope of the invention, which is defined in the appended claims. The scope of the invention is defined by the appended claims and equivalents thereof.

Claims (2)

1. The generation method of the five-pointed star encryption code is characterized by comprising the following steps of:
A. setting a five-pointed star outer frame;
B. determining five vertex angle positions of the five-pointed star outer frame; filling positioning features in each vertex angle;
C. filling encrypted data in other blank areas of the five-pointed star outer frame;
in the step B, the positioning feature comprises three similar triangles nested inside and outside, and the frame width of the non-overlapping area of each triangle is 1 unit width;
in the step C, an isolation interval is arranged between the encrypted data and the positioning feature, and the width of the isolation interval is 1 unit width;
in the step C, the encrypted data is formed by filling a plurality of square grids with the same size, and the side length of each square grid is 1.5 units of width;
in the step C, a pentagon surrounded by the extension lines of five vertex angles is defined as a main data area, five independent quadrilaterals outside the main data area are respectively defined as a first encryption area, a second encryption area, a third encryption area, a fourth encryption area and a fifth encryption area, and the result of the number subtraction between any encryption area and two adjacent encryption areas is respectively 2 and 3; the main data area is used for storing core data, and the first encryption area, the second encryption area, the third encryption area, the fourth encryption area and the fifth encryption area are used for storing calculation factors and error correction algorithm data for providing an encryption algorithm for the main data area;
in the step C, the filling sequence of the encrypted data starts from the first encrypted area, reaches the second encrypted area after passing through the main data area, then reaches the third encrypted area after passing through the main data area again, then reaches the fourth encrypted area after passing through the main data area again, then reaches the fifth encrypted area after passing through the main data area again, and then reaches the first encrypted area after passing through the main data area again; after the above-mentioned one cycle is completed, the path filled with the encrypted data is contracted toward the inner side of the five-pointed star outer frame, and then the above-mentioned cycle is repeated again until the blank area of the whole five-pointed star outer frame is filled with the encrypted data.
2. The method for generating the five-pointed star encryption code according to claim 1, wherein: the vertex angle of the five-pointed star outer frame is 30 degrees, the included angle between the central lines of two adjacent vertex angles is 120 degrees, and the included angle between the side edges of the two vertex angles is 105 degrees; when the five-pointed star encrypted code image deflects, any vertex angle of the five-pointed star outer frame is adjusted to be vertical upwards, then the image is rotated, so that the vertex angle of the five-pointed star outer frame in the image is 30 degrees, the included angle between the central lines of two adjacent vertex angles is 120 degrees, and the included angle between the side edges of the two vertex angles is 105 degrees, and the correction of the five-pointed star encrypted code image is completed.
CN201911292837.7A 2019-12-16 2019-12-16 Generating method of five-pointed star encryption code Active CN110942129B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911292837.7A CN110942129B (en) 2019-12-16 2019-12-16 Generating method of five-pointed star encryption code

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911292837.7A CN110942129B (en) 2019-12-16 2019-12-16 Generating method of five-pointed star encryption code

Publications (2)

Publication Number Publication Date
CN110942129A CN110942129A (en) 2020-03-31
CN110942129B true CN110942129B (en) 2023-06-02

Family

ID=69910822

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911292837.7A Active CN110942129B (en) 2019-12-16 2019-12-16 Generating method of five-pointed star encryption code

Country Status (1)

Country Link
CN (1) CN110942129B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006302050A (en) * 2005-04-21 2006-11-02 Main:Kk Two-dimensional bar code
CN102034127A (en) * 2009-09-28 2011-04-27 上海易悠通信息科技有限公司 Novel high-capacity two-dimensional barcode and system, encoding and decoding methods and applications thereof
CN206480013U (en) * 2016-04-12 2017-09-08 立德高科(昆山)数码科技有限责任公司 The Quick Response Code and two-dimension code label of a kind of novel type
CN109447216A (en) * 2018-12-30 2019-03-08 尤尼泰克(嘉兴)信息技术有限公司 A kind of two dimensional code quick and precisely identified
CN109754045A (en) * 2019-01-25 2019-05-14 海明联合能源集团矩网科技有限公司 A kind of ring code, annular code generating method and its application

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101416685B1 (en) * 2013-01-18 2014-07-09 어보브반도체 주식회사 Method for protecting binary data in non-volatile memory and apparatus thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006302050A (en) * 2005-04-21 2006-11-02 Main:Kk Two-dimensional bar code
CN102034127A (en) * 2009-09-28 2011-04-27 上海易悠通信息科技有限公司 Novel high-capacity two-dimensional barcode and system, encoding and decoding methods and applications thereof
CN206480013U (en) * 2016-04-12 2017-09-08 立德高科(昆山)数码科技有限责任公司 The Quick Response Code and two-dimension code label of a kind of novel type
CN109447216A (en) * 2018-12-30 2019-03-08 尤尼泰克(嘉兴)信息技术有限公司 A kind of two dimensional code quick and precisely identified
CN109754045A (en) * 2019-01-25 2019-05-14 海明联合能源集团矩网科技有限公司 A kind of ring code, annular code generating method and its application

Also Published As

Publication number Publication date
CN110942129A (en) 2020-03-31

Similar Documents

Publication Publication Date Title
CN103983213B (en) A kind of structure light coding method and relevant apparatus
CN105989317B (en) Two-dimensional code identification method and device
KR101693733B1 (en) Method and device for generating a calibrated projection
CN104966115B (en) A kind of method with image completion Quick Response Code
EP2849115B1 (en) Method for decoding matrix-type two-dimensional code
CN101763654B (en) Feather point matching method based on colored false random coding projection
WO2017133532A1 (en) Methods of encoding and reading 2d bitmap barcode
CN103793735B (en) Circular two-dimensional bar code and encoding and decoding method thereof
CN104866859A (en) High-robustness visual graphical sign and identification method thereof
US9070034B2 (en) Method and system for correcting QR code image
CN104463059B (en) Reconstructing method when a detection figure is damaged in QR yards of identification
CN110047109A (en) A kind of camera calibration plate and its recognition detection method based on self-identifying label
CN112001469B (en) Two-dimensional code encoding method, decoding method and two-dimensional code
CN106407973B (en) It is marked on the Robust identifying method of the AR code on cylinder
CN111754536B (en) Image labeling method, device, electronic equipment and storage medium
CN103745221B (en) Two-dimensional code image correction method
CN109978110B (en) Two-dimensional code for AGV positioning and navigation and decoding method
CN101436300B (en) Method and apparatus for dividing barrier
WO2021004414A1 (en) Coding pattern, coding and reading methods for same, calibration board, and calibration method
CN107247985A (en) Coding, positioning and the recognition methods of New Two Dimensional code
AU2007254626A1 (en) Data encoding and decoding using circular configurations of marks
CN108256609B (en) Circular image finding graph two-dimensional code and generation and interpretation method thereof
CN110942129B (en) Generating method of five-pointed star encryption code
WO2020186900A1 (en) Narrow-strip two-dimensional barcode, and method, apparatus and device for generating and recognizing narrow-strip two-dimensional barcode
CN112001352A (en) Textile operation workbench identification and positioning method and device based on Apriltag

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information
CB02 Change of applicant information

Address after: 063000 Floor 23, Block A, Wanda Plaza, Lunan District, Tangshan City, Hebei Province

Applicant after: Moment Network Technology Co.,Ltd.

Address before: 063000 Floor 23, Block A, Wanda Plaza, Lunan District, Tangshan City, Hebei Province

Applicant before: HAIMING UNITED ENERGY GROUP MATRIXNETS TECHNOLOGY Co.,Ltd.

GR01 Patent grant
GR01 Patent grant