Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

36 results about "Modular inversion" patented technology

Method and apparatus for modular inversion for information security and recording medium with a program for implementing the method

Values X and N of n bits and a parameter t are input, then Y=X2−t mod N is calculated, then an extended binary GCD algorithm is executed for Y to obtain S=[[Y]] y−12k mod N and k, and R=S2−(k+t=2n) is calculated for S, thereby obtaining a Montgomery inverse R=X−122n mod N of X on a residue class ring Z / NZ.
Owner:NIPPON TELEGRAPH & TELEPHONE CORP

Modular photovoltaic grid-connected inverter structure

The invention discloses a modular photovoltaic grid-connected inverter structure which comprises more than one unit cabinet, wherein each unit cabinet comprises a modular inversion module, an electrical plate, a filtration system, a cabinet body heat dissipation fan and a cabinet body mechanism; the inversion modules are arranged at the upper parts of the cabinet body mechanisms; the electrical plates are fixed in the cabinet body mechanisms and are vertically arranged at the middle lower parts of the cabinet body mechanisms; the electrical plates are provided with standard configuration electrical regions and optional circuit electrical regions; the standard configuration electrical regions are high-voltage regions and comprise direct current input modules and alternating current output modules; the optional circuit electrical regions can select system control modules and/or alternating current main output modules according to demands; direct current filtration modules in the filtration systems are arranged on the back surface sides of the electrical plates; reactor modules in the filtration systems are arranged in rear spaces of the electrical plates side by side. The modular photovoltaic grid-connected inverter structure has the advantages of easiness in maintenance and repair, small size, modulation, high generality, low large-scale cost and the like.
Owner:CSR ZHUZHOU ELECTRIC LOCOMOTIVE RES INST

Element modular inversion calculation method and device

The invention is applicable to the technical field of computers and communication and provides an element modular inversion calculation method and device. The method comprises the steps that the initial values of temporary variables X1 and X2 and decreasing variables u and v are obtained, wherein the initial values of the temporary variables X1 and X2 are 1 and 0 respectively, and the initial values of the decreasing variables u and v are a and P0 respectively; the temporary variables X1 and X2 and the decreasing variables u and v are subjected to iterative computation, wherein the iteration process meets the equations: a*x1=u(mod P0), a*x2=v(mod P0); after each time of iteration is completed in the iterative computation, whether one of u and v is 1 is judged, if neither u nor v is 1, the iterative computation is continued, and if either u or v is 1, the iterative computation is ended; after the iterative computation is ended, if u is 1, X1 is assigned to X, and if v is 1, X2 is assigned to X; when K=0, whether X is greater than zero or not is judged, and if X is greater than zero, X is the modular inversion related to P. By means of the technical scheme, the element modular inversion calculation method and device have the advantages that the computing speed is high, and the number of required computing resources is small.
Owner:NATIONZ TECH INC

Unsigned processing method of modular inversion algorithm and modular inversion accelerator

The invention discloses an unsigned processing method of a modular inversion algorithm and a modular inversion accelerator. Based on the extended Euclidean algorithm in a public key cryptography algorithm, the subtraction operation in the condition 3 in the step 3 of the expanded Euclidean algorithm is replaced by the modular reduction operation. Related operation about temporary variables X2 andY2 in the condition 1 and the condition 2 in the step 3 of the expanded Euclidean algorithm is eliminated. The modular inversion accelerator comprises a bus port, an operation control layer, a data path and a memory port, which are successively connected. The operation control layer is formed by a modular inversion operation control module and a sub-operation module, which are mutually communicated. The data path is formed by an N-bit register and an N-bit summator, which are communicated to each other. In this way, a hardware circuit of the modular inversion algorithm is easy to achieve; theexpanded Euclidean algorithm is simplified; processing of symbols and carry bits in the process is eliminated; the two variables are eliminated; unnecessary operation and occupancy of a storage unit are reduced; and 1 / 3 of operation speed is increased.
Owner:杭州朔天科技有限公司

Elliptical digital signature curve hardware implementation method and system based on high-performance modular inversion

The invention provides an elliptic curve digital signature hardware implementation method and system based on high-performance modular inversion, and realizes a complete elliptic curve digital signature hardware scheme. The system comprises three parts: a signature verification control module, a scalar multiplication module and a bottom modular operation controller. According to the method, the Euclidean algorithm is improved and expanded to conform to the characteristics of hardware circuit operation, the cost of subtraction and large number comparison in hardware is avoided, multiple odd-even shift judgment in Montgomery modular inversion is not needed, and the method has the characteristics of high performance and low hardware cost. According to the method, point addition, point doubling, modular multiplication operation, modular addition operation, modular subtraction operation, modular inversion operation and other underlying operations are integrated to be called by a higher-layer module, and the improved modular inversion algorithm in the method is combined, so that underlying resource sharing of the whole system is realized, the calculation efficiency is improved, and a high-performance elliptic curved surface digital signature and signature verification system is realized under relatively low hardware overhead.
Owner:SOUTHEAST UNIV

Software and hardware collaborative segmented scanning type Montgomery modular exponentiation computing system and readable storage medium

PendingCN114138235AImplement modular exponentiationEfficient implementation of modular multiplication operationsComputations using residue arithmeticComputer architectureStatic random-access memory
The invention provides a soft and hard collaborative segmented scanning type Montgomery modular exponentiation calculation system. An ARM processor and FPGA resources are arranged in the SoC platform. The ARM end is mainly used for overall task scheduling and data preprocessing necessary for a system segmentation scanning algorithm. Storing the processed data into a specific address of an SRAM (Static Random Access Memory), and then starting an FPGA (Field Programmable Gate Array) for operation. The FPGA end realizes modular design and comprises an address generation module, a modular inversion module, a CIOS Montgomery modular multiplication module, a segmented scanning type Montgomery modular exponentiation control module and the like. According to the invention, 256-bit modular exponentiation is realized, a 6-bit segmented scanning mode is adopted, and data to be pre-processed is stored in an SRAM (Static Random Access Memory). Specifically, the Montgomery modular multiplication module is realized by adopting a CIOS algorithm, large-bit-width 256-bit multiplication is subjected to 64-bit splitting, the area consumption caused by the large-bit-width multiplication is reduced, meanwhile, the CIOS algorithm is optimized in the streamlined aspect, two original internal loops are subjected to streamlined processing, the two internal loops are completed only by increasing a small number of periods, and the execution efficiency is improved.
Owner:NANJING UNIV

High-throughput modular inversion calculation method and system in parallel environment

ActiveCN112799637AImprove throughputAlleviate the phenomenon of high concurrency mode reverse time warp differentiationDigital data protectionComputations using residue arithmeticData setAlgorithm
The invention belongs to the technical field of information security, and discloses a high-throughput modular inversion calculation method and system in a parallel environment. M to-be-inversed values (a1, a2, ..., am) and a modulus p are received, m modular inversion values are output, wherein the processes comprise three stages: a data division stage, a parallel inversion stage and a data group integration stage. The high-throughput modular inversion computing system in the parallel environment comprises a data division module based on parallel platform computing resources, a parallel inversion module based on a simultaneous modular inversion algorithm, a data set integration module based on a mapping relation and a performance analysis module based on a historical operation result. According to the method, the characteristic that modular inverse operation is converted into modular multiplication operation through the simultaneous modular inverse algorithm is utilized, so that the high-concurrency modular inverse time thread beam differentiation phenomenon is relieved, and the parallel simultaneous modular inverse algorithm is designed for solving the problem that the serial simultaneous modular inverse algorithm cannot give full play to all performance of a parallel platform. Therefore, the modular inverse operation throughput in the parallel environment is greatly improved.
Owner:XIDIAN UNIV

Modular inverse operating method and operational unit

The invention relates to a modulo inversion operation method and an arithmetic unit. The positive integers u and m are known, and u‑1modm is calculated. In the modular inverse operation method and arithmetic unit provided by the present invention, the algorithm only needs to add one flag bit, and at most one multiplication and two subtraction operations, which can greatly improve the operation speed, and has the characteristics of versatility and high efficiency in terms of hardware implementation; Compared with the existing binary extended Euclidean algorithm, there is no need to eliminate the weight factor of the operation result, and the modulus is not limited to be an odd number, and the modulus inverse operation of any non-zero integer can be realized, and Improve the computational efficiency of modular inverse operations and reduce hardware power consumption.
Owner:张家豪

Bridge arm voltage-sharing control method of modular multilevel resonant converter

The invention relates to a DC-DC conversion technology, and aims to provide a bridge arm voltage-sharing control method of a modular multilevel resonant converter. The modular multilevel resonant converter comprises a modular inversion circuit, a resonant network, a transformer, a rectifier and an output capacitor. Bridge arm voltage-sharing control is in a way that voltage amplitudes of an upperbridge arm and a lower bridge arm is balanced by adjusting DC components of middle-point voltages of the bridge arms. According to the voltage-sharing control method provided by the invention, the DCcomponents of the middle-point voltages of the bridge arms are controlled, the voltage distribution of the upper bridge arm and the lower bridge arm is automatically corrected by closed-ring control on the premise that a switch frequency is not adjusted, the voltage balance of the upper bridge arm and the lower bridge arm is maintained, and meanwhile, the normal working state of MMR is not changed. By the control method, the inductance values of the bridge arms are not needed to be adjusted by manual, the bridge arm voltage automatic balance of the modular multilevel resonant converter is achieved by control, and the converter is enabled to stably and reliably work.
Owner:ZHEJIANG UNIV

Double-domain elliptic curve dot product hardware accelerator

PendingCN111835517AImprove the efficiency of core operation dot multiplicationIncrease flexibilityPublic key for secure communicationComputer hardwareComputer architecture
A double-domain elliptic curve dot product hardware accelerator is divided into a modular operation layer and a point operation layer, wherein the modular operation layer comprises a prime number domain and binary domain modular modular reduction module, a multiplication module and a modular inversion module, and the point operation layer comprises a prime number field NAF dot product operation module and a multiple point and point addition and binary system field dot product module. The hardware accelerator is mounted on an equipment bus as slave equipment and is connected to a processor, andthe processor realizes different acceleration operation modes by configuring a function register in the hardware accelerator.
Owner:YICHIP MICROELECTRONICS (HANGZHOU) CO LTD

modular inverse operator

The invention provides a modular inverse operation method and an arithmetic device. The modular inversion operation method and the arithmetic device are used for calculating Z=Y<-1>mod X, wherein Z is a result of a modular inverse operation, X is a first operand and Y is a second operand. The modular inverse operation method comprises the following steps of calculating and acquiring a binary bit length Xlen of the first operand X and a binary bit length Ylen of the second operand Y; initializing a first variable R and a second variable S; when Xlen is greater than and equal to Ylen, calculating X <-1>modY; and when Xlen is smaller than and equal to Ylen, calculating Y <-1>modX. When the updated X is equal to 0 and the updated Y is equal to 1, a result of the modular inverse operation is the updated second variable S; when the updated X is equal to 1 and the updated Y is equal to 0, a result of the modular inverse operation is a difference between an X initial value and the updated first variable R; and when one of the updated X and the updated Y is equal to 0 and the other of the updated X and the updated Y is not equal to 1, a result of the modular inverse operation does not exist. By using the method and the arithmetic device, the modular inverse operation, in which the module is any non-zero integer can be realized, the calculation efficiency of the modular inverse operation is improved and the power consumption of hardware is reduced.
Owner:SHANGHAI FUDAN MICROELECTRONICS GROUP

Digital image encryption method and image decryption method based on modular inversion operation

ActiveCN110958458AThe classification method is simple and easyEasy to operateDigital video signal modificationInformation transmissionAlgorithm
The invention discloses a digital image encryption method based on modular inversion operation. The method comprises the following steps: giving an original image A, wherein the pixel point located atthe ith row and the jth column in the A are expressed as pi, j, all the pixel points with the value of i + j being an odd number are classified into a first type, and all the pixel points with the value of i + j being an even number are classified into a second type; performing modular inversion operation on all the pixel points of the first type or the second type, and replacing the original pixel value with the obtained modular inversion value to obtain an encrypted image A'; performing modular inversion operation on the pixel points obtained by performing modular inversion operation on thepixel points of the first type or the second type in the A according to the claim 1 in the A'; and replacing the original pixel value with the obtained modular inversion value to recover the originalimage A. The method for classifying the pixel points of the image is simple and easy to implement, the encryption operation of the pixel points is simple, extra information is not needed in the wholeencryption and recovery process, the image information transmission efficiency is high, and errors of individual pixel points cannot cause the diffusion phenomenon of errors.
Owner:李小平

Method and device for modular inverse calculation of elements

The invention is applicable to the technical field of computers and communication and provides an element modular inversion calculation method and device. The method comprises the steps that the initial values of temporary variables X1 and X2 and decreasing variables u and v are obtained, wherein the initial values of the temporary variables X1 and X2 are 1 and 0 respectively, and the initial values of the decreasing variables u and v are a and P0 respectively; the temporary variables X1 and X2 and the decreasing variables u and v are subjected to iterative computation, wherein the iteration process meets the equations: a*x1=u(mod P0), a*x2=v(mod P0); after each time of iteration is completed in the iterative computation, whether one of u and v is 1 is judged, if neither u nor v is 1, the iterative computation is continued, and if either u or v is 1, the iterative computation is ended; after the iterative computation is ended, if u is 1, X1 is assigned to X, and if v is 1, X2 is assigned to X; when K=0, whether X is greater than zero or not is judged, and if X is greater than zero, X is the modular inversion related to P. By means of the technical scheme, the element modular inversion calculation method and device have the advantages that the computing speed is high, and the number of required computing resources is small.
Owner:NATIONZ TECH INC

Point-adding and point-multiplying circuit based on binary extended domains and control method of point-adding and point-multiplying circuit

The invention discloses a point-adding and point-multiplying circuit based on binary extended domains and a control method thereof. The point-adding and point-multiplying circuit comprises a finite-state machine, a modular multiplication module, a modular square module, a modular addition module, a modular inversion module, a data register, a state register, a counting register and a control signal register. The finite-state machine is used for calling the modular multiplication module, the modular square module, the modular addition module and the modular inversion module, so that operationssuch as point addition, point multiplication and coordinate transformation are realized. Different modules can be repeatedly called; hardware redundancy may thus be reduced, hardware resources are fully utilized, and the circuit structure is simplified, so that the whole circuit consumes less clock period to work when executing each instruction, and finally, the effects of reducing the time cost of a calculation task, reducing the power consumption and the calorific value, increasing the cruising ability of the mobile terminal applying the point-adding and point-multiplying circuit and the like are achieved. The invention is widely applied to the technical field of circuits and systems.
Owner:SOUTH CHINA NORMAL UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products