CN104639179B - Pass through the method for shortening code and detecting specific fault pattern of binary system primitive BCH code - Google Patents
Pass through the method for shortening code and detecting specific fault pattern of binary system primitive BCH code Download PDFInfo
- Publication number
- CN104639179B CN104639179B CN201310563744.XA CN201310563744A CN104639179B CN 104639179 B CN104639179 B CN 104639179B CN 201310563744 A CN201310563744 A CN 201310563744A CN 104639179 B CN104639179 B CN 104639179B
- Authority
- CN
- China
- Prior art keywords
- code
- error
- shortening
- bch
- bch code
- 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
Links
Landscapes
- Detection And Correction Of Errors (AREA)
Abstract
The invention discloses a kind of methods for shortening code and detecting specific fault pattern by binary system primitive BCH code, belong to error control coding and information security field.Include the following steps：According to the shortening code for needing the size of the data cell detected to select suitable BCH code in system；Consideration system is by the error pattern that the failure environment faced and data are likely to occur and is set out；The algorithmically part that is shortened of construction BCH code so that when these error patterns occur in data and check code be improper code, these error patterns detected so as to 100%, without influencing total error detection probability.The present invention, being capable of 100% detection error pattern special caused by fault attacks in the case where ensureing error detection probability.
Description
Technical field
The present invention relates to error control codings and information security field, passing through binary system basis BCH more particularly to one kind
The method for shortening code detection specific fault pattern of code.
Background technology
1948, Shannon at one with milestone significance paper in it has been demonstrated that, as long as the rate of information throughput is less than
Channel capacity can will be made an uproar by suitably being encoded to information in the case where not sacrificing information transmission or memory rate
The mistake that channel or storage media introduce reduces to arbitrarily low degree.
In fact all error correcting codes are all based on a common basic principle：Redundancy is added in information, to correct
The mistake that information may occur in storing and transmitting.
The main problem of error correcting code discussion be exactly design and be implemented as to channel encoder/decoder so that：
1) information can as fast as possible (or high density as far as possible) be transmitted (or record) under noisy environment.
2) information can reliably be reappeared in the output end of channel decoder.
3) it will realize that the cost of encoder and decoder is reduced in acceptable range.
Bo Si (Bose), Cha Dehuli (Chaudhuri) and Huo Kun lattice nurse (Hocquenghem) (BCH) code constitute one
Class is important and effectively corrects the cyclic code of random error, and this kind of code is a kind of important popularization to Hamming code, can be used for correcting
Multiple mistakes.Since this yard has stringent Algebraic Structure, so being up to the present to study the most detailed, using the widest
General a kind of code, there are many decoding algorithms.
For arbitrary positive integer m (m >=3) and t (t<2m-1), there are the binary BCH codes with following parameter：
Block length：N=2m-1；
Parity check bit number：n-k≤mt；
Minimum range：dmin≥2t+1。
It is n=2 in a lengthmIn -1 grouping, this yard can correct the arbitrary combination of t or less than t mistake, claim
This yard is the BCH code for entangling t mistake.The generator polynomial of this yard is by it in galois field GF (2m) on root determine.
With the development of information technology, the confidentiality and integrity of data receives more and more attention, since bypass is attacked
It hits after (Side Channel Attacks) be suggested to, the transimission and storage of information not only needs caused by considering random noise
Mistake, it is also contemplated that mistake caused by fault attacks.
Error analysis is to carry out the analytical technology that analysis obtains key information using error result.In hardware defence mistake point
In terms of analysis measure, EDC error detection and correction is generally included, error-detecging code includes parity check code, cyclic redundancy check code CRC etc.；Error correcting code
Have the function of EDC error detection and correction, including Hamming code, BCH code, RS codes etc. simultaneously.
The present invention pays close attention to the binary system primitive BCH code that memory is often used
Invention content
The technical problem to be solved in the present invention is to provide a kind of shortening codes by binary system primitive BCH code to detect special mistake
The accidentally method of pattern being capable of 100% detection wrong mould special caused by fault attacks in the case where ensureing error detection probability
Formula.
In order to solve the above technical problems, the shortening code by binary system primitive BCH code of the present invention detects specific fault mould
The method of formula, includes the following steps：
Step 1: according to the shortening code for needing the size of the data cell detected to select suitable BCH code in system；
Step 2: considering system by the error pattern that the failure environment faced and data are likely to occur and being set out；
Step 3: the algorithmically part that is shortened of construction BCH code, if error pattern it is more and what BCH code was shortened
Part is less, it is possible to which traversing BCH code and being shortened all values of part can not also find and can all error patterns be become non-
One shortening code of weights, then can be by finite field gf (2m) rank increase and reconfigure the shortening code of BCH code for m+1, make
It is improper code when these error patterns occur in proper data and check code, these error patterns is detected so as to 100%, and
Total error detection probability is not influenced.
The shortening code of BCH code described in step 1, if data and the length of check code have met the grouping of BCH code
It is required that n=2m- 1 (m be finite field gf (2m) rank), that is, shorten length be 0, then can be by using finite field gf (2m+1)
To construct the shortening code of BCH code.
Special error pattern is become illegal code word by the value that the present invention is shortened part by construction, so as to pass through
Error detection circuit 100% is detected, and special error pattern, which is become illegal code word, to be shortened part by construction
Value realize.
Description of the drawings
The present invention is described in further detail with specific implementation mode below in conjunction with the accompanying drawings：
Fig. 1 is the codeword structure of BCH code in the present invention.
Fig. 2 is the codeword structure of the BCH code shortened in the present invention.
Specific implementation mode
Below the present invention is introduced for using binary system primitive BCH code to realize to the function of 32bits data error detections.
1, system needs to realize error detection function to each 32bits data cells in ROM and EEPROM using BCH code,
The block length of BCH code need to meet n=2m- 1 (m be finite field gf (2m) rank), codeword structure is as shown in Figure 1, and 25-1<
32+ check bit<26- 1, so selection finite field gf (26), primitive polynomial p (X)=X6+X+1。
2, due to only needing to realize error detection function, so only needing the check bit of 6bits；Block length is 26- 1=
38bits is actually needed in 63bits, needs to shorten 25bits, shortening is come by using the part of code rather than all information bit
It realizes, codeword structure is as shown in Figure 2.
3, the BCH code shortened is liner code, is usually no longer cyclic code, but after the bit that is shortened of proper treatment, can be with
Use same codec.
4, consider that the 38bits data cells in ROM and EEPROM may be become full 0 or complete 1 by failure, if BCH code
It is shortened part and is fixed as full 0,38bits full 0s are legal-code, can not be detected by error detection circuit；If BCH code quilt
It is legal-code to shorten part to be fixed as complete 1,38bits complete 1, can not be detected by error detection circuit.
5, the error detection function to 38bits full 0s and complete 1 is realized, it is necessary to which the value that part is shortened by construction to work as
The check code of its 6bits is not full 0 when 32bits data are full 0, and makes the school of its 6bits when 32bits data are complete 1
It is complete 1 to test code not, that is, 38bits full 0s and complete 1 is made to belong to illegal code word.
6, find that remaining 24bits is set by immediately the 1bit of 32bits data is set as 1 in the 25bits being shortened in testing
When being 0, the check code of 32bits full 0 data is not full 0, and the check code of complete 1 data of 32bits is not complete 1, is thereby realized
38bits full 0s and complete 1 are become to the purpose of illegal code word, 38bits full 0s and complete 1 can also be detected by error detection circuit.
Above by specific implementation mode, invention is explained in detail, but these are not constituted to the present invention's
Limitation.Without departing from the principles of the present invention, those skilled in the art can also make many modification and improvement, these
It should be regarded as protection scope of the present invention.
Claims (2)
1. a kind of method for shortening code and detecting specific fault pattern by binary system primitive BCH code, which is characterized in that including such as
Lower step：
Step 1: according to the shortening code for needing the size of the data cell detected to select suitable BCH code in system；
Step 2: considering system by the error pattern that the failure environment faced and data are likely to occur and being set out；
Step 3: the part that algorithmically construction BCH code is shortened, when all values that traversal BCH code is shortened part can not yet
When finding the shortening code that all error patterns can be become to improper code, then by finite field gf (2m) rank increase be m+1
To reconfigure the shortening code of BCH code so that when there are these error patterns in data and check code be improper code, so as to
100% detects these error patterns, without influencing total error detection probability.
2. the method as described in claim 1, it is characterised in that：The shortening code of BCH code described in step 1, if data and
The grouping that the length of check code has met BCH code requires n=2m- 1, then by using finite field gf (2m+1) construct BCH code
Shortening code；Wherein, m is finite field gf (2m) rank.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310563744.XA CN104639179B (en) | 2013-11-13 | 2013-11-13 | Pass through the method for shortening code and detecting specific fault pattern of binary system primitive BCH code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310563744.XA CN104639179B (en) | 2013-11-13 | 2013-11-13 | Pass through the method for shortening code and detecting specific fault pattern of binary system primitive BCH code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104639179A CN104639179A (en) | 2015-05-20 |
| CN104639179B true CN104639179B (en) | 2018-08-14 |
Family
ID=53217561
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310563744.XA Active CN104639179B (en) | 2013-11-13 | 2013-11-13 | Pass through the method for shortening code and detecting specific fault pattern of binary system primitive BCH code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104639179B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3287859B1 (en) * | 2016-08-25 | 2023-01-25 | Ningbo Geely Automobile Research & Development Co., Ltd. | Methods and systems for detecting faults in vehicle control systems |
| CN108347250B (en) * | 2017-01-23 | 2021-08-03 | 合肥高维数据技术有限公司 | Fast coding method and apparatus suitable for small amount of redundant Reed-Solomon codes |
| CN111147489B (en) * | 2019-12-26 | 2020-12-25 | 中国科学院信息工程研究所 | Link camouflage-oriented fishfork attack mail discovery method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5390195A (en) * | 1992-04-03 | 1995-02-14 | Ampex Corporation | Miller-squared decoder with erasure flag output |
| CN1437157A (en) * | 2002-02-05 | 2003-08-20 | 安徽大学 | Rectangular code encoding method and rectangular code based on themethod |
| CN101460974A (en) * | 2006-06-06 | 2009-06-17 | 索尼英国有限公司 | Generation of code words for image watermarking |
| CN101483442A (en) * | 2009-02-11 | 2009-07-15 | 芯原微电子(上海)有限公司 | BCH decoder for configuring error correcting capability according to Nand Flash extra space |
| CN102393890A (en) * | 2011-10-09 | 2012-03-28 | 广州大学 | Crypto chip system for resisting physical invasion and side-channel attack and implementation method thereof |
| WO2013004494A1 (en) * | 2011-07-05 | 2013-01-10 | Robert Bosch Gmbh | Method for securely checking a code |
-
2013
- 2013-11-13 CN CN201310563744.XA patent/CN104639179B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5390195A (en) * | 1992-04-03 | 1995-02-14 | Ampex Corporation | Miller-squared decoder with erasure flag output |
| CN1437157A (en) * | 2002-02-05 | 2003-08-20 | 安徽大学 | Rectangular code encoding method and rectangular code based on themethod |
| CN101460974A (en) * | 2006-06-06 | 2009-06-17 | 索尼英国有限公司 | Generation of code words for image watermarking |
| CN101483442A (en) * | 2009-02-11 | 2009-07-15 | 芯原微电子(上海)有限公司 | BCH decoder for configuring error correcting capability according to Nand Flash extra space |
| WO2013004494A1 (en) * | 2011-07-05 | 2013-01-10 | Robert Bosch Gmbh | Method for securely checking a code |
| CN102393890A (en) * | 2011-10-09 | 2012-03-28 | 广州大学 | Crypto chip system for resisting physical invasion and side-channel attack and implementation method thereof |
Non-Patent Citations (1)
| Title |
|---|
| 缩短BCH编码应用于无线传感网络的能效分析;李悍 等;《微处理机》;20100830(第4期);第33页第3节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104639179A (en) | 2015-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10135465B2 (en) | Error correction methods and apparatuses using first and second decoders | |
| KR100645058B1 (en) | Memory managing technique capable of improving data reliability | |
| US8560915B2 (en) | 2D product code and method for detecting false decoding errors | |
| US8806295B2 (en) | Mis-correction and no-correction rates for error control | |
| CN103187104B (en) | The error correction method of DRAM memory | |
| JP6388599B2 (en) | System, method, and program for decoding header sub-data set with non-uniform error protection | |
| KR20010067139A (en) | Recording/reproduction device, semiconductor memory, and memory card using the semiconductor memory | |
| WO2009102304A1 (en) | Method and system for detection and correction of phased-burst errors, erasures, symbol errors, and bit errors in a received symbol string | |
| KR102673629B1 (en) | Method for determining similarity between messages and apparatus for executing de-duplication of similar messages | |
| KR101819152B1 (en) | Method and associated decoding circuit for decoding an error correction code | |
| US20040133836A1 (en) | Method and apparatus for performing error correction code (ECC) conversion | |
| CN104393878A (en) | Apparatus and Method for Correcting at least one Bit Error within a Coded Bit Sequence | |
| CN104639179B (en) | Pass through the method for shortening code and detecting specific fault pattern of binary system primitive BCH code | |
| JP2010122828A (en) | Error judging circuit and shared memory system | |
| US6009550A (en) | PBA recovery apparatus and method for interleaved reed-solomon codes | |
| CN101848001B (en) | Data length expanding method of BCH (broadcast Channel) coding and decoding in Flash controller | |
| US11734107B2 (en) | Decoding scheme for error correction code structure | |
| US5943348A (en) | Method to check for burst limiting in error correcting systems | |
| CN105138412B (en) | The hybrid error correction apparatus and method of embedded microprocessor cache | |
| US5974582A (en) | High-speed chien search logic | |
| US20220345157A1 (en) | Multibyte error detection | |
| US7945843B2 (en) | Error correcting code | |
| Swart et al. | Prefixless q-ary balanced codes with ECC | |
| Mokara et al. | Design and implementation of hamming code using VHDL & DSCH | |
| WO2019140888A1 (en) | Protection method for error correcting code generator and check matrixes, and matrix storage/generation device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |