Cryptography

Help Center > Badges > Scholar

 Scholar
Ask a question and accept an answer.
Awarded 5833 times.
TLS handshake with client later on acting as a server
Awarded 35 mins ago
Using a hash function as a random number generator
Awarded 3 hours ago
Is it possible to encrypt something using literally only a public key?
Awarded 5 hours ago
How is Diffle Hellman with RSA immune to man in the middle?
Awarded yesterday
Appropriate public exponent choice for RSA encryption
Awarded yesterday
Discrete Logarithm: Given a p, what does it mean to find the discrete logarithm of x to base y?
Awarded yesterday
128 bit AES CBC bit flipping on second block
Awarded Dec 6 at 14:40
Operation on elliptic curves
Awarded Dec 6 at 12:50
Can anybody please explain why is the probabilty of finding a desired message for random chaining values equal $2^{-224}$?
Awarded Dec 6 at 6:00
Is there a type of asymmetric and symmetric encryption that's fairly easy to crack?
Awarded Dec 4 at 21:05
Is there asymmetric encryption in SSH?
Awarded Dec 2 at 12:05
2DES and 3DES against a DES build with complimentary
Awarded Dec 2 at 11:45
Is there a way to do anonymous encryption to a recipient?
Awarded Dec 2 at 11:40
Books about stream ciphers
Awarded Dec 2 at 9:30
How the FHE encrypts a k-bit message just with one-bit encryption scheme?
Awarded Dec 2 at 2:30
Collision resistant hash functions with prime domain
Awarded Nov 30 at 19:40
Infinite one time pads using a pseudorandom hash function [duplicate]
Awarded Nov 30 at 19:15
What is the probability of a collision in SHA-512 when the input is 512 bits of data
Awarded Nov 29 at 15:00
Why RSA-KEM is more secure than Textbook-RSA?
Awarded Nov 29 at 13:05
Why does this attack on a simplified version of the Naor-Yung scheme not work for the original scheme?
Awarded Nov 28 at 13:25
What is the difference between PKCS1 v1.5 and PKCS7? Is PKCS7 a superset of specifications in PKCS1 1.5?
Awarded Nov 27 at 14:15
Proving knowledge of a value and computation that uses it
Awarded Nov 27 at 10:45
True asymmetric ciphers beside RSA
Awarded Nov 27 at 10:10
Is it possible to construct a multiplicative group from $\mathbb{Z}_n$ if $n$ is not a prime number?
Awarded Nov 26 at 19:05
“Probability” of an ECDSA signature
Awarded Nov 25 at 19:15
If all encrypt algorithms in TLS1.3 ciphersuites are AEAD , why do they keep including a Hash algorithm?
Awarded Nov 24 at 1:25
Splitting text before Format Preserving Encryption operation
Awarded Nov 23 at 16:40
Is this the right way to implement ElGamal scheme over Elliptic Curves over prime field? [duplicate]
Awarded Nov 22 at 18:55
Can the OpenSSL random number generator be considered cryptographically secure? [duplicate]
Awarded Nov 22 at 13:50
If there is an algorithm A can calculate the modular square root of input n, How to use it to get prime factors?
Awarded Nov 21 at 22:25
Suppose I capture encrypted data that I want to decrypt. Could I use a server farm to decrypt?
Awarded Nov 21 at 20:10
How many parties are needed to compute multiplication with BGW?
Awarded Nov 20 at 17:55
Why are in asymmetric cryptography as many keys as people involved needed?
Awarded Nov 20 at 12:30
Is this problem based on discrete polynomials modulo $(x^3-1)$ strong?
Awarded Nov 20 at 11:35
Is there a point in storing hash or plaintext in the last column of Rainbow Tables
Awarded Nov 20 at 6:20
Generate private key from public key RSA
Awarded Nov 20 at 2:10
Does HMAC provide anything that AEAD does not?
Awarded Nov 19 at 15:30
RSA decrypt message with low public exponent (n = 187, e = 3 and C = 185) [closed]
Awarded Nov 19 at 11:10
Meaning of “integers modulo 4 ” in “Fully homomorphic encryption modulo Fermat numbers” scheme
Awarded Nov 19 at 10:45
Difference between Tag and Signature
Awarded Nov 19 at 9:05
Does the nonce really have to be hashed as part of the challenge in a Schnorr signature?
Awarded Nov 19 at 3:10
Is a Diffie-Hellman scheme in which parties always use the same public keys vulnerable?
Awarded Nov 18 at 17:05
Simply using password as a third “private key” for PAKE
Awarded Nov 17 at 1:00
Elliptic curve commitments mod p
Awarded Nov 16 at 22:20
are there more efficient methods than HMAC to achieve convergent encryption?
Awarded Nov 16 at 17:35
What operations provide perfect secrecy other than modulo addition
Awarded Nov 16 at 1:00
Why is the core ChaCha primitive not good for use in a CRCF? Why create BLAKE?
Awarded Nov 15 at 19:35
Merkle–Damgård transformation example
Awarded Nov 15 at 11:55
Entropy preservation through cryptographic hash function
Awarded Nov 15 at 0:50
Can a message encrypted with one AES-256-GCM implementation always be decrypted with another?
Awarded Nov 15 at 0:45
Is there a bulletproof way to know a file has been successfully decrypted?
Awarded Nov 14 at 19:45
Is using RSA with SHA-1 considered as secure as HMAC-SHA-1?
Awarded Nov 13 at 13:15
Zero Message Length HASH [duplicate]
Awarded Nov 13 at 10:30
Can an attacker exploit the nonuniform distribution of letters in a diceware password to improve a brute force search?
Awarded Nov 12 at 10:15
PGP double encrypt instead of signing?
Awarded Nov 11 at 16:45
DSA Vulnerability in ECDSA
Awarded Nov 11 at 9:30
Is it possible to execute elliptic curve encryption on small sensor-tags CC2650?
Awarded Nov 10 at 19:20
Why doesn't the ability to sample a single random bit imply the construction of a random oracle?
Awarded Nov 10 at 17:40
Is there another group structure that is suitable for RSA other than $U_{pq}$?
Awarded Nov 10 at 15:40
RSA - Calculating $d$ given $\varphi (N)$ and $N$
Awarded Nov 10 at 2:35
1 2 3 4 5 … 98