computing modul
From: Pesso (pesso_at_no.where)
Date: 08/30/05
- Previous message: Paul Rubin: "Re: Are there problems with Merkle-Damgaard and SHA-256?"
- Next in thread: Håvard Raddum: "Re: computing modul"
- Reply: Håvard Raddum: "Re: computing modul"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Mon, 29 Aug 2005 21:22:28 -0700
I'm trying to compute m=(c^d) mod n where c and d are big numbers. Is there
an algorithm that I can use to program my pc to do the computation.
- Previous message: Paul Rubin: "Re: Are there problems with Merkle-Damgaard and SHA-256?"
- Next in thread: Håvard Raddum: "Re: computing modul"
- Reply: Håvard Raddum: "Re: computing modul"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]