Reputation
1,290
Top tag
Next privilege 1,500 Rep.
Approve tag wiki edits
Badges
4 9
Newest
 Yearling
Impact
~31k people reached

Aug
17
awarded  Yearling
Apr
6
comment Decrypted RSA 64 bit encryption using modulus and private exponent. Got gobbledygook [Verify]
Remove the final 0x0. And also the final 4 41's (A's) as well, which are probbaly padding to fill out a block. The == (3d3d) are before that and are the end of the proper base64
Apr
6
answered Decrypted RSA 64 bit encryption using modulus and private exponent. Got gobbledygook [Verify]
Apr
6
comment Decrypted RSA 64 bit encryption using modulus and private exponent. Got gobbledygook [Verify]
There should be more than 00's at the start from the //vV characters
Apr
6
comment Decrypted RSA 64 bit encryption using modulus and private exponent. Got gobbledygook [Verify]
And hd shows what? File output says nothing
Apr
6
comment Decrypted RSA 64 bit encryption using modulus and private exponent. Got gobbledygook [Verify]
Write to file using > outputfile then do hd outputfile to see hex dump
Apr
6
comment Decrypted RSA 64 bit encryption using modulus and private exponent. Got gobbledygook [Verify]
The = signs at the end are not necessary so try it anyway
Apr
6
comment Decrypted RSA 64 bit encryption using modulus and private exponent. Got gobbledygook [Verify]
Did you try to bsse64 decode this to binary?
Mar
28
awarded  Explainer
Mar
26
comment Is it secure to transmit a short plaintext with its MAC?
Glad to be able to help
Mar
26
comment Is it secure to transmit a short plaintext with its MAC?
So the nonce is authenticated as well, hopefully. Yes, for messages that fit into the domain of a block cipher this is quite a valid construction and a good reuse of primitives. In this case it's a doubling, in general, for longer messages, one would use CBC-MAC or HMAC and then the extra data is quite reasonable.
Mar
26
answered Is it secure to transmit a short plaintext with its MAC?
Mar
26
answered NTRU Encryption
Mar
26
revised NTRU Encryption
Language plus LaTeX
Mar
25
answered Cycles in SHA256
Mar
2
comment What are the steps to decrypt a TLS 1.1 record?
Yes, this is true if we have a CBC cipher (or even an AEAD cipher, which also has a nonce/IV and is supported in 1.2), not for stream ciphers, of course. 1.2 works the same way.
Feb
26
comment Hashes and Ciphers
RSA is an (public key, so assymetric) algorithm, 3DES is a symmetric algorithm. Both are not protocols, but building blocks in cipher-modes, which in turn are used in protocols, like IPSec, TLS, SSH, etc. The last use hashes as part of HMAC's (mostly) to ensure that data is not tempered with, and in key-derivation.
Feb
24
comment Using hash for one time pad key
@VincentAdvocaat this is the same as my point from the comment on the original question. Why bother with a system that one cannot encrypt arbitrary data with? OTP is not broken if plain text is known because key stream is not reused and independently random. So knowing part of it comprises nothing. Here knowing only 32 bytes kills everything.
Feb
23
comment Using hash for one time pad key
Suppose your hash is 16 bytes long (like MD5), and you need to encrypt known plaintext of 16 bytes as part of a protocol say or some file format, your system is dead after dead. Even e.g. 12 bytes is deadly as you brute force all 4 unknown plain text bytes.
Feb
23
answered encryption of message “DATACONFANTIALITY” with key playfair using playfair cipher