Re: [URGENT] help required for modulo arithmetic?

From: Tom St Denis (tomstdenis_at_iahu.ca)
Date: 11/29/03

  • Next message: m_houllier: "Design (easy-ish) cipher C++ implentation,"
    Date: Sat, 29 Nov 2003 22:01:59 GMT
    
    

    "Vikrama Sanjeeva" <vikramasanjeeva@hotmail.com> wrote in message
    news:19d67fc7.0311291355.62b21ca5@posting.google.com...
    > Hi,
    > Can anybody help me with modulo arithmetic dealing with large numbers?
    > e.g. 11^7 mod 97 = ?
    > I want to know the method using calculator.

    May I suggest

    http://book.libtomcrypt.org

    [for no particular reason... muauahahaha]

    As for this specific problem... use a square/multiply method

    e.g. a^7 == (((a^2)*a)^2)*a

    If you're not into coding [and why not!?!?!] I'd suggest an elcheapo dover
    series text on number theory. They cost like 10$ and will explain all of
    the relevent theory quite well.

    Tom


  • Next message: m_houllier: "Design (easy-ish) cipher C++ implentation,"

    Relevant Pages

    • Re: [URGENT] help required for modulo arithmetic?
      ... >> Can anybody help me with modulo arithmetic dealing with large numbers? ... >> I want to know the method using calculator. ... > the relevent theory quite well. ... Thanks Tom for the link. ...
      (sci.crypt)
    • Re: [URGENT] help required for modulo arithmetic?
      ... > Can anybody help me with modulo arithmetic dealing with large numbers? ... So we can throw those away, leaving a remainder of 31. ... If I were using a calculator, ...
      (sci.crypt)