1
vote
2answers
153 views

P10 to P8 in S-DES

I am new to cryptography. During my learning I am facing a problem with S-DES. I am confused where P10 to P8 come from, and I’m ...
3
votes
0answers
196 views

Pseudo-Hadamard transform, most significant bit

For clarification: The Pseudo-Hadamard transformation is a reversible transformation of a bit string that provides cryptographic diffusion. Splitting a bit string (with bit length of $2n$) into two ...
2
votes
1answer
149 views

Berlekamp-Massey to construct minimal LFSR

Given the sequence 0010001111 (or any other, not homework, but exam practice), how do you use the Berlekamp-Massey algorithm to construct a minimal LFSR? I have read several definitions of how ...
6
votes
3answers
229 views

Why do “nothing up my sleeve numbers” have low entropy?

As a preface, forgive me for some of the links being from Wikipedia. I realize that academia frowns upon this. I came across this article about "nothing up my sleeve numbers". In it, it says: ...
2
votes
1answer
76 views

Is concatenated data hashed with scrypt vulunarable to a length extension attack?

scrypt takes a salt, and a password plus some cost paramters to generate a key. So say we define it as this: key = scrypt(password, salt, cost) I am interested ...
2
votes
1answer
107 views

Is it possible to combine two operations rotation and xor?

I can see many xor and rotation operations in cryptography. I just want to make some algorithms fast. So, I'm looking for a way to combine between xor rotation operations. I don't know if it is ...
3
votes
1answer
244 views

What is a generator?

I am trying to read up on the math behind DH and ran into the word generator used a lot. I am not sure what it means. Can someone explain? I see this question where the OP talks about g as the ...
2
votes
0answers
47 views

space complexity of quantum collision search

Is there a known way to reduce the space complexity of quantum collision search beyond what is offered by the built-in time-space tradeoff, while keeping the time complexity significantly below what ...
3
votes
2answers
153 views

Associative standard cryptographic hash function

I am looking for a standard hash function which satisfies the following property: A hash function $H(a,b) = F(h(a),h(b))$ with $h$ (within $F$) any standard cryptographic hash function and $F$ an ...
3
votes
2answers
431 views

Shamir's secret sharing scheme - type of channels

For information theoretic security in Shamir's [m,m] secret sharing scheme, do i need both authentic and confidential channels? Another related query is ;is it true that if the channels are only ...
1
vote
1answer
100 views

Low level explanation of how a message is sent via RSA

I understand that RSA encryption uses this formula: C = M^e (mod N) public key is e and N N is pq - p and q are private key. mod N makes above function one-way ...
7
votes
1answer
394 views

Is TEA considered secure?

Wikipedia claims that the best attack on the surprisingly simple TEA block cipher, that isn't a related-key attack, has a time complexity of $2^{121.5}$. So despite how unsophisticated the cipher ...
1
vote
1answer
251 views

modulo operations in crypto algorithms

Am not a mathematician. Every crypto specification I see uses the modulo operation. For example RSA - If $e$ is the public key and $m$ is the plaintext with a modulus $n$ - the cipher text is $c = ...
5
votes
2answers
122 views

Is it possible to construct a secure block cipher of size $2n$ given a secure block cipher of size $n$?

Given, say, the Blowfish block cipher, which is considered secure but only has a 64-bit block size, can we construct a secure block cipher of 128-bit block size? Say we run the key through two KDFs, ...
2
votes
1answer
96 views

RSA private exponent primality

I know that the public exponent is always a prime, but what about the private exponent? Is it always a prime too?
2
votes
1answer
118 views

Is there a number of tries after which Hashcash is guaranted to be solved?

Hashcash is a proof-of-work system in which the Sender needs to find $Y$ such as the first (let's say 20) bits of $H(X+Y)$ are zeros where $H$ is a one-way hash function, $X$ is a fixed value and $+$ ...
2
votes
1answer
545 views

Is AES key length a size of the key or entropy?

While educating my self I'm having hard time to understand what an 128 bit AES key actually means? Is it a key length or entropy? Please explain to me trough following example (assuming AES): ...
2
votes
3answers
838 views

Problems with using AES Key as IV in CBC-Mode

I'm a pentester and currently analysing a web application which are using some strange encryption scheme. The point is: They encrypt using AES-128, generate a (not cryptographic secure) key and use ...
-1
votes
1answer
117 views

How to benchmark custom crypto with OpenSSL benchmark suite? [closed]

OpenSSL benchmark suite currently tests the speed of algorithms supported by the library like md5 sha1 sha256 sha512. What if we have a custom crypto algorithm "abc" . How do we benchmark its ...
1
vote
1answer
158 views

Breaking RSA when some bits of one prime are known

RSA primes are 100 bit. You know first 80 bits of one of the primes. In this system, come up with an efficient way to decrypt the cipher-text. This was the question on my quiz. I'm not sure how ...
4
votes
2answers
494 views

What are Cryptographic Multi-linear Maps?

I've encountered this term many times in the fields of Fully-Homomorphic Encryption and Obfuscation. I want to learn those subject and Cryptographic Linear Maps seems to be an obstacle in the way. ...
3
votes
1answer
933 views

ECDSA vs RSA: Performance on Android platform and surprising results

For our privacy-preserving protocol, an encrypted channel is established. In order to protect our system from man-in-the-middle attacks, signature-based approach is used. After we've implemented it ...
1
vote
0answers
35 views

What constitutes a “description of B” for probabilistic encryption as defined in Cryptology 6.3.4?

On page 21 of the Rivest's Cryptology chapter, he defines a trapdoor predicate as a boolean function for which it is easy to choose an x such that ...
1
vote
0answers
57 views

Special random distribution algorithm

I am implementing ring signatures as a part of an authorization system. Since the number of users could get high enough to make computation on end-user devices infeasible, I am thinking of ...
1
vote
3answers
218 views

Are hash functions chaotic?

I'm looking into "bitcoin like" mining processes. Say a security process uses a hash of data as proof that the data was known at some point in time. From what I understand, hash functions are ...
5
votes
1answer
537 views

How to solve cipher encrypted with Vigenère + Columnar Transposition?

Vigenère's weakness is Kasiski's test and index of coincidence. However, if you put columnar transposition on top of Vigenère, that weakness is gone. The text is now shuffled and you can't search for ...
1
vote
0answers
80 views

RSA Key Blinding

I was looking the answer to the following question (Timing attack on modular exponentiation), discussing the Private Key Blinding as a countermeasure for timing attacks. Therefore I'm asking if ...
1
vote
1answer
86 views

Initialize the eight working variables SHA256

I have a little confusion in understanding explanation of SHA256 by FIPS a, b, c, d, e, f, g, h are being initialized as (this is what i don't understand) 2 . ...
4
votes
1answer
129 views

Generating unsigned, bounded random value using signed bounded random values

Use case: I have a random number generator that can generate random numbers in a range that is limited by a number $x$, say $x$ ranges from $2$ to $2^{(n - 1)} - 1$ exclusive. In this case $n$ is ...
1
vote
0answers
52 views

Performance analysis of roaming authentication protocol using pbc library

Recently, I have surveyed a few research papers related to roaming authentication protocol for wireless networks. For example: “Efficient Privacy-Preserving Authentication in Wireless Mobile Networks” ...
1
vote
0answers
23 views

Is TLS_RSA_WITH_RC4_128_SHA still a secure cipher to use? [duplicate]

I have read numerous times that the RC4 cipher itself is considered broken in TLS. Still many websites are using the TLS_RSA_WITH_RC4_128_SHA configuration even to date. Now, I know that sometimes ...
-1
votes
1answer
111 views

How can the key size be calculated [closed]

If the decrypting key is 448, then what is the key size? Suppose I am encrypting a plain text with a key by choosing some random numbers between ...
2
votes
2answers
704 views

Does the secret key used in AES have to prime?

I’ve looked around this site and the web quite a bit, but can’t find a definitive answer on whether or not the secret key $k$ used in the AES crypto-system has to be a prime number? Or can you just ...
1
vote
2answers
90 views

Preimage of SHA512 with a known suffix

Is it possible to figure out what $arg1 is if I know both $arg2 and $arg3 in addition to ...
0
votes
1answer
161 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 ...
4
votes
1answer
161 views

Hash collision resistance of $\mathcal H^\prime(m) = \mathcal H(\mathcal H(m)|m)$

So far as I can find, every method better at producing hash collisions in cryptographic hashes than generic collision search involves finding some metric for the distance between two messages' hashes ...
1
vote
0answers
88 views

The advantages of Merkle Signature and One time Signature

In Merkle Signature, it also requires one-time signature to be used once for a message. The signature in Merkle scheme is even longer compared to Lamport one time signature. The verifier also has more ...
2
votes
2answers
146 views

Is it necessary to generate a private key for each encryption process?

I read about Asymmetric key cryptography like EG-ECC , RSA, ECDH. I understand the concept of mathematics to these algorithms. But I have wondered about the public key for sender and private key for ...
1
vote
1answer
81 views

Key exchange if forward secrecy is not an issue

Let's say that we have a cryptosystem where Forward Secrecy and Man-In-The-Middle attacks are not an issue, purely hypothetically. Would it be correct for a key exchange with any given public-key ...
1
vote
1answer
107 views

Encrypt HDD with keyfile and password and allow backing up the keyfile with secret sharing

I want to: Encrypt my whole HDD with a keyfile and a password (meaning that both are required to decrypt it), Be able to back up pieces of the keyfile in several distant locations using Secret ...
1
vote
0answers
71 views

How to decrypt a text which is ciphered same length key? [duplicate]

I have ten piece of ciphered texts. I know that they ciphered with a same-length key. Any idea how I can decrypt the ciphertexts? What kind of algorithms should I use? What are the points of taking ...
1
vote
1answer
112 views

DH key exchange with only one end authenticated

We know there is a man in the middle vulnerability with unauthenticated DH key establishment. And the way to negate that is to use authenticate the keys used. But what if I only verify the signature ...
0
votes
2answers
267 views

Why is ElGamalEngine in bouncy castle restricting input data to be less than the length of the group parameter p?

I am currently using the ElGamalEngine of bouncy castle to implement exponential ElGamal for the purpose of making ElGamal additively homomorphic. To do this i raise the message to be encrypted to the ...
3
votes
0answers
105 views

FHE over the integers - Is that paper's scheme known to be insecure against quantum adversaries?

I was reading the paper Fully Homomorphic Encryption over the Integers, and started wondering if there is a known quantum attack on their main scheme, because There is an efficient quantum attack ...
1
vote
2answers
174 views

How to retrieve the plaintext of a substitution ciphertext?

So the other day, I was piqued by a ciphertext that was trivially encoded through substitution. Solvable only because we can use our eyes to determine word boundary word detection, etc. Trawling the ...
1
vote
1answer
44 views

Computational Diffie-Hellman problem over the group of quadratic residues

Suppose that $N=pq$ where $p$ and $q$ are safe primes. $\mathbb{QR}_N$ is the group of quadratic residues which is a cyclic group with order $\frac{\phi(N)}{4}$. Let $g$ be the generator of ...
8
votes
1answer
461 views

Cryptographically secure keyed rolling hash function

I could not find any mention on the Internet of a proven/known cryptographically secure keyed rolling hash function (ie rolling MAC). Has the question been studied, is it possible to build one ? By ...
1
vote
2answers
166 views

Point addition and doubling in Ed25519 (ref10)?

I just migrated CodesInChaos' C# port of Ed25519(ref10) to Java, and everything works fine. (I.e. I get the same results for key generation, signature and verification.) Now, I would like to do a ...
1
vote
1answer
70 views

Symmetry between a public and a private key

I know that the private and public key in assymetric cryptography are different and the public is used for encryption while the private for decryption. My question is if they are symmetrical to each ...
3
votes
2answers
333 views

Number of keys when using symmetric and asymmetric encryption?

Quoting part of my homework/assignment: How many keys are required for secure communication among 1000 person if: Symmetric key encryption algorithm is used? Asymmetric key encryption ...

15 30 50 per page