# large integer

Also found in: Thesaurus, Wikipedia.
ThesaurusAntonymsRelated WordsSynonymsLegend:
 Noun 1 large integer - an integer equal to or greater than teninteger, whole number - any of the natural numbers (positive or negative) or zero; "an integer is a number that is not a fraction"10, ten, tenner, X, decade - the cardinal number that is the sum of nine and one; the base of the decimal system11, eleven, XI - the cardinal number that is the sum of ten and one12, dozen, twelve, XII - the cardinal number that is the sum of eleven and oneteens - all the numbers that end in -teen13, baker's dozen, long dozen, thirteen, XIII - the cardinal number that is the sum of twelve and one14, fourteen, XIV - the cardinal number that is the sum of thirteen and one15, fifteen, XV - the cardinal number that is the sum of fourteen and one16, sixteen, XVI - the cardinal number that is the sum of fifteen and one17, seventeen, XVII - the cardinal number that is the sum of sixteen and one18, eighteen, XVIII - the cardinal number that is the sum of seventeen and one19, nineteen, XIX - the cardinal number that is the sum of eighteen and one20, twenty, XX - the cardinal number that is the sum of nineteen and one21, twenty-one, XXI - the cardinal number that is the sum of twenty and one22, twenty-two, XXII - the cardinal number that is the sum of twenty-one and one23, twenty-three, XXIII - the cardinal number that is the sum of twenty-two and one24, twenty-four, two dozen, XXIV - the cardinal number that is the sum of twenty-three and one25, twenty-five, XXV - the cardinal number that is the sum of twenty-four and one26, twenty-six, XXVI - the cardinal number that is the sum of twenty-five and one27, twenty-seven, XXVII - the cardinal number that is the sum of twenty-six and one28, twenty-eight, XXVIII - the cardinal number that is the sum of twenty-seven and one29, twenty-nine, XXIX - the cardinal number that is the sum of twenty-eight and one30, thirty, XXX - the cardinal number that is the product of ten and three40, forty, XL - the cardinal number that is the product of ten and four50, fifty, L - the cardinal number that is the product of ten and five60, LX, sixty - the cardinal number that is the product of ten and six70, LXX, seventy - the cardinal number that is the product of ten and seven78, LXXVIII, seventy-eight - the cardinal number that is the sum of seventy and eight80, eighty, fourscore, LXXX - the cardinal number that is the product of ten and eight90, ninety, XC - the cardinal number that is the product of ten and nine100, hundred, one C, century, C - ten 10s144, gross - twelve dozen120, great hundred, long hundred - the cardinal number that is the product of ten and twelve500, five hundred, D - the cardinal number that is the product of one hundred and five1000, chiliad, grand, one thousand, thou, thousand, K, M, G, yard - the cardinal number that is the product of 10 and 1001728, great gross - a cardinal number equal to one dozen gross10000, ten thousand, myriad - the cardinal number that is the product of ten and one thousand100000, hundred thousand, lakh - the cardinal number that is the fifth power of ten1000000, meg, million, one thousand thousand - the number that is represented as a one followed by 6 zeroscrore - the number that is represented as a one followed by 7 zeros; ten million1000000000, one thousand million, billion - the number that is represented as a one followed by 9 zerosbillion, one million million, 1000000000000 - the number that is represented as a one followed by 12 zeros; in the United Kingdom the usage followed in the United States is frequently seen
Based on WordNet 3.0, Farlex clipart collection. © 2003-2012 Princeton University, Farlex Inc.
References in periodicals archive ?
The usual technique for squashing the decryption circuit amounts to homomorphically evaluating a large integer sum of the form Z01 [[summation].sub.[THETA].sub.i=1][s.sub.i][z.sub.i], where the [s.sub.i] are secret bits and the [z.sub.i] are public constants computed from the original ciphertexts and public parameters.
RSA Crypto-Algorithm is well-known and widely used public key cryptographic algorithm due to the prominent level of proven security which depends on the difficulty of large integer factorization problem.
For any sufficiently large integer n there exists an integer q = (2 - o(1)) [cn.sup.[alpha]] such that the remainder of the division of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] by q is larger than [cn.sup.[alpha]].
To make it possible to handle really large integer values, the C99 data type long long is introduced in this version.
The main objective of this work is to develop a methodology that combines the Benders decomposition and a heuristic for calculating the multiplier applied to a relaxed problem to solve a linear problem of large integer
--random generation of large integer values, which then are unfolded into the sequences of 0's and 1's according to the rules of the conversion of the decimal number to the binary number.
A large integer was stored digit-by-digit in the array named Digit in the data structure named bigInteger.
For sufficiently large integer n, let r be a positive integer such that: the set {1, 2, ..., r} can be partitioned into n classes such that no class contains integers x, y, z with [x.sup.y] = z.
To make this idea precise, take a covering f: X [right arrow] X[prime] so that [f.sup.*](L) = [M.sup.[cross product]k] f or some very ample bundle M on X and some large integer k.
Therefore, speeding up modular multiplication (especially of large integer operands) has been a much sought-after outcome for researchers in the area of information security.
However, the floating-point instruction set is inconvenient to realize large integer modular multiplication which is the core operation of asymmetric cryptography.

Site: Follow: Share:
Open / Close