Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

22 results about "Irreducible polynomial" patented technology

In mathematics, an irreducible polynomial (or prime polynomial) is, roughly speaking, a non-constant polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field or ring to which the coefficients of the polynomial and its possible factors are supposed to belong.

A method for constructing Golomb Costas sequences based on high-order extension fields

The present invention discloses a method for constructing a Golomb Costas sequence based on a high-order spread domain, which belongs to the field of wireless communication technology. The method comprises the following steps: determining the order N of the Golomb Costas sequence to be constructed; and determining the order N of the Golomb Costas sequence to be constructed according to N=p. n ‑2, determine p, n, where p is a prime number and n is a positive integer, and explicitly state the extended field GF (p n ); select an irreducible polynomial of degree n with a leading coefficient of 1 on the prime field GF(p) as f(x), and clearly expand the field GF(p n ) in the form of elements, define the extended field GF(p n ) two binary operations on elements in the GF(p n ) primitive elements and their powers, and list the powers of primitive elements; in the extended field GF(p n ) selects two primitive elements; calculates the placement coordinates and completes the construction of the Golomb Costas sequence. The present invention calculates the primitive elements of the extended domain and their powers by calling functions such as get_combins(p,n), modBKY(p,n,BY,BKY,res) and calc(p,n,BKY,res_product), and according to the construction formula of the Golomb Costas sequence and by searching the extended domain GF(p n ) list of powers of primitive elements, quickly calculate the placement coordinates of the Golomb Costas sequence, reduce the workload of manual calculations, and improve the efficiency of constructing high-order Golomb Costas sequences based on extended domains. At the same time, it ensures the correctness of the calculation of the placement coordinates of the Golomb Costas sequence, solving the difficult problem of constructing Golomb Costas sequences based on high-order extended domains.
Owner:NANJING UNIV OF POSTS & TELECOMM

A multifunctional quantum random number platform architecture system and usage method

The present invention discloses a multifunctional quantum random number platform architecture system and a method of use, which relates to the field of quantum information. The platform architecture system includes a random number generator cluster, a random number storage module, a functional module and a data service management module connected in sequence. The method of use of the platform architecture system includes step 1: user terminal registration; step 2: user terminal login and sending a request; step 3: the data service management module sends the request to the functional module, and the functional module pulls the random number; step 4: the functional module processes the random number and sends the processing result to the user terminal. The present invention solves the problem of the difficulty in obtaining current quantum random numbers and irreducible polynomials developed from quantum random numbers. The quantum random number platform architecture system of the present invention is multifunctional and integrates four functional services of random numbers, irreducible polynomials, keys and model simulation.
Owner:MATRICTIME DIGITAL TECH CO LTD

Decoding method, encoding method, device, chip and computing device

The application provides a decoding method, an encoding method, a device, a chip and a computing device. The method comprises the following steps: a decoding device acquires a first matrix, and then decodes a first code word vector according to the first matrix to obtain a decoding result. The first matrix is a 0-1 matrix representing elements in a second matrix on a polynomial ring. The second matrix is a check matrix on a finite field 2q, and the number of rows is r and the number of columns is n. A first polynomial corresponding to the polynomial ring is a q-th irreducible polynomial on a binary field. The number of 1s in the first matrix is less than the number of 1s in the 0-1 matrix representation of the second matrix. The first code word vector comprises k information code elements and r check code elements, and n=k+r. Each code element comprises q data units, and each data unit comprises at least one bit. The scheme can effectively reduce the hardware implementation complexity and cost of RS encoding and decoding.
Owner:HUAWEI TECH CO LTD

Data coding method and related device

The embodiment of the invention provides a data coding method, which comprises the following steps: acquiring a target matrix which is a check matrix or a generator matrix and is a binary matrix representing data units of a finite field 2a on a polynomial ring, the polynomial corresponding to the polynomial ring is an irreducible polynomial of which the highest number of times is not greater than a; according to the target matrix, encoding a data block to obtain an encoding result; wherein the coding result is used as a redundant data block of the data block; or the coding result is a recovery result of the data block of the node where the coding result is located. In the embodiment of the invention, one irreducible polynomial can be selected as the polynomial corresponding to the polynomial ring, so that the data unit of the finite field 2a can be converted to the corresponding polynomial ring to be expressed, and then the exclusive or operation equivalent to the multiplication operation can be carried out through the data expressed on the basis of the polynomial ring. And the calculation overhead is reduced.
Owner:HUAWEI TECH CO LTD

Processing method and related device for modular index data generation task

The application discloses a processing method for a modulus exponent data generation task and related devices, wherein a classical computing unit constructs a quantum circuit for calculating a modulus exponent operation result of an input modulus and exponent in GF(2 k ) based on a preset irreducible polynomial, a base and a LUP decomposition method; and sends the exponent and the quantum circuit to a quantum computing unit; the quantum computing unit excites a quantum bit to an initial quantum state based on the exponent, drives the quantum bit to evolve from the initial quantum state based on the quantum circuit, obtains a measurement result of the quantum bit, and sends the measurement result to the classical computing unit; and the classical computing unit determines and outputs the modulus exponent operation result based on the measurement result; the quantum circuit is constructed by the irreducible polynomial, the base and the LUP decomposition method, and the exponent is taken as an input of the quantum circuit, so that the modulus exponent data in GF(2 k ) is efficiently generated, and classical encryption algorithms are accelerated to be cracked.
Owner:ORIGIN QUANTUM COMPUTING TECH (HEFEI) CO LTD

An authentication encryption method

The application discloses an authentication encryption method, which shares random numbers and irreducible polynomial determination algorithms in a safe way, guarantees that both authentication parties share preset random irreducible polynomials, eliminates security loopholes caused by the cumulative failure probability of multiple rounds of authentication, and can replace the preset random irreducible polynomials by regularly replacing the random numbers in the later period; the absolute safe first key string and the second key string are shared in a safe way, the first key string and the preset irreducible polynomial are used to generate a LFSR hash matrix to generate a message authentication code, and the second key string is used for one-time one-encryption or decryption of the message, which theoretically provides the information theory security that can resist all existing attacks, and guarantees the confidentiality, integrity and authenticity of the information.
Owner:NANJING UNIV +1

Generation method of finite field irreducible polynomial, electronic equipment and storage medium

The invention discloses a finite field irreducible polynomial generation method, electronic equipment and a storage medium, and the method comprises the steps: selecting a base field GF (p), and constructing the self-isomorphic mapping of the base field GF (p); determining an irreducible approximate type and an AS polynomial based on self-isomorphic mapping, and solving an equation Xp-X-alpha = 0 to obtain a root a; generating a first irreducible polynomial f based on the irreducible approximate type IS and the root a, and constructing an algebraic expansion domain L of the base domain GF (p); selecting a random element on the algebraic expansion domain L through a quantum random number, and generating a minimum polynomial g; and generating a polynomial gx based on the minimum polynomial g, finally verifying whether the polynomial gx is an irreducible polynomial, and if yes, outputting the irreducible polynomial. According to the method, the probability that the constructed polynomial is an irreducible polynomial can be greatly improved; and meanwhile, real randomness is realized by utilizing quantum random characteristics, so that the method is further used for quickly constructing a hash function, and a basis is provided for unconditional quantum security.
Owner:MATRICTIME DIGITAL TECH CO LTD

Parallelized, Scalable Linear Feedback Shift Register

The present invention provides a parallelized and scalable linear feedback shift register. The register is defined in a finite field GF(2 m ), including: n = 2 × k register units, the register units include: even-numbered register units #imgabs0# and odd-numbered register units #imgabs1#, and the odd-numbered register units store values ​​#imgabs2# and k irreducible polynomials g k‑1 (x),…,the root (α k‑1 ,…,α0) is XORed with the permutation σ of the stored value #imgabs3# in the even-numbered register unit, and the result is used as the stored value #imgabs4# in the odd-numbered register unit at the next moment. The stored value #imgabs5# in the odd-numbered register unit at the previous moment is used as the stored value #imgabs6# in the even-numbered register unit at the next moment. The linear feedback shift register provided by the present invention is highly parallelizable and efficient, and is particularly suitable for software implementation in modern CPUs that support vector calculations.
Owner:BEIJING ACAD OF INFORMATION SCI & TECH

A Generation Method of Dynamic S-Box Based on Chaos and Irreducible Polynomials

The present invention discloses a method for generating a dynamic S-box based on chaotic mapping and irreducible polynomials, which relates to the fields of chaotic cryptography and image encryption. The method specifically includes: S1: Serializing the plaintext; S2: Selecting a number of irreducible polynomials over the GF(2<supgt;^8< / supgt;) field, and using the iterative results of the Logistic chaotic mapping to select irreducible polynomials to participate in the calculation; Modifying the model formula of the Arnold mapping into a one-dimensional formula, optimizing the one-dimensional formula to obtain the S-box generation formula, and combining the selected irreducible polynomials with the S-box generation formula to generate the S-box; S3: Generating an extended key with the S-box; S4: Encrypting the plaintext sequence with the key; S5: Replacing the encrypted sequence with the S-box; S6: Changing the positions of the ciphertext sequence; S7: Iterating the operations of S2-S6 for 15 rounds. The dynamic S-box generated by the present invention can meet the requirements of the block encryption algorithm for the S-box, especially the performance requirements and time requirements of the image encryption algorithm for the S-box.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Configurable vectoring modular multiplier

The invention discloses a configurable vectoring modular multiplier, comprising a plurality of modular multiplication units, each modular multiplication unit comprising: an input module for receiving a first input signal, a second input signal, a third input signal and a control signal; the first input signal is a first coefficient corresponding to the column number of the modular multiplication unit in the first polynomial; the second input signal is a second coefficient corresponding to the line number of the modular multiplication unit in a second polynomial; the third input signal is a third coefficient corresponding to the line number of the modular multiplication unit in the irreducible polynomial; the multiplication and addition module is used for performing vectorization multiplication and addition on an output vector, a second input signal and a first input signal according to bit block circulation, calling an update function to perform reduction operation on the output vector and a third input signal, and performing reduction operation on the output vector and the third input signal by the update function according to a control signal; and the output module is used for outputting the output vector outwards. According to the method, the dynamic MDS matrix vector multiplication can be efficiently supported without redundancy.
Owner:TSINGHUA UNIVERSITY

A data processing method and related apparatus

This application provides a data processing method and related apparatus. The method includes: generating a random irreducible polynomial corresponding to a target finite field using a target S-box in a target cryptographic algorithm; determining multiple linearly independent target elements using each element in the target finite field to form a random basis corresponding to the target finite field; generating a random S-box different from the target S-box using the random irreducible polynomial and the random basis; sending the random S-box to a data terminal for subsequent data processing of the data to be processed based on the target cryptographic algorithm, changing the target S-box to a random S-box, and obtaining the data processing result of the data to be processed. Compared with evolutionary algorithms, this method has lower computational complexity, reduces the consumption of computing resources, and lowers the computational load on the processor. Even in data processing scenarios based on target cryptographic algorithms with limited computing resources, it improves the security of data processing based on target cryptographic algorithms and ensures message security.
Owner:TENCENT TECHNOLOGY (SHENZHEN) CO LTD +1

Large-bit-width-oriented LFSR construction method and system

The invention discloses a large-bit-width-oriented LFSR construction method and system, and relates to the password and data security technology, and the method comprises the steps: configuring the internal state of the t-th step of a linear feedback shift register (LFSR) and an update function of the LFSR, and determining the state update of the LFSR according to the internal state and the update function; updating and selecting l m-level irreducible polynomials according to the state of the LFSR; calculating corresponding bit transformation matrixes according to the root of the irreducible polynomial, and calculating a diagonal matrix according to each bit transformation matrix; selecting l-dimensional permutation sigma, and constructing a block matrix formed by l * l m-dimensional matrixes according to the permutation sigma; and constructing a matrix G based on the block matrix and a unit matrix with a set dimension, and outputting the matrix G as a state transition matrix of the LFSR under the condition that a characteristic polynomial of the matrix G is a primitive polynomial. The method supports parallel computing, and has lower computing complexity and software and hardware implementation cost than LFSR in LOL.
Owner:NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP

A system for generating irreducible polynomials and hashing algorithms based on FPGA

The present invention discloses a system for generating irreducible polynomials and hash algorithms based on an FPGA, relating to the field of information security. The system includes an irreducible polynomial unit and a hash algorithm unit. After detecting a flag data bit indicating the start of transmission, the system extracts irreducible polynomial parameters and inputs them into the irreducible polynomial unit. The irreducible polynomial unit then judges the irreducible polynomial parameters. Irreducible polynomial parameters that meet the requirements are input into the hash algorithm unit. The irreducible polynomial parameters, a key, and data to be encrypted are calculated by the hash algorithm unit to ultimately output a hash value. The system can not only quickly generate irreducible polynomials, but also quickly, securely, and efficiently implement hash algorithm encryption based on the irreducible polynomials.
Owner:MATRICTIME DIGITAL TECH CO LTD

Decoding method and apparatus, encoding method and apparatus, and chip and computing device

PCT designated stageWO2026130089A1Cyclic codesDecoding methodsCheck digit
Provided in the present application are a decoding method and apparatus, an encoding method and apparatus, and a chip and a computing device. The decoding method comprises: a decoding apparatus acquiring a first matrix, and then decoding a first codeword vector on the basis of the first matrix to obtain a decoding result, wherein the first matrix is a 0-1 matrix in which elements in a second matrix are represented on a polynomial ring, the second matrix is a check matrix having r rows and n columns on a finite field 2q, a first polynomial corresponding to the polynomial ring is an irreducible polynomial of a degree q on a binary field, and the number of "1"s in the first matrix is less than the number of "1"s in a 0-1 matrix representation of the second matrix; and the first codeword vector comprises k information symbols and r check symbols, where n=k+r, each symbol comprises q data units, and each data unit comprises at least one bit. The solution of the present application can effectively reduce the hardware implementation complexity and overheads of RS encoding and decoding.
Owner:HUAWEI TECH CO LTD

Construction method and system of homomorphic friendly S box

The invention discloses a homomorphic friendly S box construction method and system, and relates to the communication encryption technology, and the method comprises the steps: determining the feature size of a finite field # imgabs0 #; randomly selecting a non-zero constant alpha on a finite field # imgabs 1 #; selecting an irreducible polynomial f (x) on any field according to the determined finite field # imgabs2 # under the condition that q is equal to 2n, determining that addition and multiplication on the finite field # imgabs3 # are exclusive-or operation and multiplication on the field # imgabs4 # respectively, and determining that addition and multiplication on the finite field # imgabs5 # are modular p addition and modular p multiplication respectively under the condition that q is a prime number p; and executing specified mathematical operation on any input # imgabs6 # to obtain an output # imgabs7 # as a constructed homomorphic friendly S box. On the basis of a 4-branch generalized Feistel cryptographic structure, the round operation comprises multiplication and addition (q is a prime number p or a power 2n of 2) on a large feature finite field # imgabs8 #, four rounds of iteration are carried out on the round operation, and finally a homomorphic friendly S box is generated.
Owner:NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP

A quantum-safe digital signature verification method and system

The present application relates to the field of network information security technology, and specifically to a quantum-safe digital signature verification method and system. Specifically, the digital signature verification method introduces a one-time identity associated with the privacy identity of the user unit, thereby adding a new variable each time a signature is made, and then a one-time one-key signature is performed through a hash function based on a linear shift register, and further relies on an irreducible polynomial of a first quantum random number and a second quantum random number to jointly ensure the security of the signature, so that the security of the digital signature process reaches a quantum security level, and can resist increasingly powerful classical computing attacks and future disruptive quantum computing attacks. In the signature verification link, on the one hand, the integrity of the business information is verified based on the hash function of the linear shift register; on the other hand, the relevance and legitimacy are verified based on the one-time identity to ensure the non-repudiation of the user's digital signature.
Owner:MATRICTIME DIGITAL TECH CO LTD

Data encoding method and related apparatus

Provided in the embodiments of the present application is a data encoding method, comprising: acquiring a target matrix, the target matrix being a check matrix or a generator matrix, the target matrix being a binary matrix which represents a data unit of a finite field 2a on a polynomial ring, and a polynomial corresponding to the polynomial ring being an irreducible polynomial of which the highest degree is not greater than the a; and encoding a data block according to the target matrix to obtain an encoding result, wherein the encoding result is used as a redundant data block of the data block, or the encoding result is a recovery result for a data block of a node where same is located. In the embodiments of the present application, an irreducible polynomial can be selected as a polynomial corresponding to the polynomial ring, such that the data unit of the finite field 2a can be converted to be represented on the corresponding polynomial ring, and then an XOR operation equivalent to a multiplication operation can be performed by means of data based on the polynomial ring representation, thus reducing computational overheads.
Owner:HUAWEI TECH CO LTD

Method for processing a modulus squared data generation task and related apparatus

The application discloses a processing method of a modulo square data generation task and related devices, wherein a classical computing unit constructs a quantum circuit for calculating a modulo square operation result of input data in GF(2 k ) based on a preset irreducible polynomial and a LUP decomposition method, and sends the input data and the quantum circuit to a quantum computing unit; the quantum computing unit excites a quantum bit to an initial quantum state based on the input data, and drives the quantum bit to evolve from the initial quantum state based on the quantum circuit to obtain a measurement result of the quantum bit; the measurement result is sent to the classical computing unit; and the classical computing unit determines and outputs the modulo square operation result based on the measurement result, thereby realizing efficient generation of modulo square data in GF(2 k ), and further realizing acceleration of cracking of a classical encryption algorithm.
Owner:ORIGIN QUANTUM COMPUTING TECH (HEFEI) CO LTD

System and method for preventing quantum security key relay encryption from counterfeiting ciphertext

The invention discloses a system and a method for preventing quantum security key relay encryption from counterfeiting a ciphertext. After receiving the ciphertext data, a receiving end can obtain an irreducible polynomial and an anti-counterfeiting true random number which are agreed in advance based on a session index carried in the ciphertext data, determines a topological matrix according to the irreducible polynomial and the anti-counterfeiting true random number, and obtains the anti-counterfeiting true random number through the topological matrix. Hash calculation is carried out on the session index, the pairing index and the packet sequence number to generate an anti-counterfeiting Hash value H ', and a receiving end compares the H' with the anti-counterfeiting Hash value H carried in the ciphertext data to quickly determine whether the ciphertext data is a forged ciphertext or not, so that the forged message is prevented from occupying encryption and decryption resources for a long time to influence the safety and efficiency of the receiving end. And the anti-counterfeiting hash value not only contains the feature information of the current session, but also integrates the randomness of the irreducible polynomial and the anti-counterfeiting true random number, so that a counterfeiter is difficult to generate an effective hash value only through a pure algorithm attack mode.
Owner:MATRICTIME DIGITAL TECH CO LTD

Channel coding method based on binary sequence and related device

The embodiment of the invention discloses a channel coding method based on a binary sequence and a related device, and the method comprises the steps: obtaining to-be-transmitted target data, and receiving an expansion frequency and an irreducible polynomial of a base domain; determining a minimum polynomial of a binary sequence according to the expansion times of the base domain and the irreducible polynomial; determining a generator polynomial of a cyclic code according to the minimum polynomial, and generating the cyclic code according to the generator polynomial; and performing channel coding on the target data according to the cyclic code. According to the embodiment of the invention, the reliability and anti-interference performance of channel transmission can be improved.
Owner:ANHUI AGRICULTURAL UNIVERSITY

Data encoding method and related apparatus

Provided in the embodiments of the present application is a data encoding method, comprising: acquiring a target matrix, the target matrix being a check matrix or a generator matrix, the target matrix being a binary matrix which represents a data unit of a finite field 2a on a polynomial ring, and a polynomial corresponding to the polynomial ring being an irreducible polynomial of which the highest degree is not greater than the a; and encoding a data block according to the target matrix to obtain an encoding result, wherein the encoding result is used as a redundant data block of the data block, or the encoding result is a recovery result for a data block of a node where same is located. In the embodiments of the present application, an irreducible polynomial can be selected as a polynomial corresponding to the polynomial ring, such that the data unit of the finite field 2a can be converted to be represented on the corresponding polynomial ring, and then an XOR operation equivalent to a multiplication operation can be performed by means of data based on the polynomial ring representation, thus reducing computational overheads.
Owner:HUAWEI TECH CO LTD