All Questions

0
votes
0answers
72 views

Cryptodefense ransom use RSA-2048. Any chance with known plaintext attack? [duplicate]

The "new" kind of ransomware invade your computer and crypt all your files using the RSA-2048. Personally, I have been victim of cryptodefense: 40000 files encrypted... I'm not going to pay anything ...
0
votes
0answers
32 views

Bit strength of combining hash functions? [duplicate]

Suppose there are hash functions H1 and H2 with bit strength of H1 and H2 is n1 and n2. A new good hash function is generated by combining H1 and H2. What will be the bit strength of these combined ...
0
votes
0answers
39 views

Does RSA work properly with non prime factors? [duplicate]

I know RSA should not use non prime factors for p and q for security reasons, but still, just out of curiosity, will RSA work 100% accurately i.e. message encrypted with one of the key produces same ...
0
votes
1answer
57 views

Block cipher encryption of decryption with the same key

With block chipers can I assume that Enc(k,Dec(k,m))=m Meaning if I decrypt something with a key k and then encrypt the result with the same key k, do I get what ...
0
votes
1answer
48 views

From Factorisation of semiprimes to breaching confidentiality

If someone or some group found an efficient way to factor large composites with two distinct prime divisors, would this make it easier to decode any messages?
0
votes
0answers
18 views

Vernam Cipher with Repeating Key [duplicate]

I'm doing a piece of coursework for Uni and the task is to break a Vernam Cipher. So we have a randomly generated key which is as long as the message. It gets used for all the messages sent from that ...
0
votes
0answers
52 views

How to know private key is computed from specific partial private key?

In a certificate-less cryptography, I have learned that – to resolve the key escrow problem of IBE – the concept of a partial private key is used. Now, consider the following Scenario: After ...
0
votes
0answers
37 views

Locally Dedcodable Codes and Private Information Retrieval

Does anyone know about Locally Decodable Codes (LDCs)? It seems the private information retrieval schemes that based on LDCs are computationally efficent (answer a query without processing the whole ...
0
votes
0answers
51 views

Re-encryption mixnet

Can an Elgamal-based re-encryption mechanism be used in a free route mixnet topology? Until 2006 it was not possible, but I couldn't find the later research results or achievements. Can anyone suggest ...
0
votes
0answers
33 views

Is it possible to weaken a bitcoin private key by 'using' it elsewhere? [duplicate]

What are the increased possibilities (if any) of being able to crack a private key given the following: The associated bitcoin (ECDSA Secp256k1-based) public key is known. The private key has been ...
0
votes
0answers
66 views

How to make a crypto-currency robust to 51% attacks?

For Example: In Bitcoin it is theoretically possible to double spend if you control > 50% of the computational power in the network. Also it is possible to apply "selfish mining" with far less than ...
0
votes
0answers
84 views

Any field in a PKI certificate where some text info can be stored?

I want to store 5-10 lines of Text Info in a PKI Certificate. All I want is that when using common tools like openssl command line or certutil from Microsoft, this text info should be displayed as is. ...
0
votes
0answers
103 views

m ∈ Zn \Z*n, RSA works but not secure

If you happen happen to have a message m ∈ Zn \ Z*n, RSA works but not secure. How likely is it going to happen? |n|=1024 bits |p| = 512 bits |q| = 512 bits.
0
votes
0answers
44 views

Encryption of numeric value using playfair

I am studying in CSE and in my recent exam paper, A question was asked as: Construct a playfair cipher for Plaintext: semester5 and key:technology. Generally as we are taught yet, there is no ...
0
votes
0answers
46 views

Private Set Intersection Polynomial Computation [duplicate]

I am trying to implement the protocol mentioned in Section 3.4 of “Efficient Robust Private Set Intersection” in Java. In the Second Step, the Client computes a polynomial of degree $n$ over the ...
0
votes
0answers
59 views

Plaintext patterns leaked based on single bit

Assuming that Elgamal is used as an encryption cipher, where lets say $p$ is 2048bit prime. Is it possible for an attacker to figure out $x$, a secret key, if any part of 2048 bits ciphertext and ...
0
votes
0answers
47 views

Key change and key derivation

there are two ways for key change: Key update and re-keying. Which of this methods use KDF (Key Derivation Function) for getting new keys.
0
votes
0answers
119 views

Going Blind, Group or Ring?

I have several problems approaching the following problem: Let's assume that we have Alice, Bob and Cathy. Alice wants to present a message to Cathy, showing her that someone else has signed it (Bob), ...
0
votes
0answers
77 views

Question Error Correcting Codes

Let $C$ be a code over the finite field $GF(2)$ with generator matrix $G$ and parity matrix $H$. Let $e+C=C'$ be a coset of code $C$. Let $S$ be a non-singular matrix and $H'=H\times S$. Finally, let ...
0
votes
0answers
70 views

Where can I find source code of a compiler that secures a circuit (or attemps to)? [closed]

In the paper “Multiparty Computation Secure Against Continual Memory Leakage”, on page 1239 under section “Using an LDS Compiler Instead of OCL Compiler”, the authors discuss why they decided to use ...
0
votes
1answer
104 views

Oracle DBMS_RANDOM algorithm?

Oracle DBMS offer builtin random number generator (pseudo to be accurate). DBMS_RANDOM is one of the available packages, it is however considered as insecure for cryptography. Do we happen to know the ...
0
votes
0answers
22 views

How to understand the Bilinear mapping with an example [duplicate]

An efficient bilinear map is given by $ e $: $G_{1}$ × $G_{1}$ → $G_{T} $. How can i prove this equation with the help of an example.
0
votes
0answers
35 views

In Merkle Damgard Constructoin, why do we add another block with value of number of blocks? [duplicate]

I'm trying to understand how can we find collisions, in simpler Merkle-Damgard constructions. consider my question as, what are the collisions for these cases of Merkle-Damgard constructions: we pad ...
0
votes
0answers
42 views

How to select parameters based on some condition

I am implementing a protocol for authentication where parameters need to be selected with $gcd(\mu,\phi)=1$ where $\phi=(p−1)(q−1)$. What is the best way to select the parameters while implementing
0
votes
3answers
357 views

Would it be possible to create a game where one would need to decrypt a simple encryption?

This might sound pretty weird, but I was thinking of a game a person could play alone with a pen and paper. I got this idea where the person would write a random four letter string on a paper, and ...
0
votes
0answers
27 views

Different between Shared Key and Common Key in DLP Application

What is the different between Shared Key and Common Key? Are they the same? Shared Key = Common Key?
0
votes
0answers
113 views

So what is quantum cryptography anyway?

I am having difficulty understanding quantum cryptography concepts. I've searched the internet and watched some videos on youtube explaining the topic, but it is still hard to understand how it works. ...
0
votes
0answers
34 views

Correlated or biased coin protocols?

There are a number of papers in the literature describing secure/fair coin flipping protocols. Unfortunately in my case, I am looking for coins that are epsilon-biased or epsilon-correlated. I am ...
0
votes
0answers
133 views

If H(m) = 0 for some m, how can a DSA signature be forged?

If we know for some message $m$ that $H(m) = 0$, how can we forge a DSA signature with only the public key? I got that $g^s*r = (g^x)^r$ where $x$ is the private key, but that's one equation with 2 ...
0
votes
0answers
38 views

Why doesn't this authentication protocol work? [duplicate]

I am a student taking a cryptography course so forgive me if this comes off as a silly question. This is an assignment question: Alice ------R--------> Bob Alice <-----[R]B------ Bob Alice ...
0
votes
0answers
226 views

Blum-Blum-Shub Cryptosystem

I am given $N$, which is Bob's encryption key. I was able to successfully factor $N$ into $N=p*q$. Alice encrypts a messages for bob and sends $a = [1,1,1,0,0,0,1,0,1,1,0,...]$ $b = 1545164156...$ ...
0
votes
0answers
226 views

How good is the RandomPool generator in Crypto++ library?

How good is the RandomPool generator in Crypto++ library? I never heard of it before… I wonder if there is a Fortuna C implementation that I could use in an Objective-C project. Also: How secure is ...
0
votes
0answers
101 views

becoming a cryptographer after math studies [duplicate]

After studying philosophy and being a philosophy teacher, I took back studies 4 years ago and I did a bachelor in maths. I'm in maths grad school now (I'm 32), and I would like to work in ...
0
votes
1answer
205 views

Why does WPA2-PSK use 4-way handshake instead of 2-way handshake

I don't seem to grasp why is the handshake for PTK in WPA2-PSK 4-way and not 2-way. Isn't it enough to just have these two steps: First party sends Nonce1 to the other party Second party sends to ...
0
votes
0answers
65 views

Example of CL PKC

I am trying to solve the example of algorithms of Certificateless Signature by manually and solving the mathematics of Algorithms but not succeed while doing mathematical calculations. Please ...
0
votes
0answers
43 views

Merkle-Damgard transform: necessity of the Length block [duplicate]

The Merkel-Damgard transform append the message length (in blocks) to the message itself and then computing the 'chained hash' algorithm. Does the last block (which contains the length of the ...
0
votes
0answers
29 views

Finding ECDSA public key from signature samples [duplicate]

How many plain ECDSA signature samples are needed to guess the corresponding public key from it like RSA? Otherwise, is it impossible to guess public key from ECDSA signature/encryption messages?
0
votes
0answers
72 views

hybrid PKE scheme CCA2 insecurity

I'm reading a paper here say: As we know, in hybrid PKE schemes XOR alone cannot perfectly hide challenge bit to the CCA2 adversary The author does not define hybrid PKE schemes. What is ...
0
votes
1answer
103 views

Why is appending the key to a mesage and then hashing that insecure if the hash isn't weakly collision resistant? [duplicate]

Suppose I have H(M|K) and that H is not weakly collision resistant. If I have a message mac pair (M,MAC), how is it possible to find another message mac pair (M2,MAC2)? My thinking for this problem is ...
0
votes
0answers
50 views

What is the default type of salt for encryptions in Heimdal Kerberos?

I am trying to figure out what the salting mechanisms are for various kinds of encryptions in Heimdal Kerberos. In section "4.11 Encryption types and salting" of the Heimdal Kerberos documentation it ...
0
votes
1answer
111 views

Blind Signatures

The verification algorithm given in blind signature. Should it work for both Original message and the signature on it Blinded message and the signature on it. If yes, then how can we verify if ...
0
votes
0answers
74 views

Why is Merkle-Damgård construction insecure? [duplicate]

I've been reading about SHA-1. I read that SHA-1 is insecure as it uses the Merkle-Damgård construction and the Merkle-Damgård construction is — according to Wikipedia — susceptible to a variety of ...
0
votes
0answers
161 views

How to safely sign a 6 characters String?

I have to decide, whether a document, which I am given, was correctly signed by a private key. my Ideas is to sign the document id using RSA with the private key and to print the following onto the ...
0
votes
0answers
110 views

RSA vs El Gamal digital signature. Which is more secure? [duplicate]

I'm reading about the notions of security concerning digital signatures and I can't understand whether RSA is more secure than El Gamal digital signature. Well, they are both prone to forgery, but I ...
0
votes
1answer
65 views

PKCS#11: Which CKK_types are supported by CKM_PKCS5_PBKD2?

On Solaris there's a function pkcs11_PasswdToKey() which is a wrapper of C_GenerateKey(). I made a simple test and it turned out ...
0
votes
1answer
565 views

Is it possible to determine a PGP public key from encrypted data?

Is it possible to find out which public key was used to generate the message? Scenario is like this : I got data which is encrypted with a public key. Now a "bad guy" hast the encrypted data, and ...
0
votes
0answers
64 views

Strength of Combining Hash functions [duplicate]

If I combine two hash functions, what will the impact on the strength of the resulting function. If I combine in following way: H1*H2 (multiply) H1 + H2 (concat) H1 Xor H2 H1 (H2) EDIT: Lets say H1 ...
0
votes
0answers
42 views

NIST Standard for Advanced Encryption Standard Algorithm [duplicate]

Possible Duplicate: Advantage of AES(Rijndael) over Twofish and Serpent What is the reason of NIST why Rijndael choose as the Advanced Encryption Standard
0
votes
2answers
101 views

Encryption algorithm designed to be easy to decrypt by machine but impractical to decrypt by hand

I am looking for - or considering the design of a new - encryption algorithm that does not use variable keys, such that it is easy for a computer to encrypt and decrypt any message regardless of its ...
0
votes
1answer
78 views

Cryptography system that limits the length of the encypted message

I have two devices which communicate via sms. This communication should now be encrypted. The devices can only send messages with the lenght of 160 characters. So i am looking for an encryption ...

15 30 50 per page