17808631. COMPUTER-BASED VERIFICATION OF MODULAR CORRECTIONS OF MULTIPLE LINEAR OPERATIONS IN PARALLEL simplified abstract (INTERNATIONAL BUSINESS MACHINES CORPORATION)

From WikiPatents
Jump to navigation Jump to search

COMPUTER-BASED VERIFICATION OF MODULAR CORRECTIONS OF MULTIPLE LINEAR OPERATIONS IN PARALLEL

Organization Name

INTERNATIONAL BUSINESS MACHINES CORPORATION

Inventor(s)

Yvo Thomas Bernard Mulder of Reutingen (DE)

Michael Johannes Jaspers of Eindhoven (NL)

Silvia Melitta Mueller of St. Ingbert (DE)

Ulrich Mayer of Weil im Schoenbuch (DE)

COMPUTER-BASED VERIFICATION OF MODULAR CORRECTIONS OF MULTIPLE LINEAR OPERATIONS IN PARALLEL - A simplified explanation of the abstract

This abstract first appeared for US patent application 17808631 titled 'COMPUTER-BASED VERIFICATION OF MODULAR CORRECTIONS OF MULTIPLE LINEAR OPERATIONS IN PARALLEL

Simplified Explanation

The abstract describes a method for generating test data to verify a modular correction of a modular multiplication performed by a multiplier unit for very wide operands. The method involves performing a modular multiplication by correcting a binary multiplication of two operands using a coarse-grained and a fine-grained correction.

  • The multiplier unit performs a modular multiplication by correcting a binary multiplication of two operands using a coarse-grained and a fine-grained correction.
  • The computer selects adjacent intervals of the intermediate result and defines a sub-interval closely around a boundary between the adjacent intervals.
  • The computer selects a value in the sub-interval and uses a factorization algorithm to determine operands A' and B' for the value V.
  • The computer repeatedly determines A' plus varying ε-values as A" values and determines B" values to ensure the modular multiplication corrected by the coarse-grained correction is in the sub-interval.

Potential applications of this technology:

  • Testing and verification of modular multiplication performed by multiplier units for very wide operands.
  • Development and improvement of modular correction algorithms for efficient and accurate modular multiplication.

Problems solved by this technology:

  • Ensures the accuracy and correctness of modular multiplication performed by multiplier units for very wide operands.
  • Provides a method for generating test data to verify the modular correction of modular multiplication.

Benefits of this technology:

  • Increases the reliability and efficiency of modular multiplication in computer systems.
  • Enables the development of more advanced and accurate modular correction algorithms.
  • Facilitates the testing and verification process for modular multiplication in multiplier units.


Original Abstract Submitted

Generation of test data for verifying a modular correction of a modular multiplication performed by a multiplier unit for very wide operands includes performing, by a multiplier unit using a computer, a modular multiplication by correcting a binary multiplication of two operands by a coarse-grained and a fine-grained correction. The computer selects adjacent intervals of the intermediate result, defines a sub-interval closely around a boundary between the adjacent intervals, and selects a value in the sub-interval. Moreover, the computer uses a first factorization algorithm for the value V for determining operands A′, B′, where the modular multiplication result of the operands corrected by the coarse-grained correction is in the sub-interval. The computer repeatedly determines A′ plus varying ε-values as A″ values, and determines B″ values, so that the modular multiplication corrected by the coarse-grained correction is in the sub-interval.

Retrieved from "http://wikipatents.org/index.php?title=17808631._COMPUTER-BASED_VERIFICATION_OF_MODULAR_CORRECTIONS_OF_MULTIPLE_LINEAR_OPERATIONS_IN_PARALLEL_simplified_abstract_(INTERNATIONAL_BUSINESS_MACHINES_CORPORATION)&oldid=17656"