Article View: borland.public.jbuilder.java.swing
Article #9880Looking for maths algorithm for cryptography
From: swps49
Date: Sun, 26 Dec 1999 00:00
Date: Sun, 26 Dec 1999 00:00
34 lines
1718 bytes
1718 bytes
--------------6B54344EB6E5C4244E021A2F
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Hi,
Can anyone tell me how to write a PRIME NUMBER ALGORITHM, FAST
EXPONENTIATION ALGORITHM and EUCLID ALGORITHM in Java to solve this type
of problem:
73 x mod n = 1 where the answer for x = 2.
These algorithm must be able to solve large numbers problems.
Thanks a lot for your concern
From: bubblechew@hotmail.com
--------------6B54344EB6E5C4244E021A2F
Content-Type: text/html; charset=us-ascii
Content-Transfer-Encoding: 7bit
<!doctype html public "-//w3c//dtd html 4.0 transitional//en">
<html>
Hi,
<br> Can anyone tell me how to write a <b>PRIME NUMBER ALGORITHM,
FAST</b>
<br><b>EXPONENTIATION ALGORITHM</b> and <b>EUCLID ALGORITHM</b> in Java
to solve this type of problem:
<br> 73 x mod n =
1 where the answer for x = 2.
<br> These algorithm must be able to solve <b>large numbers</b>
problems.
<br> Thanks a lot for your concern
<p>From: bubblechew@hotmail.com</html>
--------------6B54344EB6E5C4244E021A2F--
Technical Details
Message-ID:
<843dme$aj75@forums.borland.com>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailShow Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 111d45,ca21f72a3f273d7a,start X-Google-Attributes: gid111d45,public From: swps49 <"swps49"@pd@jaring.my> Subject: Looking for maths algorithm for cryptography Date: 1999/12/26 Message-ID: <843dme$aj75@forums.borland.com> X-Deja-AN: 564860984 X-Accept-Language: en Content-Type: multipart/alternative; boundary="------------6B54344EB6E5C4244E021A2F" Organization: Another Netscape Collabra Server User Mime-Version: 1.0 Newsgroups: borland.public.jbuilder.java.swing