 |
|
|
for metode encryp and decryp with RSA.
|
|
|
|
|
|
|
can u give me, source code for visual studio c#.net 2005.
|
|
|
|
|
|
|
is your software Encrypt/Decrypt the text by 128 bit key
|
|
|
|
|
|
|
it is only an introduction
|
|
|
|
|
|
|
hi,
first ,thanks for this work.
i compiled it using Visual c++ 6,and it it works well.
but when i tried to run it using visual studio 2008,and it asked me to convert to the
current format and then some errors appered when i tried to comile it
"error C2593: 'operator =' is ambiguous ec1assignmentdlg.cpp line 218"
if(str[0] == 0x0A)
winStr = 0x0D;
any ideas about this?
thanks
|
|
|
|
|
|
|
have u any information about NTRU public key 
|
|
|
|
|
|
|
|
|
|
want to decrypt data in .mdb which is in a format of SHA1/RSA..
|
|
|
|
|
|
|
|
|
|
Inadequate text and a project that will not compile on first attempt.
|
|
|
|
|
|
|
Below is UdpClient Server program in which client make a request to add to no and sent it to the server and server give reply !but the reply is not coming instead exception occurs!
if get the solution plz reply on "patel.mahesh034@gmail.com ";)
/**
* @(#)UdpClient.java
*
*
* @author HackMahesh
* @version 1.00 2009/3/18
*/
import java.io.*;
import java.net.*;
public class UdpClient {
public UdpClient() {
}
public static void main(String args[]) throws Exception
{
BufferedReader infromuser=new BufferedReader(new InputStreamReader(System.in));
DatagramSocket clientSocket=new DatagramSocket();
InetAddress IPAddress=InetAddress.getByName("localhost");
byte[] receiveData=new byte[1024];
String sentence=infromuser.readLine();
byte[] sendData=sentence.getBytes();
DatagramPacket sendPacket=new DatagramPacket(sendData,sendData.length,IPAddress,9876);
clientSocket.send(sendPacket);
DatagramPacket receivePacket=new DatagramPacket(receiveData,receiveData.length);
clientSocket.receive(receivePacket);
String modifiedSentence=new String(receivePacket.getData());
System.out.println("from server:"+modifiedSentence);
clientSocket.close();
}
}
/**
* @(#)UdpServer.java
*
*
* @author HackMahesh
* @version 1.00 2009/3/18
*/
import java.io.*;
import java.net.*;
public class UdpServer
{ String addition(String sentence)
{ int len=sentence.length();
int add=sentence.indexOf('+');
String first=sentence.substring(0,add);
String last=sentence.substring(add+1,len);
int a=Integer.parseInt(first);
int b=Integer.parseInt(last);
int c=a+b;
return(String.valueOf(c));
}
public static void main(String args[]) throws Exception
{ UdpServer UDP=new UdpServer();
DatagramSocket serverSocket=new DatagramSocket(9876);
byte[] receiveData=new byte[1024];
byte[] sendData=new byte[1024];
while(true)
{DatagramPacket receivePacket=new DatagramPacket(receiveData,receiveData.length);
serverSocket.receive(receivePacket);
String sentence=new String(receivePacket.getData());
System.out.println("received: "+sentence);
InetAddress IPAddress=receivePacket.getAddress();
int port=receivePacket.getPort();
String capitalizedSentence=UDP.addition(sentence);
sendData=capitalizedSentence.getBytes();
DatagramPacket sendPacket=new DatagramPacket(sendData,sendData.length,IPAddress,port);
serverSocket.send(sendPacket);
}
}
}
|
|
|
|
|
|
|
Article provides very little detail, referring to the included source code rather than explain anything the article might be about. Lack of any code in the article is also a deterrent.
|
|
|
|
|
|
|
exam se pehle aisa tortore..sharam nahi aate...engineer bana ki nahi..???besharam..baddimag..mar ja..kyo maa baap ka paisa dubo raha hai..desh be bojh...jai hind jai bharat
|
|
|
|
|
|
|
i can't run program!I use VS 2008!please help me!
|
|
|
|
|
|
|
HOW I CREATE A CODE FOR 128 BIT KEY.
|
|
|
|
|
|
|
I have an assignment: I was given an encrypted file( was encrypted using 512 bit RSA), and a private key pair {D, N)-- 64 bytes hex ascii. both D and N are Big Endiand format. I need to write a program to decrypt the encrypted data. I saw your article and source code which implement the encryption and decryption by 32 bit. I do not know how to do with 512 bit. As I cannot simply use the mod function to calculate by using 64 bytes data.
Do you have any idea to help me?
Yiping
|
|
|
|
|
|
|
Your program doesn't work for default prime numbers, which are 7 and 17. It happens, because (according to theory), the chunks of data, which are encrypted must be less than prime1 x prime2 = N. Otherwise it can not work. You should break the text to be encrypted to smaller chunks. If You didn't want to bother yourself, then at least it would be nice of You to warn people to select prime numbers correspondingly.
Max
|
|
|
|
|
|
|
This is a RSA tutor software. It demonstrate working fo RSA and also RSA failure conditions can be checked.
___________________________
When a thing is new, people say, "It's not true." Later, when its truth becomes obvious, people say, "It's not important." Finally, when its importance cannot be denied, people say, "Well, it's not new."
|
|
|
|
|
|
|
Great work!!!!
But your program doesn't work for default prime numbers, which are 7 and 17. If it could not work how does it demonstrate working fo RSA? We all hope that you could fix it.
|
|
|
|
|
|
|
Man, this will not work in real world. You cannot check a 100 digit number using that way. It will take forever...
Also, using rand () function to generate a prime number is not a good idea too. The main reason is that it is predictable and it is better to use a cryptographic random number generator. Also in you implementation you just get the value of the random number generator. This mean that your key will most probably be smaller than 32 bits...
Another important thing: The two prime number that you generate should NOT be close to each other. For example, if you use 100 digit number, it is a good idea to use one 99 and one 100 digit prime numbers. If the value of those prime number are close to each other, there is a very good reverse engineering mechanism that will allow people to find both your prime numbers very fastly.
Anyway, I think your implementation of RSA is just a school homework. This is not even close to a real implementation and should not be used in practice (even with large numbers). In fact it will take more than a million years to generate a random number with your method 
Mustafa Demirhan
http://www.macroangel.com
Sonork ID 100.9935:zoltrix
They say I'm lazy but it takes all my time
|
|
|
|
|
|
|
Actually 32 bits is about 4 billion numbers and can be cracked in a matter of seconds.
|
|
|
|
|
|
|
HEh, 10 seconds with pen and paper.
--
Run around in the radiation
Run around in the acid rain,
On a black, black planet
|
|
|
|
|
|
|
You miss the point.
The author avoid to use big-Integers to keep it simple.
He just concetrate on explaning the RSA algorithm and provides a basic implemetnation.
- - - - - - - - - - - - - - - - - -
Memory leaks is the price we pay \0
01234567890123456789012345678901234
|
|
|
|
|
|
|
If I recall 1024bit prime numbers will ensure that you wouldnt care if the code was broken as we would have long since passed away.
Ant.
|
|
|
|
|
|
|
Well actually that isn't true anymore. 1024-bit keys are in danger in the near future. See arstechnica article.
|
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Rant 
Admin