0
votes
0answers
11 views

What is the best authentication logic to analyze RFID (randomized hash-lock) authentication protocol?

What is the best authentication logic to analyze RFID (Randomized hash-lock) authentication protocol, (Ban logic, GNY logic, SVO logic, VO logic, AT logic) or another one?
0
votes
0answers
22 views

Is there a format preserving cryptographically secure hash?

I want a way to encrypt strings (like words, names) but I don't ever want to (myself or anyone else) be able to decrypt the strings. I found that perhaps what I am looking for is a cryptographically ...
0
votes
2answers
122 views

Crytosystems used to generate public key certificate

Where can we find the cryptosystems used to generate public key certificate? Are the cryptosystems under the signature algorithm and signature hash algorithm? Do I need to analyze the packets ...
1
vote
0answers
34 views

What would happen if we discovered a way to factor numbers with large prime factors?

If we somehow found a way to factor any number, no matter how large, into its prime factors in the matter of seconds, what would happen to the internet? What would happen to the electronic devices we ...
1
vote
1answer
53 views

Is the reduction from left-or-right IND-CPA to real-or-random IND-CPA tight?

A modern trend in cryptography consists of defining security as rigorously as possible, and then designing schemes which are secure according to those definitions. Proving security comes in the form ...
0
votes
2answers
43 views

Will SHA1 or Other Hash Functions Ever Contain Quotes

I feel foolish asking this, but will the hash generated by SHA-1 or other encryption methods ever have the possibility of containing a quote? Or any other characters that may be escaped such as ", ', ...
0
votes
0answers
16 views

Is the half-homomorphic property of RSA a problem for blind RSA signatures?

For blind RSA signatures, is it problematic that RSA is half-homomorph? Take a scenario where blind RSA signatures are used for something like a voting procedure or this proposal: Lots of people, ...
1
vote
1answer
54 views

Defence against timing attacks

I know this is a difficult subject but would a good defense against timing attacks be not sending a message if the decryption or authentication fails? So if the attacker provides a wrong HMAC for ...
0
votes
0answers
13 views

how to use raw_input_file in dieharder , in binary mode (or decimal mode )

I have samples to be tested, they have fixed length , say N , N can be anything > 36. I want to input these samples as a file to test their randomness , I have one record per line eg : (...) ...
1
vote
1answer
70 views

How difficult is it to get a key using simple XOR

Recently someone gave me an algorithm as follows: XOR = Key XOR Random1 XOR Random2. They think that in order for someone to extract "Key" from XOR they would need Random1 and Random2.. but looking ...
0
votes
2answers
59 views

Find the prime factorization in the DLP

Suppose we have $g^x \equiv h \pmod N$ Where $N = pq$ and $p$, $q$ are distinct primes. Also $(p-1)/2$ and $(q-1)/2$ are primes. If we know what $x$, $g$ and $h$ are, is it possible for us to know ...
0
votes
0answers
11 views

Difference between Kerberos and GDOI? [migrated]

What is the difference between Kerberos and GDOI, I know first is more toward authentication and latter is more toward multicast key management, can I use Kerberose protocol in GDOI for server and ...
0
votes
1answer
110 views

How to compare between two cryptographic algorithms in terms of security? [on hold]

How to compare between two cryptographic algorithms (e.g. SHA-1 and SipHash) in terms of security? That is, how could one prove that algorithm X is more secure than algorithm Y?
2
votes
2answers
130 views

Which characters to take into account when calculating unicity distance?

I need to calculate the unicity distance of a block cipher. Assuming I know that the plaintext is an English message I considered using 53 as the size of the alphabet, since the message could contain ...
0
votes
2answers
105 views

Multiple encryption of part of block

Is there any security risk in encrypting parts of blocks twice? I'd like to get around block sizes and make encrypted messages just as long as the unencrypted ones: Block 1: Byte 0 - 7 Block 2: Byte ...
0
votes
2answers
80 views

Is CBC theoretically harder to brute force when compared with ECB?

Theoretically is CBC mode harder to bruteforce when compared with ECB? Assumptions We ignore computational cost for the XOR operations IV is made public
0
votes
0answers
34 views

AES mode scheme feedback [duplicate]

I've been studying encryption on a hobby basis, and wanted to know if I got this basic cypher construction right (this is another experiment, see the AES ECB experiment thread earlier). Encryption: ...
0
votes
2answers
47 views

AES key from encrypted text and VI

So I'm trying to figure out if it's possible to extract the private key if you have the ciphertext and the IV corresponding to that ciphertext. It's for some kind of a challenge, and can't really ...
0
votes
1answer
29 views

AES different modulo operations

I don't get the modulo 10001 operation in mixColumns so much. If I have to take the byte computations mod 100011011 anyway what leads me to a result of 4byte length, why do I need the mod 10001 ...
-2
votes
1answer
67 views

Vigenere ciphers : Need help for math analysis

I've been learning about Vigenere ciphers and then thought of another method to Encrypt and decrypt that. This's my method to encrypt : ...
1
vote
1answer
43 views

Koblitz encoding a message to a point, what is the “associated auxiliary base parameter”?

I am looking at the Koblitz method for encoding a message as an elliptic curve point. The first step given in the paper I'm reading is: "Choose an elliptic curve and its associated auxiliary base ...
4
votes
2answers
385 views

How do we compute IV+1 in CTR mode?

This may be a very simple question, but I have not found info about this in any place. My question is about CTR mode: When it says $IV+1$… How do we make this operation? For example, if I have the IV ...
4
votes
2answers
1k views

What is “Implicit Authentication”?

What is “Implicit Authentication” in the context of authentication methods? I searched the Web but could not find any article that describes this. If anyone can describe it, that would be a great ...
-5
votes
0answers
48 views

N= pq be a product of distinct primes p and q [on hold]

Let = pq be a product of distinct primes p and q such that p1i/2 and q-1/2 are both prime. Suppose you are given N, and you are also given an oracle which allows you to find a minimal solution to ...
-4
votes
0answers
31 views

Consider the congruence x e ≡ c (mod N) [on hold]

Let N be a positive integer with prime factorization N = p a1 1 p a2 2 · · · p ar r . Let c be any integer, and e be a positive integer. Consider the congruence x e ≡ c (mod N).
2
votes
1answer
103 views

AES as Integer Program

I read that AES can be broken by solving a Linear Integer Program (IP). From a given encrypted text, how can one construct this IP? How big is the system?
0
votes
1answer
30 views

One-one correspondance complete function

I am reading the paper by John B. Kam and Georges I. Davida (1979) titled Structured Design of Substitution-Permutation Encryption Networks. On page 749 it reads ...
2
votes
1answer
92 views

What is the advantage of using the socialist millionaire protocol to authenticate vs HMACing some random number?

Say Alice and Bob have a shared secret $s$. Alice and Bob establish an encrypted channel and verify that it hasn't been MitM'ed by exchanging $r_1$ and $r_2$, where $r_1$ and $r_2$ are randomly ...
1
vote
1answer
36 views

Performing differential cryptanalysis for randomly generated S-boxes

As far as I know, performing differential or linear cryptanalysis always requires a knowledge of the S-boxes' content and order. Yet in Bruce Schneier's Applied Cryptography, it is stated that random ...
0
votes
1answer
135 views

Predicting Google Authenticator OTP Codes

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
1answer
38 views

DH and PKI for KeyExchange

My question is fairly simple. I have more than two nodes which needs to communicate very efficiently from computational point of view. One of the nodes can become a coordinator between the nodes. ...
0
votes
1answer
62 views

Asymmetric sign in public enviroment

I have RTS game, where all players run game and server just relays messages. Game can generate and store text file on player pc. I want to allow some players to be moderators, so I need to sign or ...
0
votes
1answer
39 views

Will the complement of a 64-bit key and message produce the complement ciphertext if ECB is used in DES?

Say I have a 64-bit message/key: P1: 1011....... K1: 0101....... I run this message/key pair through DES in ECB mode and obtain some cipher that looks like the ...
2
votes
1answer
34 views

Recombination thresholds in degree reduction of multiplied Shamir shares

Shamir's secret sharing can be considered multiplicatively homomorphic, if one is aware of the fact that multiplying two shares of a (n,t)-threshold shared secret yields a share of the same secret, ...
4
votes
2answers
252 views

Is Chaocipher a secure cipher under ciphertext-only attack?

Chaocipher was invented by John F. Byrne in 1919. The algorithm was recently revealed – see Moshe Rubin's Chaocipher Revealed, the Algorithm (PDF). While a known plaintext attack successfully finds ...
3
votes
2answers
93 views

Power analysis and exponentiation by squaring

I am trying to understand how one can retrieve the secret exponent via a simple power analysis. Lets suppose that the exponentiation by squaring algorithm is implemented in its simplest form : ...
3
votes
3answers
446 views

128 bit 3DES Key and AES Key: what's the difference?

Apologies if this is really basic but I couldn't find the answer to this. I have heard some Info Sec colleagues talking about creating an AES key in preference to a DES or 3DES key but I don't know ...
1
vote
2answers
40 views

Signing Files vs. Signing File Hashes

What are the security pitfalls that may occur by signing a list of file hashes, versus signing individual files? In short, the security trade-offs between: ...
2
votes
1answer
40 views

Is format preserving encryption suitable for use with words or names?

Is it possible to use FPE to encrypt names and language words like 'Bob' 'the' 'tree', in order to preserve both length and format (like keeping characters within a certain range like A-Z a-z) The ...
1
vote
1answer
184 views

Creating serial key generator using ECDSA, how to get signature short enough?

I've written some questions in this stackoverflow and got great responses but now I'm trying to wrap it all together. I have for the last couple of weeks been building a serial key generator project ...
1
vote
1answer
26 views

How to choose the integer m in the general number field sieve (GNFS)?

Given an integer you want to factor $N$, GNFS starts by selecting a monic irreducible polynomial $f \in \mathbb{Z}[X]$ and an integer $m$ such that $f(m) \equiv 0 \text{ mod } N$. In practice, if $m$ ...
0
votes
0answers
26 views

BLAKE2 input parameters [migrated]

Being a newbie, I was reading papers on the recent crop of hash functions and BLAKE2 intrigued me. Then I wanted to play around with the "blake2s" code in the code package. If I were to implement a ...
0
votes
0answers
31 views

Pseudorandom function and hash function [duplicate]

What is the difference between a pseudorandom function and hash function ? I have already read the answer in this link What is the difference between a hash function and a pseudorandom function? but ...
1
vote
1answer
47 views

ccrypt and its security

I would like to know how secure is ccrypt to encrypt files (like images, videos and other non-plain text data) using single password of 20+ chars length. It uses Rijndael with 256-bit block size and ...
10
votes
1answer
9k views

How does RSA signature verification work?

I understand how the RSA algorithm works for encryption and decryption purposes but I don't get how signing is done. Here's what I (think) I know and is common practice: If I have a message that I ...
0
votes
1answer
67 views

Drawback of ElGamal encryption

I am trying to find out some disadvantages of ElGamal cryptography but I'm not able to figure out what's wrong with the algorithm. The only one I found is that a known-plain text attack is possible in ...
2
votes
0answers
37 views

What are the steps to decrypt a TLS 1.1 record?

My question is related to another question in Cryptography about TLS 1.1 and 1.2. I have read both RFC 2246 The TLS Protocol Version 1.0 and RFC 4346 The TLS Protocol Version 1.1. What I know is that ...
1
vote
1answer
53 views

How does ccrypt work?

On many Linux/GNU distributions CCrypt (ccrypt) by Peter Selinger is available as a command line utility to encrypt files. How does the protocol work and is it ...

15 30 50 per page