All Questions

given a bit b, how to generate shares [b] among n-party in the framework of SPDZ in an efficient way?

I'm trying to make my first RSA encryption/decryption using CNG. In 1 part of the example they add pick a chaining mode, I don't know if this is mandatory and when I tried to google about it I found ...

How do you decrypt this into an email address ? Njg2MTYzNmI2MTdhNmY2ZTQwNjQ2NTZjNmY2OTc0NzQ2NTJlNjM2ZjZk

Introduction of the cryptosystem Let's say we have a system with a central server SRV that is considered secure (communication with this server is secured too with ...

Newhope: Specifically, the message from Bob to Alice (the ciphertext) in NewHope-Simple requires only 2176 bytes (compared to 2048 bytes in NewHope); the message from Alice to Bob (the public key) ...

I am talking about integer lattices etc. They all seem otp or some batch of otps. Eventually, you would exhaust the encryption (after very long messages) and it would require a new key. Does this ...

In the "Introduction to Cryptography: With Coding Theory" by Trappe and Washington, in the chapter about DES algorithm the authors say that: "if a cryptosystem is such that double encryption is ...

I am trying to understand how we can have cryptographic schemes that builds on both secret sharing, which is build on top of a finite field, and bilinear maps, which are built on top of elliptic curve ...

I need to programmatically(using Python) validate whether the signature generated by using HSM RnG is actually random. Didn't found much content online, hence any help would be appreciated !!

I'm not a mathematician, and i would like to understand in the most concise way (if possible) why choosing linear S-Box functions makes the DES algorithm attackable. Thanks

I am looking at different alternatives to hash passwords in a Python app. First I was settling for Flask-bcrypt (https://github.com/maxcountryman/flask-bcrypt), but then decided to use Argon2. The ...

AESCCM- Couter with Cipher Block Chaining Message. As it uses cmac for generation for tag , which is internally aes-cbc (block cipher, need block size, may require padding) And Encryption is done ...

The NTRU crypto system requires quite long keys. For example with parameters N=439 and q=2048 the security is 128 bits and the key_size is 4829 bits. When the private key is encrypted with AES-256 ...

Consider a Plaintext P1 and Ciphertext P2, which is known to the attacker. If the attacker knows that the IV used in encrypting P1 in OFB mode is the same used to encrypt another plaintext P2, how can ...

In EEA and EIA, what exactly does the direction (uplink/downlink) indicate? It's confusing because for both encryption and direction, the direction has to be same.

Well, I guess that I have always been a little bit suspicious ... so to speak ... of the "official stories" about the difficulty of recovering Enigma message texts during WW2, because it seems to me ...

I am doing an assignment and I came across a question which asked "Why is it necessary when using modulo 26 to have a determinant which is not a factor of modulo 26. I have searched everywhere for ...

If so, what would happen? And if not, what are some limitations to it? The reason I am asking is because I just started getting into the cryptocurrency and am very interested in the cybersecurity ...

I am trying to create a web based vanity .onion domain generator. I already have the V2 onion working, but this V3 onion is causing me some real trouble. In my HTML I have... ...

In the "Introduction to Cryptography: With Coding Theory" by Trappe and Washington, in the chapter about DES algorithm the authors say that: "In a good cipher system, each bit of the ciphertext ...

I have the following data (represented as hex from binary below) where the lower bytes is controlled by attacker in the second case : ...

I'm working on this project where a client can send a message, now obviously sending it in plainText is not very smart. So I decided to Encrypt it with AES-CBC. Now, each time I encrypt something, ...

Are there any practical post-quantum aggregate / multi signatures? Currently, the aggregate / multi signature schemes seem to be limited to pre-quantum elliptic curve assumptions only, e.g., [BDN18], [...

I have some fields, similar to NAME, SURNAME, EMAIL, ADDRESS... I'm using NaCl for symmetric encryption. Is bad If I Encrypt every field with the same key and nonce? They are encrypted and stored ...

I have been wondering, what would happen if the coinbase developers agree to drain all the funds of all their accounts and run off into hiding? Its not like anybody will be able stop them or return ...

The symmetric-key encryption scheme from [1] is based on the LPN (learning parity with noise) problem. The definition of the problem is, informally, that the adversary cannot recover $\mathbf{s}$ from ...

Is there some algorithm that, given the Shannon entropy of a string, compute an estimation of the time that an average home computer will take to crack the password? Thank you.

So I recently started to look into cryptography and found the following question to cryptography scheme using $T = E_{S}(S \oplus M)$ It is said that this is not secure because you can have a ...

I'm considering implementing an authentication service without storing users' passwords/hash. I want to use a key derivation function with a corresponding username...

As I'm going through NIST-SP-800-90Ar1 spec for DRBG, I found the mention of security_strength in all of the 3 specified construct in the document: Hash_DRBG, HMAC_DRBG, CTR_DRBG. However, they're all ...

I'm a complete newby, so please pardon my ignorance when it comes to basic cryptography aspects. My question is whether a biometric passport with Active/Chip Authentication (AA or CA) can be used to ...

I've rewritten the question as below. Knowing that through PBKDF2 I can derive a key pair based on username/password and a salt repeatedly, and argon2 seems to be a better hasing algorithm, I wish to ...

I’m not talking about if a collision can be found but even simply exists. The point is since it’s shorter than the length of the hash (since I’m talking about keccak256), normally there’s a hash ...

I'm using Charm to implement a scheme and I know it has "SS512", "MNT159" and "prime192v1". I don't know if Charm includes BN curve? If it doesn't, how to implement it with Charm.

How much would using AES-CTR like 3DES improve security? Like so (Using a 512-bit key split into two; $K_1$ & $K_2$, and seperate nonces for all stages): ...

I found an old .rar file on my computer but I couldn't remember the password exactly. I had a rough idea of what it was, so I wrote a program using 7ziplib in c# to brute force a bunch of permutations....

I want to encrypt data in AES with mode CBC and in Padding PKCS7 I'm having trouble displaying encrypted text ...

I want to derive a list of sub-keys derived[t] from a master key mk by a key derivation function ...

I want to attempt creating a decentralized dead man's switch, so I'm looking for an asymmetric encryption scheme, with the following properties (ideally), or something close to them: There is a group ...

I am reading about "Bingo voting" (Wikipedia, Paper), and I'm not understanding how it is secure against a corrupt election authority. If the election authority knows all the dummy votes $N_j^i$, ...

Recently I've been reading papers about MPC protocol, but when I read the paper by Zahur, S., M. Rosulek, and D. Evans. 2015 Two Halves Make a Whole- Reducing Data Transfer in Garbled Circuits Using ...

**the encrypted text is: UAMN PRUC LPLB IPLO UHXR DODN JSBI DCDK DAFK VJCM YYFA YHJU MULA **

Consider the following three stage interactive zero knowledge proof in round $i$ The prover sends some commitment $a_i$ to the verifier. The verifier picks a challenge $c_i\in \{0 ,1\}$ Depending on ...

I don't understand relation between zero knowledge proof with 3 properties : completeness, soundness and zero-knowledge and sigma protocol with 3 properties: completeness, special soundness and honest-...

I have some embedded device for which I want to sign and encrypt firmware files. Firmware updates are generated by me and may be installed by the customer. The encryption is supposed to protect the ...

I'm trying to estimate the probability that Pollard's p-1 factorization in its two-stages variant finds a factor of an RSA modulus product of $k$ random $b$-bit primes, as a function of the bounds $...

I managed to decrypt the following message with vigenere but I did not manage to have the token at the end knowing that it contains 24 characters. Fkhuv djhqwv, Eudyr ! Yrv plvvlrqv rqw o'dlu gh vh ...

CTR is amenable to parallelization because you can split the message into chunks, each chunk having a range of counter values associated with it, and encrypt (or ...

How can i prove that the Initialization Vector is always set to zero in the Cryptool when using CBC or ECB/DES mode?

I read the zcash paper recently. But I have been puzzled by a question. How did the authors prove that the coin commitment appears as a leaf of a Merkle tree with root rt? Apparently, the authors ...