Notices
Results 1 to 3 of 3

Thread: Big Number calculator

  1. #1 Big Number calculator 
    Forum Isotope (In)Sanity's Avatar
    Join Date
    Oct 2004
    Location
    Mesa AZ
    Posts
    2,699
    http://world.std.com/~reinhold/BigNumCalc.html

    Interesting and useful app.

    It allows for thousands of digits.


    Pleased to meet you. Hope you guess my name
    Reply With Quote  
     

  2.  
     

  3. #2 Re: Big Number calculator 
    New Member
    Join Date
    Feb 2011
    Posts
    2
    Quote Originally Posted by (In)Sanity
    http://world.std.com/~reinhold/BigNumCalc.html

    Interesting and useful app.

    It allows for thousands of digits.
    Beaconaut APICalc 2 is another interesting and useful app. for big number arithmetic, cryptography analysis and number theory research......

    http://www.beaconaut.com/Downloads.aspx


    Reply With Quote  
     

  4. #3  
    New Member
    Join Date
    Feb 2011
    Posts
    2
    Beaconaut APICalc 2 screenshot:



    Meanwhile, there's an example to demo RSA big calculation in the user manual which you can find it after installing the trial version. I'd like to describe it here for you again, the following is the example to use Beaconaut APICalc 2 to calculate encryption and decryption using RSA Module Exponentation Algorithm .

    Typically, ModExp is used to analyze RSA encryption and decryption. For example below:

    Modulus(n):49470617055557138882502006021680798234904060873538 44799320148744661285799994634356647073247223284092 17518001116715336576521960933632794921707452570099 90215629877622424478327028552313744534027258454459 04074057326726874070994420535014032369110750484074 86241524461214354104169692948137612603934021718954 32733209

    Public Exp(e):65537

    Private Exp(d):35840287132426765859609003248690118561930585932764 78188988215243244546588701729393374781234694318151 52475009430118012430432621345635062680358726338226 39650429560086715914796422476921417849449156218352 03117082987933033472094402762856509344400168962606 46495356555410168478249817928194106676253882839910 16934113

    Message(M):123456789

    Using Beaconaut APICalc 2 for encayption and decryption below:

    Encryption: Cyphertext(C) = M^d mod n =3305756050253832106251009149637176001963792524882 64101855732016626110463616848731651856484344778472 28927576106364782017447616571997736375598820823740 70165753828717745032517889341468817060710808497116 73979668678577827033041542407087160368511504812279 02336862953423739348608335643259043981364491801073 012931620



    Decryption: Message(M) = C^e mod n = 123456789

    Very interesting and easy-to-use!
    Reply With Quote  
     

Bookmarks
Bookmarks
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •