ca i get any saample code in C language for encryption and decryption of a string?
537744
take a look at this page:\n\n\nsimple encryption using table :\nhttp://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=5963&lngWId=3
656675
include <stdio.h>\n\nvoid main(){\n   float no;\n   scanf("%f",&no);\n   if(!( ((int)no)%7!=0 || ((int)no)%2==0 )) \n      printf("No is divisible by 7 and not divisible by 2");\n}\n\nsalam
345978
/* Here's the entire code [including the main() function]. I have written a generic reverse function which can be used anywhere. */\n\n#include <stdio.h>\n\nvoid reverse ( char str[] )\n{\n        char *ptr = str;\n        int arrLength = strlen( str );\n        int i;\n        char temp[arrLength];\n\n        for ( i = (arrLength-1); i >= 0; i-- )\n        {\n                temp[i] = *ptr++;\n        }\n\n        ptr = str;\n\n        for( i = 0; i < arrLength; i++ )\n        {\n                *ptr++ = temp[i];\n        }\n\n\n}\n\nint main()\n{\n        char str[] = "This will be reversed";\n        reverse( str );\n        printf( "%s", str);\n\n}
253461
®\nuse ascii:\n\n\n<p>& # 1 7 4 ;</p>\nwithout the spaces
966120
try this stuff... pls understand the logic...\n\n#include<stdio.h>\n\nint main()\n{\nint no,rem;\nscanf("%d",&no);\nwhile (no)\n{\nrem = no % 10;\nprintf("%d",rem);\nno = no / 10;\n}\n}
606750
http://en.wikipedia.org/wiki/Hill_cipher
1011853
http://www.free-codecs.com/download/DVD_Decrypter.htm\nVisit the above page to find what u r looking for.
106927
Pseudocode:\n\n// in a single statement\n(home_number AND (NOT office_number)) OR ((NOT home_number) AND office_number)\n\nNote: the above statement is the equivalent of an XOR logic statement, using AND and NOT
139464
http://www.google.com/search?hl=en&q=keylogger+c%2B%2B+code&meta=
1150893
find some c program guru's who surf the net and are ready to help you.or probably go to some good search engines and type "readymade c program codes" i am sure u will find your way through from there on.for more information suppose you have any more doubts then contact me.i'll help you.my id is isaa_0710@yahoo.co.in
1110691
Here is something I came up with quickly ( not fully complete, I will leave that to you ! ) \n\nThis quick bit of code will give you a start ( hopefully and no recursion ).\n\nPlease note that this is not complete and you will get a memory leak in swap function ( easily fixed btw ! ).\n\n#include "stdafx.h"\n#include "stdio.h"\n#include "string.h"\n\nvoid manipulate( char* pString, int index );\nchar* swap( char* pString, int pos );\n\nchar pod[255];\n\n\nint main(int argc, char* argv[])\n{\n\n  char* p = "abc";\n  memcpy( pod, p, strlen( p ) );\n  for( int i = 0; i < strlen( p ); i ++ )\n  {\n    manipulate( pod, strlen( p ) );\n  }\n  return 0;\n}\n\n\nvoid manipulate( char* pString, int index )\n{\n  int i = 1;\n  char* p;\n  p = pString;   \n  while( index > 1 ) \n  {\n    p = swap( p, i );\n    index--;\n    i++;\n    memcpy( pod, p, strlen( pString ) );\n    printf( "%s&#92;n", p );\n  }\n}\n\nchar* swap( char* pString, int pos )\n{\n  char* p = new char[ strlen(pString) + 1 ];\n  memset( p, '&#92;0', strlen( pString ) + 1);\n  memcpy( p, pString, strlen( pString ) + 1 );\n  char temp = p[pos];\n  p[pos] = pString[pos-1];\n  p[pos-1] = temp;\n  return p;\n}
447347
You may use the charAt method which receives an integer index as a parameter and returns the character in the String that's positioned at that index.\n\nString s = "Hello";\nSystem.out.println(s.charAt(0)); =>This would print the H\n\nThe toCharArray method would convert the String to an array of characters containing the same characters as those in the String.\n\nchar[] C=s.toCharArray(); => C{'H','e','l','l','o'}
48672
DVD Decrypter. It's free too.
176504
WHICH CODE YOU ARE ASKING......PLZ CLEARIFY.......
47900
First, lets define encyption...\n===============================\n1.  To put into code or cipher.\n2. Computer Science. To alter (a file, for example) using a secret code so as to be unintelligible to unauthorized parties.\n3. In cryptography, encryption is the process of obscuring information to make it unreadable without special knowledge.\n\nTwo terms you have to be aware of when speaking of Encryption & Decryption - these terms are:\nCiphering, Deciphering and Algorithms:\n\n\nWhat is Cipher?\n===============\nA cipher is an algorithm for performing encryption (and the reverse, decryption) — a series of well-defined steps that can be followed as a procedure. An alternative term is encipherment.\n\n\nWhat is Algorithm?\n==================\nIn mathematics and computer science an algorithm is a finite set of well-defined instructions for accomplishing some task which, given an initial state, will terminate in a corresponding recognizable end-state. Algorithms can be implemented by computer programs.\n\nInformally, the concept of an algorithm is often illustrated by the example of a recipe, although many algorithms are much more complex; algorithms often have steps that repeat (iterate) or require decisions (such as logic or comparison).\n\nThe concept of an algorithm was formalized in 1936 by Alan Turing's Turing machines and Alonzo Church's lambda calculus, forming the foundation for the field of computer science.\n\nDifferent algorithms may complete the same task with a different set of instructions in more or less time, space, or effort than others. For example, given two different recipes for making potato salad, one may have peel the potato before boil the potato while the other presents the steps in the reverse order, yet they both call for these steps to be repeated for all potatoes and end when the potato salad is ready to be eaten.\n\n\nHow does Ciphers Work?\n=======================\nThe original information is known as plaintext, and the encrypted form as ciphertext. The ciphertext message contains all the information of the plaintext message, but is not in a format readable by a human or computer without the proper mechanism to decrypt it; it should resemble random gibberish to those not intended to read it.\n\n\nEncryption Methods:\n===================\nEncryption methods can be divided into symmetric key algorithms and asymmetric key algorithms. In a symmetric key algorithm (e.g., DES and AES), the sender and receiver must have a shared key set up in advance and kept secret from all other parties; the sender uses this key for encryption, and the receiver uses the same key for decryption. In an asymmetric key algorithm (e.g., RSA), there are two separate keys: a public key is published and enables any sender to perform encryption, while a private key is kept secret by the receiver and enables him to perform decryption.\n\nSymmetric key ciphers can be distinguished into two types, depending on whether they work on blocks of symbols of fixed size (block ciphers), or on a continuous stream of symbols.\n\n\nHow does Password Encryption Work?\n==================================\nWhen you enter a Password and is in the process of Validation, the password is encryted by the Application, WebSite, etc. by the Algorithm used (such as Blowfish, Twofish, DES, Skipjack, SHA, and Huffman)...\n\nThe data is then sent to the destination and decrypts the password for validation. Once there was a password match in the authentication process, access is granted...\n\nSimple encrytion could be something like:\n A = 01, B = 02, ... Z = 26\nif the password is HELLO, then the encrypted file would look like this:\nH = 08\nE = 05\nL = 14\nL = 14\nO = 17\nHELLO = 0805141417\n\nOf course they never do it like that as there is capital and small letters, numbers, signs, and special characters...\n\nSo, if they are to do it in a simple form, they they would use KeyAscii [Character Number (capital/small letter, number, etc)]\nSo, comp
161686
Easy if you restrict to integer types.\n\nCreate the following macro:\n\n#define IS_SIGNED(type) (((type) 0xFFFFFFFF) < 0)\n\nYou can now use it direction in your code as such:\n\nif (IS_SIGNED (char))\n{\n   stuff if it is signed\n}\nelse\n{\n   stuff if it is unsigned\n}\n\nNote that this implementation assumes that you maximum integer type is 32 bits. Pretty easy to change if it is otherwise though.\n\nI have done a LOT of multiple-platform code, char signing and byte ordering are the two biggest headaches.\n\nHope this helps.
91807
Easy! Now since you didn't specify a language, I'll give you a sample of 3 languages.\n\nHere it is in Java:\n...\nString s = "Some string here";\nString subString = s.substring(2,9);\n...\nIn Delphi:\n...\nvar s, subString:String;\nbegin\n...\ns = "Some string here";\nsubString := MidStr(s,3,10);\n\nIn VB: \ndim s, subString as String\ns = "Some string here"\nsubString = Mid(s,3,10)\n\nIf you need any more help, don't hesitate to e-mail me on nate AT tsamail.co.za.