0
votes
0answers
61 views

AES/CBC fixed Initial vector use-case [duplicate]

I am using AES/CBC to encrypt my http cookie. I never encrypt the same cookie value twice so my understanding is I don't need to use a random initial vector - using a fixed initial vector is fine for ...
0
votes
0answers
86 views

Looking for crypto with derived keys?

I am looking for cryptographic algorithm or combination of them. Basically I need an algorithm, which can generate private key and for this key can be computed multiple keys based on some seed. So a ...
0
votes
0answers
77 views

Can you determine an unknown value when it is combined with a known value and you are given the resulting hash? [duplicate]

Say I have a string that I want to keep hidden. You can then enter a known string which is added to the end of the hidden string and you are given the sha256 hash of the combined string. If you were ...
0
votes
1answer
197 views

RSA, finding p,q [duplicate]

If the public key $(e,n)$ and the private key $(d,n)$ are known, what is the easiest way to find the primes $p$ and $q$? When $n$ and $\phi(n)$ are given this is easy to solve. But I can't manage it ...
0
votes
1answer
193 views

Predicting Google Authenticator OTP Codes [closed]

I use Google Authenticator to generate OTP codes for logging in. As you know, the numbers change every 30 seconds or so, and (AFAIK) use an RSA key to generate those numbers. If someone were to ...
0
votes
0answers
76 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
34 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
1answer
54 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
39 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
36 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
48 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
141 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
88 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
87 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
222 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
35 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
3answers
385 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
44 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
221 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
47 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
259 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
107 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
0answers
124 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
1answer
164 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
2answers
202 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
85 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
201 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
114 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
84 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
0answers
69 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
46 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
1answer
69 views

Which one these alternatives using authentication and encryption will solve this multiple-user database problem?

Which one these alternatives using authentication and encryption will solve this multiple-user database problem ? I'm trying to understand the field of cryptography, so I've started reading a ...
0
votes
1answer
97 views

If classical ciphers are used with compressed plaintext, how much does it make frequency analysis attack harder?

Classical ciphers, such as Vigenère cipher, are weak and no longer be used. They can be broken by using frequency analysis, that is a well-known fact. But, the frequency analysis often depends on the ...
0
votes
2answers
464 views

How secure is it to use password as AES key?

I am developing a steganography app where user encrypt any file into an audio file. The user can enter a password to protect the hidden data. The same password is converted as a 256 bit key and the ...
0
votes
1answer
103 views

Negative exponents in Shoup's threshold RSA?

I'm trying to implement threshold RSA operations, starting with decryption based on Peeters, R., Nikova, S., & Preneel, B. (2008). Practical RSA Threshold Decryption for Things That Think. ...
0
votes
1answer
90 views

Public key encryption [duplicate]

I am not getting whole idea behind Public Key Encryption technique. As according to fact, public key encryption method uses two keys a public key known to everyone private key known only to recipient ...
0
votes
1answer
71 views

How to establish if a string contains a message

If you have a string S, then the string can be composed of four things: cleartext 'random' data encrypted data compressed or otherwise non-encrypted, but modified, cleartext If you want to see if ...
0
votes
1answer
105 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 ...
0
votes
1answer
336 views

What is the exact purpose of length padding in Merkle–Damgård hash functions? [duplicate]

Is a length padding technique in a hash function used to avoid length extension attacks ?
0
votes
1answer
1k 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
1answer
52 views

Brute forcing the secret key in Elgamal encryption

Crypto noob here, I am attempting to do this programming challenge. I do not have the secret key that is used to decrypt the message. However, the key is small enough for a brute force approach. I am ...
0
votes
1answer
53 views

Share two secrets between two parties

Alice has a secret A, Bob has a secret B. They have a secure channel and a MAC. They each want to know the other's secret, but don't particularly want to give up their own. However, neither will not ...
-1
votes
1answer
193 views

Should I use RSA encryption since RSA is said to be broken by NSA? [closed]

I am developing a simple web app that uses asymmetric encryption, but I am not sure whether to chose RSA for the reasons mentioned above. What are your suggestions? Also if I decided to go with RSA ...
-1
votes
4answers
554 views

Do Brute-Force Attacks and Cryptanalysis refute Kerckhoffs's principle? [closed]

According to Kerckhoffs's principle "A cryptosystem should be secure even if everything about the system, except the key, is public knowledge." Now I want to throw in a provoking formula of mine which ...
-1
votes
3answers
655 views

Padding of Original Message in MD5

what should I do if my original message is greater than 64 bits? what is the process of padding in MD5? As described in Internet Security: Cryptographic Principles, Algorithms and Protocols, page ...
-1
votes
3answers
786 views

Encryption technique performance evaluation

I've come up with a light weight bit wise encryption algorithm and seems good. Ive tried it with text and image input. But I've the following questions I would like to ask What do you think of bit ...
-1
votes
2answers
245 views

How fast would a polynomial time factoring algorithm compute?

I know factoring is the chief means of breaking RSA keys. I know an algorithm that runs in polynomial time would be able to break an RSA key pair "quickly". But how quickly is "quickly"? Note, I'm not ...
-1
votes
3answers
22k views

Uncompress password protected WinRar file without password

I would like to know how to extract contents of the password protected WinRar file without the password. I have downloaded that WinRar file from a file hosting website and found out that it was ...
-1
votes
1answer
211 views

Does a playlist of songs or movies mixed together contain enough random enough for OTP key material?

Ok hypothetical scenario. Lets say I want to generate a lot of key material quickly for a one-time pad. This key material will be divided up and used for many different messages in the future. I ...
-1
votes
1answer
135 views

Which block cipher mode does the experts use? [closed]

I want to know which "block cipher mode of operation" does the experts use? I don't want to use ECB or CBC because add padding and padding mess up my code. So which one does the experts use. /Thanks ...

15 30 50 per page