Skip to content

issues Search Results · repo:kokke/tiny-bignum-c language:C

Filter by

0 results
 (105 ms)

0 results

inkokke/tiny-bignum-c (press backspace or delete to remove)

[https://gist.github.com/Dominic3203/25d8689e29940869ed8a65532a3f228c]
  • Dominic3203
  • Opened 
    on Dec 10, 2024
  • #38

int bignum_r_degree(struct bn* n) { int i = BN_ARRAY_SIZE; while ((n- array[--i] == 0) i); int out = i * WORD_SIZE * 8; out += 32 - __builtin_clz(n- array[i]); return out; } Returns the number of bits ...
  • AVI-crak
  • Opened 
    on Aug 16, 2023
  • #36

Have been working with your neat library today but struggling with simplest of things. Want to work with larger 64 byte hex ecdsa but not even having luck with simple conversions to/from small strings ...
  • jrp27514
  • Opened 
    on Mar 16, 2023
  • #34

./test_random 3 0100 80 02 test_random: bn.c:104: bignum_from_string: Assertion `(nbytes % (sizeof(uint32_t) * 2)) == 0 string length must be a multiple of (sizeof(DTYPE) * 2) characters failed. ...
  • wir19
  • 13
  • Opened 
    on Dec 7, 2021
  • #33

I am trying to implement the deffie-hellman-group14 but unfortunately bignum_pow_mod_faster gives me 0 back... I got a b for testing from this site: http://acme.com/dhtest/dhtest.html #include string.h ...
  • felixobenaus
  • 1
  • Opened 
    on Oct 19, 2021
  • #32

Current implementation of the header will throw a compile-time error, if word size would be defined to be 8. On x86_64 platforms, which are a very common target this word size might be the fastest type ...
  • flysand7
  • 1
  • Opened 
    on Oct 10, 2021
  • #31

Otherwise the user of bignum_to_string() should guess how many characters might be needed?
  • yurivict
  • 1
  • Opened 
    on Sep 24, 2021
  • #30

File ./scripts/test_rand.py , line 123 expected = int(math.sqrt(oper1)); ^ TabError: inconsistent use of tabs and spaces in indentation *** Error code 1 Python-3.8 ...
  • yurivict
  • 2
  • Opened 
    on Sep 24, 2021
  • #29

I think its good to export pow_mod_faster in the tests/rsa.c to the public API in the form bignum_pow_mod function. Its complement bignum_pow but with fast modulo exponentiation functionality at the hand ...
  • blackshirt
  • 1
  • Opened 
    on Aug 26, 2021
  • #28

` char buffer[500]; struct bn a, b, c; bignum_from_string( a, ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe , 64); bignum_to_string( a, buffer, 500); printf( %s\n , buffer); bignum_from_int( ...
  • minocoko
  • Opened 
    on Jun 28, 2021
  • #25
Issue origami icon

Learn how you can use GitHub Issues to plan and track your work.

Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub Issues
ProTip! 
Restrict your search to the title by using the in:title qualifier.
Issue origami icon

Learn how you can use GitHub Issues to plan and track your work.

Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub Issues
ProTip! 
Press the
/
key to activate the search input again and adjust your query.
Issue search results · GitHub