[Sajuuk]

ALPHA 4 (Rev. 1): (Click to View)Click Here For Current BitCrypt Pastebin Source Code...

ALPHA 5 Will Include:

- RandChr() Function

Credits:

C++™ - Main Idea
Love2D - Fixed case problems. General help with C++.
void00 - General help with C++.

[Daylloween]

Sounds pretty nice, what storage method are you using? Resources? If yes then i might know how you do it :)

[Sajuuk]

Storage? What the heck is storage? Idk what that is.

[notsteve]

What is bitcrypt and what advantages does it offer over other options such as TrueCrypt?

e: assuming it's an encrpytion software because of your req. Idk what it is, is it a crypter?

[Augustus]

Storage? What the heck is storage? Idk what that is.

The person is assuming your project is a crypter.

[Sajuuk]

Oh no. It's not a crypter. It's a text encryption program.

[Love2D]

Just text encryption? Are you kidding me?

[Sajuuk]

Hey how about you make a text encryptor? I am trying to learn how to do the actual things to encrypt it in the first place. I have this code from a website:

Spoiler (Click to View)

Code

#include <iostream>
#include <stdlib.h>
#include <cstdlib>
#include <windows.h>
#include <string.h>

using namespace std;

int main()
{
    string keyword;
    string msg;
    int crypted;
    int real_difference;
    int i=0;
    int k;
    int l;

    cout<<"Enter the keyword : ";
    getline(cin, keyword);

  cout<<"Enter the message you want to crypt : ";
  getline(cin, msg);

  k = keyword.length();
  l = msg.length();

  loop1:
  if(k < l); //used to even out the keyword and the sentence
  {    //to change each letter
     keyword = keyword + keyword;
     k = keyword.length();
     if(k < l)
     goto loop1;
  }

    cout<<"\n\n";
    while (i<= msg.length()) //records length and uses string as array
    {
    keyword[i] -= 'a'- 1;

    if((msg[i] + keyword[i]) > 'z') //If crypted letter goes beyond 'z'
    crypted = 'a' + (keyword[i]+msg[i] - 'z') - 1;

    else if(msg[i] == 32) // If letter is a space
    crypted = msg[i];

    else
    crypted = msg[i] + keyword[i]; //Crypting

    cout<<(char)crypted; //Prints out the crypted letter
    i++;

    if(i>= msg.length())
    break;
    }

  return 0;

  }

It's a Vigenere cipher code. How do I reverse the process?

[Love2D]

You are asking for help with this on cplusplus.com? You shouldn't be releasing it if you are going to have someone give you the code.

[Sajuuk]

Hello! They will be credited with creating it. A full credits list will be implemented in the program. Duh.

[Love2D]

But if encryption and decryption is the only thing the program does then you are asking for the whole program to be done for you!

[Sajuuk]

Did I ask for the whole program? I want to have an example to refer back to when I'm stuck, which I am currently. All I want is to figure out how to encrypt text.

[Love2D]

You already copied the Vigenere Cipher from another website. Are you sure you are just using this code to refer back to when stuck?

[Sajuuk]

As you can see, if you look, the old Batch BitCrypt was based off of AMDjack's HXB-128 cipherer. It used IFs to read the plaintext, convert it to another specified character, then return the value and go back to the loop with GOTO. In this case now, I'll be using IF, FOR, WHILE or GOTO, etc. If only I had a caesar cipher code to refer to...

[Sylex]

Why go through all the work when it's already been done? Just be sure to credit the author of this neat lib.
http://embeddedsw.net/libObfuscate_Crypt..._Home.html

Just be sure to implement a correct mode of operation. Read up on them here:
http://en.wikipedia.org/wiki/Block_ciphe..._operation

I personally suggest GCM, but replace the incremental aspect of it with libOfuscate's CSPRNG, and seed it with part of the expanded password.

For a password expansion algorithm I recommend scrypt:
http://www.tarsnap.com/scrypt.html

scrypt has a variety of unique features which makes it extremely secure for a password expansion hash, such-as all the features of bcrypt but with variable memory usage, making it much harder to create a hardware implementation of the algorithm.

Also please for the love of all cryptology, don't start creating new algorithms unless you want some extremely weak software.