← Back to Patent Explorer
US4949293A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for computing residue with respect to arbitrary modulus

Assignee: Toshiba Corp
•
Filing: 1988-09-23
•
Granted: 1990-08-14
•
Expires: 2008-09-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for computing a residue of a modulo-"a" number with respect to an arbitrary modulus, which require only a small memory capacity for the residue tables. The method obtains the residue by the iteration of dividing the modulo-"a" number into partitioned blocks of predetermined sizes and a remaining portion, finding the residues for partitioned blocks of the modulo-"a" number in the prepared residue table, and summing the remaining portion and the residues of the partitioned blocks with significant positions appropriately aligned. The apparatus for performing the method is also disclosed.

Inventors

  • 👤 Shinichi Kawamura
  • 👤 Kyoko Takabayashi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 20:52
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/14; H03M7/18; G; G06; G06F; G06F7/00; G06F7/60; G06F7/72

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 231 words
An apparatus for computing a residue R of an m-digit number M with respect to a q-digit modulus N, where both M and N are represented using an integer "a" as a radix, comprising: shift register means for temporarily holding said number M; memory means for storing at most a b different residues with respect to said modulus N, where b is a predetermined number; latch means for partitioning said number M in a shift register means into a b-digit block X obtained by separating b most significant digits of said number M, and a remaining portion Z of (m-b) digits; means for finding a residue Rx corresponding to said block X with respect to said modulus N by looking up in said memory means; means for aligning a least significant digit of said residue Rx with a q-th most significant digit of said remaining portion Z; adder means for obtaining a number Rq by adding said residue Rx and said remaining portion Z as aligned by said aligning means; means for determining whether said number Rq has more than q+b digits; means for taking said number Rq as a residue R of said number M when said number Rq has not more than q+b digits; and means for replacing said number M in said shift register means by said number Rq when said number Rq has more than q+b digits.
Claim 2
Independent Claim 231 words
An apparatus for computing a residue R of an m-digit number M with respect to a q-digit modulus N, where both M and N are represented using an integer "a" as a radix, comprising: shift register means for temporarily holding said number M; memory means for storing at most a b different residues with respect to said modulus N, where b is a predetermined number; latch means for partitioning said number M in a shift register means into a b-digit block X obtained by separating b most significant digits of said number M, and a remaining portion Z of (m-b) digits; means for finding a residue Rx corresponding to said block X with respect to said modulus N by looking up in said memory means; means for aligning a least significant digit of said residue Rx with a q-th most significant digit of said remaining portion Z; adder means for obtaining a number Rq by adding said residue Rx and said remaining portion Z as aligned by said aligning means; means for determining whether said number Rq has more than q+b digits; means for taking said number Rq as a residue R of said number M when said number Rq has not more than q+b digits; and means for replacing said number M in said shift register means by said number Rq when said number Rq has more than q+b digits.
Claim 3
Independent Claim 253 words
An apparatus for computing a residue R of an m-digit number M with respect to a q-digit modulus N, where both M and N are represented using an integer a as a radix, comprising: shift register means for temporarily holding said number M; memory means for storing precomputed s-digit residues of at most k*a b/k different numbers with respect to said modulus N, where s, b and k are predetermined numbers; latch means for partitioning said number M in a shift register means into a block X of b digits obtained by separating b most significant digits of said number M, and a remaining portion Z of (q-b) digits, where b is a number equal to s times k; means for partitioning said block X into k sub-blocks Xi(i=1, . . . , k), each of s digits; means for finding residues Ri corresponding to said sub-blocks Xi with respect to said modulus N by looking in said memory means; means for aligning least significant digits of said residues Ri with a q-th most significant digit of said remaining portion Z; adder means for obtaining a number Rq by adding said residues Ri and said remaining portion Z as aligned by said aligning means; means for taking said number Rq as a residue R of said number M when said number Rq has not more than q+b digits; and means for replacing said number M in said shift register means by said number Rq when said number Rq has more than q+b digits.
Claim 4
Independent Claim 253 words
An apparatus for computing a residue R of an m-digit number M with respect to a q-digit modulus N, where both M and N are represented using an integer a as a radix, comprising: shift register means for temporarily holding said number M; memory means for storing precomputed s-digit residues of at most k*a b/k different numbers with respect to said modulus N, where s, b and k are predetermined numbers; latch means for partitioning said number M in a shift register means into a block X of b digits obtained by separating b most significant digits of said number M, and a remaining portion Z of (q-b) digits, where b is a number equal to s times k; means for partitioning said block X into k sub-blocks Xi(i=1, . . . , k), each of s digits; means for finding residues Ri corresponding to said sub-blocks Xi with respect to said modulus N by looking in said memory means; means for aligning least significant digits of said residues Ri with a q-th most significant digit of said remaining portion Z; adder means for obtaining a number Rq by adding said residues Ri and said remaining portion Z as aligned by said aligning means; means for taking said number Rq as a residue R of said number M when said number Rq has not more than q+b digits; and means for replacing said number M in said shift register means by said number Rq when said number Rq has more than q+b digits.

References Cited (Backward Citations)

US3980874A Cited
US4538237A Cited
US4538238A Cited
US4555769A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-08-13 1994-02-12 1994-08-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-08-13 1998-02-12 1998-08-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-08-13 2002-02-12 2002-08-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag