bignum Questions
2
Solved
This arose from a question earlier today on the subject of bignum libraries and gcc specific hacks to the C language. Specifically, these two declarations were used:
typedef unsigned int dword_t _...
Gadmann asked 30/12, 2010 at 0:17
3
Solved
I'm trying to implement long division for bignums. I can't use a library like GMP unfortunately due to the limitations of embedded programming. Besides, i want the intellectual exercise of learning...
3
Solved
Can I work with large numbers (more than 10^400) with built-in method in Delphi?
Seftton asked 28/8, 2010 at 9:11
2
Solved
Python provides a "bignum" type called "long" which can represent arbitrarily large numbers. What is the internal representation of this type?
I ask in part because I am curious what operations mi...
Bonnette asked 23/4, 2014 at 20:1
3
Solved
To speed up my bignum divisons I need to speed up operation y = x^2 for bigints which are represented as dynamic arrays of unsigned DWORDs. To be clear:
DWORD x[n+1] = { LSW, ......, MSW };
where...
Guss asked 27/8, 2013 at 12:23
1
Solved
I have not been able to find an answer as to what is used to generate the primes with BN_generate_prime in openssl/bn.h. Also, how would I seed whatever PRNG that this function uses?
Separate ques...
6
Solved
I've got four unsigned 32-bit integers representing an unsigned 128-bit integer, in little endian order:
typedef struct {
unsigned int part[4];
} bigint_t;
I'd like to convert this number into ...
3
Solved
I'm looking for a Mathematical solution that deals with really (long, big, huge, storms) numbers. I haven't found anything yet, But I don't wanna think that this problem hasn't be solve at th...
Haleakala asked 26/11, 2010 at 22:3
1
From here I understand that BN_CTX is a structure that holds BIGNUM temporary variables. When will those BIGNUM variables enter BN_CTX's BN_POOL? If I have a bignum_ctx BN_CTX *ctx (either declared...
5
Solved
I met this problem when I tried to compute 3**557 in irb.
Ruby and MacRuby both are installed in my Mac (OS X 10.8). And the version of ruby is 1.8.7, of MacRuby 0.12 (ruby 1.9.2).
rib and macirb g...
Norton asked 17/8, 2012 at 16:43
1
Solved
While I was working on my fast ADD loop (Speed up x64 assembler ADD loop), I was testing memory access with SSE and AVX instructions. To add I have to read two inputs and produce one output. So I w...
Zondra asked 20/12, 2012 at 15:37
3
I'm working on arithmetic for multiplication of very long integers (some 100,000 decimal digits). As part of my library I to add two long numbers.
Profiling shows that my code runs up to 25% of i...
Guinness asked 20/12, 2012 at 11:22
1
Solved
I'm currently working with vellvm, developing a transformation on it. I'm a coq newbie.
While programming, I faced the following warning:
Warning: Stack overflow or segmentation fault happens w...
3
Solved
I'm working with numbers with tens of thousands of digits in python. The long type works beautifully in performing math on these numbers, however I'm unable to access the highest digits of these nu...
Uxmal asked 25/11, 2012 at 0:53
7
Solved
I'm building a program in C that can get powers of 2. The user inputs the value of n, and the program calculates 2^n.
Here's the code.
The problem comes when I input 100
What I am getting:
1,26...
8
Solved
I'm trying to learn C and have come across the inability to work with REALLY big numbers (i.e., 100 digits, 1000 digits, etc.). I am aware that there exist libraries to do this, but I want to attem...
Retroflex asked 2/8, 2009 at 4:27
3
Solved
Does C# support arbitrary precision arithmetic (I think this is also called bignums)?
If it doesn't, which libraries do support it?
Gullet asked 15/3, 2012 at 21:14
1
I am working with cryptography and need to use some really large numbers. I am also using the new Intel instruction for carryless multiplication that requires m128i data type which is done by loadi...
2
Compiler: MinGW/GCC
Issues: No GPL/LGPL code allowed (GMP or any bignum library for that matter, is overkill for this problem, as I already have the class implemented).
I have constructed my own 1...
1
Solved
I'm still working on routines for arbitrary long integers in C++. So far, I have implemented addition/subtraction and multiplication for 64-bit Intel CPUs.
Everything works fine, but I wondered if...
Tirpitz asked 15/1, 2012 at 1:54
2
Solved
I'm looking for a fast BigFloat unit, which can deal with addition, subtraction, multiplication and division (log would be fine but isn't necessary) and which has a precision of at least 100 decima...
2
Solved
It seems that GMP provides only string serialization of the mpf (floating point) type:
mpf_get_str(), mpf_class::get_str()
The mpz (integer) type has an additional interface for raw bytes: mpz_ou...
Haga asked 23/7, 2010 at 14:16
8
Solved
How does the system perform the 2^56 modulo 7, if it's 32 bits operating system in cryptography for example?
And how it stored in memory?
Barron asked 22/8, 2010 at 14:1
5
Solved
How the heck does Ruby do this? Does Jörg or anyone else know what's happening behind the scenes?
Unfortunately I don't know C very well so bignum.c is of little help to me. I was just kind of cu...
Sparkle asked 19/5, 2010 at 16:4
1
Solved
In one of my modules, I have to deal with the concept of infinity. To date, I have been using 9**9**9 as positive infinity, and this seems to work well, is fast, and seems to be what perl's interna...
Perisarc asked 4/10, 2010 at 16:0
© 2022 - 2024 — McMap. All rights reserved.