0
votes
2answers
64 views

Availability of a simple limited PRNG algorithm

I am in need of a really simple limited PRNG, that either exists or can easily be created in virtually any language on any platform. It takes only the initial seed, and is only expected to generate a ...
6
votes
1answer
611 views

Elliptic curves for ECDSA

I'm trying to implement parameters generation for ECDSA according to SEC1 v2.0: ...
0
votes
1answer
68 views

AES - Encrypting multiple blocks of files

On my site, users can download files which are stored on public hosting, so I need to encrypt them. A downloaded file is divided into blocks of 1 kB and I want encrypt them individually, using the ...
3
votes
3answers
180 views

How to perform frequency analysis of a substitution cipher using a Base64 alphabet

Let's imagine a cipher that works like the following: Plaintext is encoded to Base64. The characters in the encoded plaintext are substituted with a randomly shuffled character set(A-z, 0-9, -, _, ...
0
votes
0answers
55 views

Is there an “additive” proof-of-work?

I'm trying to find a proof-of-work algorithm with the following properties: If A(1) is a proof of work with Difficulty(A(1))=n (requires n basic operations on average), then one can find a proof of ...
2
votes
1answer
315 views

Forge CBC-MAC given the MAC of two messages and of their concatenation

I found this question about CBC-MAC forging and want to make sure I understand it: Let a and be be two strings of block length one. Suppose the sender sends $(a, \text{CBC-MAC}(a)), (b, ...
2
votes
1answer
218 views

Generalizing a CBC-MAC collision with a common final message block

I found this question from a textbook but I don't really understand what it is asking: Suppose $c$ is $1$ block long, $a$ and $b$ are strings that are a multiple of the block length, and ...
0
votes
0answers
47 views

Should I study advanced abstract algebra and more than elementary number theory to pursue a career in cryptography? [on hold]

Do I need to study advanced abstract algebra and more than elementary number theory in order to pursue a career in cryptography ? I've already taken a course in abstract algebra, but I'm wondering ...
0
votes
1answer
73 views

BruteForcer XOR (bfxor.exe) to attack 64-bit keys and longer

First of all, this is not a beginner's question since I already know a good deal about encryption and brute-force attacks. This is also no question on how to code programs for brute-force attacks ...
0
votes
1answer
40 views

Simple encoding function mapping integers [closed]

I am trying to analyse the following function. From an integer inputs it generates a series of 5 numbers. When looking at the some valid samples, clearly I can recognize some patterns (42 is ...
0
votes
0answers
34 views

homomorphic paillier cryptosystem vs Elliptic curve cryptosystem [on hold]

what are the pros and cons of homomorphic paillier cryptosystem compare to Elliptic curve cryptosystem??
1
vote
0answers
54 views

Modes of encryption for hard drives?

What are the currently recommended modes of encryption for large disks? Basic requirements would seem to be that you can update an encrypted sector independently of others, which rules out most ...
0
votes
1answer
80 views

Where have all the cypherpunks gone?

In 1992, cypherpunks was created as a mailing list for activists advocating for cryptography. Arguably, the cypherpunks mailing list was the foundation for the movement and the centre of it all. ...
0
votes
1answer
99 views

Secure Multiparty Sum in malicious model using threshold encryption

Suppose $n$ actors each hold a plaintext $p_i$. We wish to find $\sum p_i$, without leaking any information about individual $p_i$. Any actor (or any link in the network) could be controlled by an ...
0
votes
1answer
53 views

special public keys and modulo n

I just picked up cryptography and have some questions on RSA cryptosystem: Say there are two public keys (n, e1), (n, e2), e1 is coprime to e2. They share the same n. Is it possible to find the ...
0
votes
0answers
23 views

Should I use a key store to keep my symmetric keys

I'm maintaining an application which handles several keys to encrypt/decrypt information. Some keys are used to encrypt text (user passwords, some sensitive data in the db, etc). Some other keys are ...
2
votes
1answer
44 views

Do data-dependent rotations have any advantage over fixed rotations?

There are many ARX ciphers, however most use fixed rotations. I know data-dependent compared to fixed rotations are: patented harder to implement constant time more expensive in hardware harder to ...
0
votes
0answers
21 views

if using cbc+hmac dealing with small size of data(less than 128bit) , will it cause any problem?

if use AES-cbc,HMAC-SHA256, and there is some txt needed to be enc, and I divide this txt into small packages with variable length, then enc them. some of these package can be less than 128bit. Is ...
0
votes
1answer
607 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 ...
1
vote
1answer
39 views

Is the output of AES-CBC + MAC the same size as the input?

I use AES-CBC and HMAC-SHA256 to encrypt a text file. Will the output be larger in size than the input or will it be the same size? Is it more secure secure if the size of the output is larger?
1
vote
2answers
268 views

What does $\Pi$ represent in cryptography?

I am doing a project in cryptography and while reading a tag generation algorithm for files, I got stuck with the meaning of $\Pi$. The screenshot of the algorithm is inserted below. Here the ...
0
votes
0answers
31 views

Elliptic curve trapdoor function without modular arithmetic?

From what I understand, an elliptic contains a set points satisfying the equation $y^2=x^3 + ax + b$ together with the point at infity. It seems clear how multiplication with a scalar and a point ...
0
votes
0answers
41 views

Interactive assumptions not falsifiable?

Can someone explain why an interactive assumption is not falsifiable? Maybe I'm misunderstanding what the statement means, but isn't even a non-interactive assumption interactive, but just with a zero ...
2
votes
2answers
113 views

How well does breaking multiple DH key exchanges over the same group scale?

Suppose you are running a server with the Diffie-Hellman parameters (so the group G and generator g) generated once. There are ...
0
votes
0answers
34 views

How many characters per block in an El Gamal ECC cryptosystem?

While I look for how many characters that can be encrypted using the The elliptic curve ElGamal cryptosystem. of each block found for these lines. But I can not understand Actually in our case we ...
0
votes
0answers
28 views

Find the encryption method from the cipher and plaintext [closed]

I have been given iogdaybDfD which is a cipher of the word narcolepsy. I need to find the type of encryption that has been applied to narcolepsy to encrypt it to iogdaybDfD. Could anyone advise on how ...
5
votes
0answers
70 views

Malicious DH groups

Can an attacker construct a DH group, large enough to be considered secure (say, a modulus of 2048-bits), such that the group appears safe, but the attacker is able to solve the DLP in the group ...
0
votes
0answers
20 views

CP-ABE: structure of the secret key SK

I am working on Ciphertext-Policy Attribute based Encryption (CP-ABE) and I need to understand how a secret key looks like. For example, assume that the universe of attributes is defined to be ...
0
votes
0answers
31 views

Java RSA/ECB/PKCS1Padding encryption with .NET [closed]

I need to encrypt a password on a web site developped in .NET using a public key. The public key is delivered through a Java web service with the information: The key is a RSA key to be used with ...
-1
votes
1answer
56 views

Full Disk Encryption Alternative [closed]

Since developers of TrueCrypt discontinued their software, i'm looking for a alternative. It should be pre-OS, so that just after Bios, the Password is requested. Like in TrueCrypt. I took a look ...
0
votes
2answers
36 views

Bouncy jdk 1.51 Serpent KAT tests vs Nessie vectors

Having a little trouble getting Nessie vectors working with the Bouncy Castle SerpentEngine. Do the Nessie vectors require a mode or some pre-processing? Nessie Serpent 128, set 1, vector 0 reads: ...
10
votes
2answers
4k views

Impacts of not using RSA exponent of 65537

This RFC says the RSA Exponent should be 65537. Why is that number recommended and what are the theoretical and practical impacts & risks of making that number higher or lower? What are the ...
-2
votes
0answers
61 views

Crypto Challenge.sucked [closed]

The solution was hardened using MD5(MD2(SHA1([a-zA-Z]{6}))). Now crack this: e24b02c81cabe0d4af45f9ceaccde2c7 i couldnt crack it.
1
vote
0answers
72 views

How can I start the following crypto project?

(Cryptography: encrypting files before storage in the cloud): The project consists of a software implementation of a method to pre-process a file before storing it on a cloud storage server so that ...
2
votes
1answer
133 views

SHA-1 collision resistance

I'm researching on the SHA-1 algorithm and looking for reasons why it has fallen prey to differential cryptanalysis. I have read the research papers by Merc Stevens and Wang both of which describe how ...
0
votes
0answers
33 views

proving the security of 1 out of 2 oblivious transfer using AND function

Hello ladies & gentlemen, I need to improve the security of 1-out of 2 oblivious transfer using AND function method with a given info. use one-out-of-two oblivious transfer as building block, ...
2
votes
3answers
2k views

RSA Proof of Correctness

Can anyone provide an extended (and well explained) proof of correctness of the RSA Algorithm? And why is it needed? I can't say that this or this helped me much, I'd like a more detailed and newbie ...
0
votes
1answer
49 views

what does rsaSha512Sign do?

I have the following function: ...
0
votes
0answers
24 views

number theory and cryptographic hardness assumptions [closed]

Let p be a prime and e>=1 an integer. Show that the totient(p^e)=p^(e-1)*(p-1). Let p,q be relatively prime. Show that the totient(pq)=totient(p)*totient(q). (Dont use chinese remainder).
0
votes
0answers
66 views

Decrypting A Cipher Text without knowing the key or plaintext

i'm new to cryptography and i am doing a research based on cryptanalysis of vigenere cipher. If i have a ciphertext which is encrypted using vigenere cipher, is it possible for me to decrypt the ...
0
votes
1answer
31 views

plaintext distribution ,perfect secrecy cryptosystem

I have been trying to solve the next problem: let pi be a perfect secrecy cryptosystem with specific plaintext probability distribution. How to prove pi will have perfect secrecy for all other ...
0
votes
1answer
80 views

Collision resistant hash functions

Let (Gen1,H1) and (Gen2,H2) be two hash functions. Define (Gen,H) so that Gen runs Gen1 and Gen2 to obtain keys s1 and s2, respectively. Then define Hs1,s2(x)=Hs1(x)||Hs2(x). a) Prove that if at ...
1
vote
1answer
63 views

Many single-time use keys encryption scheme (not Shamir's Shared Secret)

I'm looking for encryption scheme with the following properties: There's a sequence of keys that can be used to decrypt the message Strictly only one key from the sequence is required to decrypt the ...
6
votes
1answer
894 views

How does GPG verify succesful decryption?

How does GPG (or other programs using the OpenPGP file format) verify that it has succeeded with decryption (for symmetrically encrypted data)? Is something appended to the clear text so there exist ...
0
votes
1answer
36 views

Rabin Cryptosystem Problem (variant)

My understanding of Rabin We have p and q which are distinct primes congruent to 3 mod 4. ...
0
votes
1answer
40 views

Show CBC-MAC construction isn't secure [closed]

Show that the basic CBC-MAC construction is not secure when used to authenticate messages of different lengths.
3
votes
3answers
124 views

Zero Knowledge Example using discrete log

I've been exploring Zero Knowledge Proofs and while the classic cave example by Jean-Jacques Quisquater makes sense, I find the discrete log example problematic. Since the Verifier is given p, g and ...
1
vote
2answers
105 views

Is it possible to find out whether a number is greater than another number without knowing the numbers?

Is it possible to construct a zero knowledge proof that one encrypted number is larger (or not) than another encrypted number without releasing the values of either numbers?
0
votes
0answers
48 views

Key generation in Digital Signature Algorithm

In DSA, one needs to generate two primes $p$ and $q$ such that $q$ is $256$-bit and $p$ is $3072$-bit and $p-1$ is a multiple of $q$. Question: How to generate such $p$ and $q$. Attempt: First, use ...
0
votes
0answers
69 views

CCA security of a system that splits messages and encrypts each packet

Propose a symmetric key based crypto-system for implementing a secure email system. This system is based on AES and CCA secure. Suppose that you have to encrypt a large message and that this message ...

15 30 50 per page