encryption-symmetric

I'm trying to convert below java code into nodejs. public static String encrypt(String accessToken) throws Exception { Cipher cipher = Cipher.getInstance("AES"); String merchantKey = "11111111111111111111"; String st = StringUtils.substring(merchantKey, 0, 16); System.out.println(st); Key secretKey = new SecretKeySpec(st.getBytes(), "AES"); cipher.init(Cipher.ENCRYPT_MODE, secretKey); byte[] encryptedByte = cipher.doFinal(accessToken.getBytes()); // convert the byte to hex format StringBuffer sb = new StringBuffer(); for (int i = 0; i < encryptedByte.length; i++) { sb.append(Integer.toString(

I've built a CMS system to allow users to create and manage online forms on my client's intranet app. Of course some of the data handled by the forms may need to be encrypted e.g. if the system is used to build a form that handles salary specifics or whatever. So I'm using the AESManaged class to symmetrically encrypt this sort of data prior to it going into our application db. All is fine, but now, prior to release, I could do with a steer regarding the shared secret and salt . My original idea was to make a (dynamic) shared secret by combining the (GUID-based) ID of the Form containing the

I'm wondering if there is some strong (like AES or so.) encryption function that works like this: symetric 2 keys: plaintext -> 2keys ->ciphered text, however it must not matter order of keys, i.e Key1 (Key2 (plaintext)) == Key2 (Key1(plaintext)) e.g. "commutative" (also required for decryption - you need two keys, doesn't matter order) thanks It's not a commutative encryption, but there are well-proven algorithms for secret sharing (note, this is not the same thing as "key agreement.") Two of the best known methods are Shamir's and Blakley's. In general, these algorithms take a secret and

I have the following python script to encrypt/decrypt data using AES 256, could you please tell me if there's anything in the code that may make the encryption weak or if there's anything that I've not taken account of for AES 256 encryption using CBC mode? I've tested the script and it works fine, it is encrypting and decrypting data but just wanted a second opinion. Thanks. from Crypto.Cipher import AES from Crypto import Random BLOCK_SIZE = 32 INTERRUPT = u'\u0001' PAD = u'\u0000' def AddPadding(data, interrupt, pad, block_size): new_data = ''.join([data, interrupt]) new_data_len = len(new

Use AES/Rijndael or any symmetric encryption. Encrypt the hidden value using itself as the key and a random IV. Store the ciphertext + IV. Discard everything else. To check the hash: try to decrypt using provided plaintext. If provided == decrypted, then it's OK. Ignore ciphertext length problems. Is this secure? As described, it has a problem in that it reveals information about the length of the data being hashed. That in itself would be some kind of weakness. Secondly ... it is not clear that you would be able to check the hash. It would be necessary to store the randomly generated IV with

Given this workflow: Server A User authenticates. User purchases randomly generated unique voucher code using shared secret to use an application on on server B. Server B User authenticates. User inputs voucher code. Server B validates code is legitimate using shared secret Server B grants access to the application. I need a way in PHP to implement the functions generateVoucherCode and validateVoucherCode as shown below: Server A $voucher = generateVoucherCode("someSharedSecret"); Server B $isValid = validateVoucherCode($userInputtedCode, "someSharedSecret"); if($isValid) { // allow access to