CN104639179A - Method for detecting special error modes by shortened codes of binary primitive BCH codes - Google Patents
Method for detecting special error modes by shortened codes of binary primitive BCH codes Download PDFInfo
- Publication number
- CN104639179A CN104639179A CN201310563744.XA CN201310563744A CN104639179A CN 104639179 A CN104639179 A CN 104639179A CN 201310563744 A CN201310563744 A CN 201310563744A CN 104639179 A CN104639179 A CN 104639179A
- Authority
- CN
- China
- Prior art keywords
- code
- codes
- error
- shortened
- bch
- 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.)
- Granted
Links
Landscapes
- Detection And Correction Of Errors (AREA)
Abstract
The invention discloses a method for detecting special error modes by shortened codes of binary primitive BCH codes and belongs to the field of error control codes and information safety. The method includes steps of selecting proper shortened codes of the BCH codes according to data units to be detected in the system; considering possible error modes of the fault environment and data which the system is faced with and enumerating the error modes; structuring the shortened parts of the BCH codes on the algorithm, so that the data and check codes are illegal codes when appearing in the error modes, and thus the error modes can be detected one hundred percent without affecting total error detection probability. Under the condition of guaranteeing error detection probability, special error modes caused by fault attack can be detected one hundred percent.
Description
Technical field
The present invention relates to error control coding and information security field, particularly relate to a kind of method that shorten code by binary system primitive BCH code detects specific fault pattern.
Background technology
1948, Shannon has in the paper of milestone significance at one section once to be proved, as long as the rate of information throughput is lower than channel capacity, by suitably encoding to information, when not sacrificing information transmission or memory rate, the mistake that noisy channel or storage media are introduced can be reduced to degree low arbitrarily.
In fact all error correcting codes are all based on a common general principle: redundancy be added in information, so that information of correcting contingent mistake in storage and transmission.
The subject matter of error correcting code discussion is exactly the paired channel encoder/decoder of Design and implementation, makes:
1) information can fast as far as possible under environment of making an uproar (or as far as possible high density) transmit (or record).
2) information can reliably be reappeared at the output of channel decoder.
3) cost realizing encoder and decoder is reduced in acceptable scope.
It is important and effectively correct the cyclic code of random error that Bo Si (Bose), Cha Dehuli (Chaudhuri) and Huo Kun lattice nurse (Hocquenghem) (BCH) code constitute a class, this kind of code is to the important popularization of the one of Hamming code, can be used for correcting multiple mistake.Because this yard has strict Algebraic Structure, so be the class code up to the present studied the most detailed, be most widely used, existing multiple decoding algorithm.
For any positive integer m (m>=3) and t (t<2
m-1), there is the binary BCH codes with following parameter:
Block length: n=2
m-1;
Parity check bit number: n-k≤mt;
Minimum range: d
min>=2t+1.
Be n=2 a length
min the grouping of – 1, this yard can be corrected t or be less than the combination in any of t mistake, claims this yard for entangling t wrong BCH code.The generator polynomial of this yard by it at galois field GF (2
m) on root determine.
Along with the development of information technology, the confidentiality and integrity of data receives increasing concern, after bypass attack (Side Channel Attacks) is suggested to, the transmission of information and storage not only need the mistake considering that random noise causes, and also should consider the mistake that fault attacks causes.
Error analysis utilizes error result to carry out analyzing the analytical technology drawing key information.In hardware defence error analysis measure, generally include EDC error detection and correction, error detection code comprises parity check code, cyclic redundancy check (CRC) code CRC etc.; Error correcting code has the function of EDC error detection and correction simultaneously, comprises Hamming code, BCH code, RS code etc.
The present invention pays close attention to the binary system primitive BCH code that memory often uses
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of method that shorten code by binary system primitive BCH code detects specific fault pattern, when ensureing error detection probability, 100% can detect special error pattern because fault attacks causes.
For solving the problems of the technologies described above, the shorten code by binary system primitive BCH code of the present invention detects the method for specific fault pattern, comprises the steps:
Step one, according to the shorten code needing the size of data cell detected to select suitable BCH code in system;
The error pattern that the failure environment faced and data may occur by step 2, consideration system is also enumerated out;
Step 3, algorithmically construct the part that is shortened of BCH code, making when these error patterns appear in data and check code is improper code, thus 100% can detect these error patterns, and does not affect total error detection probability.
The shorten code of the BCH code described in step one, if the grouping that the length of data and check code has met BCH code requires n=2
m-1(m is finite field gf (2
m) rank), namely shorten length be 0, then can by use finite field gf (2
m+1) construct the shorten code of BCH code.
The part that BCH code is shortened is constructed described in step 3, if error pattern is more and the part that BCH code is shortened is less, likely traversal BCH code is shortened all values partly and also cannot finds a shorten code that all error patterns can be become improper code, then can by finite field gf (2
m) rank increase to m+1 to re-construct the shorten code of BCH code.
Special error pattern is become illegal code word by the value that the present invention is shortened part by structure, thus can be detected by error detection circuit 100%, and special error pattern is become the value that illegal code word can be shortened part by structure and realize.
Accompanying drawing explanation
Below in conjunction with accompanying drawing and embodiment, the present invention is further detailed explanation:
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.
Embodiment
Below to use binary system primitive BCH code to realize introducing the present invention to the function of 32bits data error detection.
1, system needs to use BCH code to realize error detection function to each 32bits data cell in ROM and EEPROM, and the block length of BCH code need meet n=2
m-1 (m is finite field gf (2
m) rank), its codeword structure as shown in Figure 1, and 2
5-1<32+ check digit <2
6-1, so select finite field gf (2
6), primitive polynomial p (X)=X
6+ X+1.
2, owing to only needing to realize error detection function, so only need the check digit of 6bits; Block length is 2
6-1=63bits, actual needs 38bits, need to shorten 25bits, and shortening is that its codeword structure as shown in Figure 2 by using the part of code but not full detail bit realizes.
3, the BCH code shortened is linear code, is no longer cyclic code usually, but after suitably processing the bit be shortened, can uses same codec.
4, consider that the 38bits data cell in ROM and EEPROM may be become full 0 or complete 1 by fault, if it is full 0 that BCH code is shortened partial fixing, 38bits full 0 is legal-code, cannot be detected by error detection circuit; If it be complete 1,38bits complete 1 is legal-code that BCH code is shortened partial fixing, cannot be detected by error detection circuit.
5, the error detection function to 38bits full 0 and complete 1 will be realized, the check code of its 6bits when 32bits data are full 0 is made not to be full 0 with regard to needing the value being shortened part by structure, and the check code making its 6bits when 32bits data are complete 1 is not complete 1, namely makes 38bits full 0 and complete 1 belong to illegal code word.
6, experiment in find by the 25bits be shortened immediately the 1bit of 32bits data be set to 1, when all the other 24bits are set to 0, the check code of 32bits full 0 data is not full 0, the check code of complete 1 data of 32bits is not complete 1, so just achieve object 38bits full 0 and complete 1 being become illegal code word, 38bits full 0 and complete 1 also just can by error detection electric circuit inspection out.
Above by embodiment to invention has been detailed description, but these are not construed as limiting the invention.Without departing from the principles of the present invention, those skilled in the art also can make many distortion and improvement, and these also should be considered as protection scope of the present invention.
Claims (3)
1. detected a method for specific fault pattern by the shorten code of binary system primitive BCH code, it is characterized in that, comprise the steps:
Step one, according to the shorten code needing the size of data cell detected to select suitable BCH code in system;
The error pattern that the failure environment faced and data may occur by step 2, consideration system is also enumerated out;
Step 3, algorithmically construct the part that is shortened of BCH code, making when these error patterns appear in data and check code is improper code, thus 100% can detect these error patterns, and does not affect total error detection probability.
2. the method for claim 1, is characterized in that: the shorten code of the BCH code described in step one, if the grouping that the length of data and check code has met BCH code requires n=2
m-1, then by using finite field gf (2
m+1) construct the shorten code of BCH code; Wherein, m is finite field gf (2
m) rank.
3. the method for claim 1, it is characterized in that: described in step 3, construct the part that BCH code is shortened, when travel through BCH code be shortened part all values also cannot find all error patterns can be become a shorten code of improper code time, then by finite field gf (2
m) rank increase to m+1 to re-construct the shorten code of BCH code.
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 true CN104639179A (en) | 2015-05-20 |
| CN104639179B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108347250A (en) * | 2017-01-23 | 2018-07-31 | 合肥高维数据技术有限公司 | Fast encoding method and equipment suitable for a small amount of redundancy Reed Solomon code |
| CN109643111A (en) * | 2016-08-25 | 2019-04-16 | 宁波吉利汽车研究开发有限公司 | For detecting the method and system of the failure in vehicle control system |
| CN111147489A (en) * | 2019-12-26 | 2020-05-12 | 中国科学院信息工程研究所 | 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 (2)
| Title |
|---|
| 李悍 等: "缩短BCH编码应用于无线传感网络的能效分析", 《微处理机》 * |
| 郑秋梅 等: "《计算机组成原理》", 31 July 2012, 中国石油大学出版社 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109643111A (en) * | 2016-08-25 | 2019-04-16 | 宁波吉利汽车研究开发有限公司 | For detecting the method and system of the failure in vehicle control system |
| CN108347250A (en) * | 2017-01-23 | 2018-07-31 | 合肥高维数据技术有限公司 | Fast encoding method and equipment suitable for a small amount of redundancy Reed Solomon code |
| CN108347250B (en) * | 2017-01-23 | 2021-08-03 | 合肥高维数据技术有限公司 | Fast coding method and apparatus suitable for small amount of redundant Reed-Solomon codes |
| CN111147489A (en) * | 2019-12-26 | 2020-05-12 | 中国科学院信息工程研究所 | Link camouflage-oriented fishfork attack mail discovery method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104639179B (en) | 2018-08-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9577673B2 (en) | Error correction methods and apparatuses using first and second decoders | |
| US9787329B2 (en) | Efficient coding with single-error correction and double-error detection capabilities | |
| US8694872B2 (en) | Extended bidirectional hamming code for double-error correction and triple-error detection | |
| US8806295B2 (en) | Mis-correction and no-correction rates for error control | |
| US20100299575A1 (en) | Method and system for detection and correction of phased-burst errors, erasures, symbol errors, and bit errors in a received symbol string | |
| US20110099452A1 (en) | 2D Product Code and Method for Detecting False Decoding Errors | |
| CN105247793A (en) | Miscorrection detection for error correcting codes | |
| EP2438511B1 (en) | A method of identifying and protecting the integrity of a set of source data | |
| KR102673629B1 (en) | Method for determining similarity between messages and apparatus for executing de-duplication of similar messages | |
| US8806308B2 (en) | Bose-Chaudhuri-Hocquenghem (BCH) decoder | |
| US20040133836A1 (en) | Method and apparatus for performing error correction code (ECC) conversion | |
| Singh et al. | A comparative study of error detection and correction coding techniques | |
| Tallini et al. | On L 1-distance error control codes | |
| KR20170035795A (en) | Method and associated decoding circuit for decoding an error correction code | |
| CN104639179B (en) | Pass through the method for shortening code and detecting specific fault pattern of binary system primitive BCH code | |
| Murata et al. | Performance analysis of CRC codes for systematic and nonsystematic polar codes with list decoding | |
| US11050440B2 (en) | Encoder, decoder, encoding method and decoding method based on low-density parity-check code | |
| US5943348A (en) | Method to check for burst limiting in error correcting systems | |
| US5974582A (en) | High-speed chien search logic | |
| US20220345157A1 (en) | Multibyte error detection | |
| Mokara et al. | Design and implementation of hamming code using VHDL & DSCH | |
| Swart et al. | Prefixless q-ary balanced codes with ECC | |
| CN111752747A (en) | Memory security verification method for enhancing error detection capability | |
| CA3098884A1 (en) | Message correction and dynamic correction adjustment for communication systems | |
| Singh et al. | Improving performance parameters of error detection and correction in hdlc protocol by using hamming method |
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 |