0
votes
1answer
127 views

How much (home PC) CPU time is required to generate a prime number of a given size?

How much CPU time is required on a typical home computer to generate a prime number of size 100 bit, 200 bit , 512 bit and 1024 bit using given random bits of the respective sizes? Please note that ...
1
vote
1answer
142 views

Strength of RSA with OAEP

In our current system we use an encryption solution based on RSA with OAEP padding. Key size is optional but default 2048. What is the general strength of RSA with OAEP? Are there know attacks that ...
-1
votes
2answers
120 views

Is there a client-side program to cryptography a HTML page and decode if correct password is writen? [closed]

I want to know if there is an easy way to do this: create a complete HTML page cryptography the text content (image is not important) ask user some password check the password with a cryptographed ...
1
vote
1answer
239 views

What is the algorithm behind PasswordDeriveBytes?

Microsoft has created an implementation of PBKDF1 in the PasswordDeriveBytes class. It can however generate more bytes than PBKDF1, which is limited to the number ...
0
votes
1answer
71 views

What is the difficulty of DLP in GF(P^Q) with a subgroup with a prime order of L

Given a finite field GF(P^Q), having a subgroup with a prime order of L (P,Q,L are all primes), how difficult is it to find the discrete log, is it related to P and Q or is it related to L, or to ...
0
votes
1answer
94 views

Using hash of plaintext as nonce in NaCl secretbox- bad idea?

I need a nonce to encrypt my stuff using NaCl secretbox. I will be transmitting the nonce along with the ciphertext, which I have been told is OK to do. It occurs to me that one could simply use the ...
3
votes
1answer
78 views

Is changing $H(R\mathbin{\Vert}A\mathbin{\Vert}M)$ to $H(R\mathbin{\Vert}A\mathbin{\Vert}H(M))$ in EdDSA secure?

EdDSA calculates $s=(r+H(R\mathbin{\Vert}A\mathbin{\Vert}M)\cdot a)\bmod\ell$ and $r=H(h\mathbin{\Vert}M)$, with $H$ being the hash function (SHA2/512); $B$ being the generator; $A$ being the public ...
0
votes
2answers
178 views

Where are the ChaCha20 test vectors/examples?

I see in the Salsa20 specification there are test examples throughout the document to help an implementer make sure every function works as designed. Consequently the whole algorithm would work ...
0
votes
1answer
146 views

Base64 with shuffled alphabet

I have a base64 'cipher' text, I know that in clear text is a hidden xml document (I do not know nothing about its structure), but the base64 aplhabet was somehow shuffled. Is there any smart way, how ...
4
votes
1answer
226 views

Isn't the security of EC curve 25519 126 bits?

The security of the EC25519 is given as 128 bits, but since the order of the group is 252 bits shouldn't the security be 126 bits? Given as half the magnitude of the underlying field, since DLP ...
4
votes
3answers
504 views

P = NP and current cryptographic systems

I've recently heard some people claiming that if the fact that P = NP is proven, most (all?) the current cryptographic algorithm considered secure like RSA will be unusable in secure systems. My ...
2
votes
1answer
52 views

Effect of CFB IV reuse

If an Initialization Vector (IV) is reused (under the same encryption key) in Cipher Feedback Mode (CFB), what is the effect upon security? I know there is some negative effect upon security, but I ...
5
votes
1answer
351 views

What criteria make the theta step of Keccak's round function reversible?

From what I've been reading, Keccak's round function is reversible. That's pretty obvious for the $\rho$, $\pi$ and $\iota$ transforms. For $\chi$ to be reversible, $x$'s range has to be odd — but ...
0
votes
2answers
106 views

Is it possible to use structures other than finite fields?

I have some difficulties to understand why we are using finite fields in cryptography. Why do we use field? Why not ring or group? Is that really necessary that the field is finite? Why not real ...
1
vote
3answers
308 views

Can you help me with this Random Number Generator function?

By someone's suggestion, I am posting this question from math.stackexchange.com. I want to find out a suitable function or algorithm, which can provide a random sequence like this… Input: $3$ ...
1
vote
1answer
34 views

Question about key verification

I am studying for network security exam. And in the slide about Key Management, under a heading Key Verification I see this: Key Verification Almost all cryptographic algorithms have some weak keys ...
3
votes
5answers
1k views

What is the SSL private key file format?

I was researching about how to encrypt with RSA. I understood everything but not the format of the private keys. In the phpseclib (RSA in PHP), you can import your private key (private.key format) ...
2
votes
5answers
1k views

Why is the private key generated first in public key crypto?

I'm still new to public key crypto. I'm trying to understand how it is that the private key is generated first in public key crypto? I would have expected the private and public key to be generated at ...
-1
votes
1answer
127 views

subgroup of quadratic residue

if a number is said to be a subgroup of a quadratic residue of Z∗p, can I affirm that it is a generator of a cyclic group ? ie, say i am looking for a number which is an element of order q in Z*p, ...
0
votes
1answer
120 views

CBC with a fixed or random IV

I have two probably quite naive questions: 1) Why, exactly, is it so bad to have a fixed (or predictable) IV in CBC mode? An example would be great! 2) Given 1), why is a random IV better? And if ...
-1
votes
1answer
124 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 ...
-5
votes
1answer
42 views

Many Time Attack [closed]

How i can XOR these two cipher texts encrypted by using same key First ...
0
votes
0answers
71 views

Are there any known inverse hash lookups for the zero string?

Just wondering, are there any known inverse hashes / hash lookups in common hashes (md5, sha1, sha2, etc.) for the zero string hash value? (i.e. bytes 0x00 00 00 00 00 ...) Or more specifically, for ...
2
votes
0answers
248 views

Difference between statistical PRNG and cryptographic PRNG? [duplicate]

What's the difference between a statistical pseudorandom number generator (PRNG) and a cryptographic-strength PRNG? I've seen a lot of PRNGs that are proposed for statistical uses -- e.g., ...
0
votes
1answer
189 views

How secure is file header encryption for large files?

I'm having trouble location information about whether or not encrypting a file's header is good enough. The files in question are media files that range in size from 500mb to 4GB. If I had no ...
0
votes
2answers
70 views

Discrepancy with reported key size for EDE ciphers in Qualys SSL Labs

The following two cipher suites were reported by Qualys SSL Labs as being 112-bit: SSL_CK_DES_192_EDE3_CBC_WITH_MD5 TLS_RSA_WITH_3DES_EDE_CBC_SHA However, all other references I can find say that ...
2
votes
1answer
448 views

Feistel cipher vs Substitution-permutation network - number of rounds

So I have been doing for the last couple of days comparison between Feistel cipher and Substitution-permutation network. Now I can say I know a lot about them and their similarities and differences ...
1
vote
3answers
820 views

Kryptos : K2. What is the origin of the “abscissa” keyword?

I'm studying the Kryptos sculpture with its cryptographic puzzles K1 to K4. Similar to the "palimsest" keyword for K1, the keyword "abscissa" for K2 was determined by brute-force. To better ...
2
votes
2answers
228 views

Subgroups generators with respect to group generators of composite order

If I have a group $\mathcal{G}$ of order $N=npq$ and subgroups $\mathcal{G_n,G_p,G_q}$ of order $n$, $p$, $g$ respectively and if $g$ is a generator of $\mathcal{G}$ why then $g^{nq}$ is a generator ...
3
votes
3answers
500 views

when do we need composite order groups for bilinear maps and when prime order?

Why we need bilinear groups of composite order? What's the special security property of the composite order group in comparison with one of prime order?To put it in another way when do we need ...
0
votes
1answer
86 views

Entropy in relation to computer security [closed]

I am going over some lecture notes and my lecturer is off sick, so not sure where to turn. There is this equation that I cannot understand as it's given with a couple of examples. I was hoping ...
7
votes
1answer
260 views

curve25519 weak points for contributory behaviour

The Diffie-Hellman on curve25519 is usually calculated using the base point $(9,…)$ which induces a cyclic subgroup of $G:=\{\infty\}\cup(E(F_{p^2})\cap(F_p\times F_p))$ with index 8, i.e. there is a ...
0
votes
1answer
190 views

Sophie Germain primes and safe primes

I am trying to find a list or table of safe prime numbers i.e. the ones that are based on the Sophie Germain primes i.e. $N = 2p + 1$ where $p$ is also prime. All I found till now is this database. ...
0
votes
1answer
217 views

How to calculate AES logarithm table?

I would like to know how to find multiplicative inverses in $\mathrm{GF}(2^8)$. I know how to multiply two elements of $\mathrm{GF}(2^8)$ (for example, I know that ...
0
votes
1answer
113 views

Split 32-bit LFSR into two 16-bit LFSR which xor to same sequence [duplicate]

Today I was thinking about exactly this. Is it possible, for a 32-bit LFSR e.g. ...
1
vote
2answers
113 views

What is the keyspace of ROT-13?

Today I was having a discussion with my cryptography lecturer about the keyspace of a ROT-13 cipher. He argues that the keyspace is 0 because it doesn't have a key. Could anyone explain to me why the ...
1
vote
1answer
92 views

Why are cryptographically secure hashes required for digital signing (RSA or DSA)?

I know that a cryptographically secure hashing algorithm is required for proper message signing (SHA-1, or I think SHA-2 is the current suggested algorithm). However, why does the hashing algorithm ...
2
votes
1answer
179 views

Deduplication: Encrypting the SHA-256 hash of a file chunk

I'm designing a data storage system that should be both able to deduplicate data that share the same encryption key, and be reasonably secure. I know that this kind of encryption quality can be ...
10
votes
3answers
2k views

In what way is XXTEA really vulnerable?

I'm looking at using the XXTEA algorithm to encrypt a small amount of data (say, less than 32KB) in the context of a software licensing algorithm. That is, we wish to make it difficult (not ...
4
votes
2answers
194 views

Share encrypted files without giving master key

Imagine I have four files I want to encrypt. I have master key, and from that master key I derive four keys, one for each file: ...
0
votes
2answers
153 views

What is a good way to demonstrate elliptic curve cryptography?

For school (high school) I am writing an essay on elliptic curve cryptography. The assignment needs to include a practical part, so I decided to write a Python class for elliptic curves. This class is ...
0
votes
1answer
59 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 ...
1
vote
3answers
110 views

Loss of data due to encryption

Could any kind of encryption method (AES, etc.) lead to data loss like in lossy compression? I'm interested if data (lossy compressed, lossless compressed, uncompressed) that is encrypted and ...
0
votes
0answers
184 views

fuzzy commitment implemenation to make secure biometric template

I want implement some ideas from an article that is about making secure biometric templates using fuzzy commitment and fuzzy vault. I need to implement just the fuzzy commitment (fuzzy commitment is a ...
1
vote
3answers
172 views

How to roll my own hardware RNG?

I am considering building a hardware RNG myself using cheap parts. Is this a good idea and safe enough? Random sources: amplified Zener noise from one randomly chosen ...
2
votes
2answers
454 views

How do I convert the definition of E-521 into a curve definition a la Bouncy Castle?

I am currently trying to create an ECCCurve for E-521. Unfortunately, it is not currently a named curve in the library I am using, so I will have to define it manually. I am using the definition of ...
0
votes
1answer
67 views

Interested in learning cryptography [duplicate]

I'm interested in learning cryptography outside the university(studying civil engineering). I was always interested in computer sciences and programing and in mathematics. I always try to program ...
3
votes
2answers
168 views

Encryption for a short packet size

I have an 8051 microcontroller with a radio that can send packets with up to 32 bytes and I want to have the messages encrypted. It is a sensor network so I really only want to send one packet per ...
6
votes
5answers
3k views

What is the difference between CSPRNG and PRNG?

What is the difference between CSPRNG and PRNG? Is there performance differential between them? For example: We use PRNG for key generation which is very expensive and CSPRNG for IV/nonce in block ...
0
votes
1answer
128 views

Is a Combined Linear Congruential Generator secure for cryptography? [closed]

I learnt that a Combined Linear Congruential Generator (cLCG) has better properties than a Linear Congruential Generator (LCG). For those who don't know what a cLCG is, here are three links that might ...

15 30 50 per page