-1
votes
1answer
127 views

Attacking multi block MAC constructions

For variable-length messages, there are three different ways to generate the tags. $Tag = MAC_k(\Sigma_i m_i)$. $t_i = MAC_k(m_i)$ and $Tag = (t_1, ..., t_l)$. $t_i = MAC_k(i||m_i)$ where $...
0
votes
0answers
193 views

Strategies for securing public key storage on software

I´m kind of new in this so I apologize in advance for any noob mistakes (feel free to point it out) We are developing a licensing mechanism on our software, and I would like some advice. The ...
3
votes
1answer
121 views

Generic name for (?hash) functions of form $\{0,1\}^n \rightarrow \{0,1\}^{poly(n)}$

Consider a function $$f: \{0,1\}^n \rightarrow \{0,1\}^{poly(n)} $$ with the following properties: hard to invert, i.e. given $f(x)$, hard to find $x$ hard to find a collision, i.e given $f(x)$, ...
0
votes
0answers
182 views

Deriving a decryption equation

Consider a very simple symmetric block encryption algorithm, in which 32-bits blocks of plaintext are encrypted using a 64-bit key. Encryption is defined as C = (P⊕KL)⊗KR where C = ciphertext; K = ...
1
vote
1answer
169 views

FIPS-Compliant SHA2

I want to use SHA-512 for hashing in a system that must be FIPS-compliant. When I look at the FIPS 140 list of approved providers, I don't see SHA from any provider as being an approved algorithm, I ...
1
vote
1answer
233 views

Diffie-Hellman Application

Alice and Bob want to perform a Diffie-Hellman key exchange using the group $G$, a primitive root $g$, Alice’s secret key $k_A$ and Bob’s secret key $k_B$. In each case below compute the element of $G$...
1
vote
1answer
123 views

Is the idea of a known plaintext attack really that new?

As you can probably guess, I just watched The Imitation Game, which hasn't really gotten points for historical accuracy... During World War II, Turing and his team fret that they can't know the ...
0
votes
1answer
129 views

Prime modulus for RSA and sharing a secret?

According to this paper entitled "Using Commutative Encryption to Share a Secret" they define their modulus to be a large prime p, which is public. Both exponents are private in this case. According ...
0
votes
1answer
69 views

Self changeable key [closed]

If key changes itself when it send/receive message what would be could breaking method? So: $E: m×k$ in which $k$ is last generated key $D: c×k$ in which $k$ is last generated key $k{_n} = k_{n-1}×m$...
2
votes
2answers
400 views

Why does NaCL have different keys for signing and encryption?

I want to start using NaCL to sign messages that will go into a message queue, and I noticed that it generates different keys for each operation. Is there a reason for this? Can I not use the same PK ...
0
votes
0answers
63 views

Key establishment protocols other than Diffie-Hellman

Are there any key agreement/exchange/establishment protocols which are NOT based around the Diffie-Hellman protocol or handshakes using public key cryptograaphy? DH seems to form the basis of this ...
3
votes
1answer
179 views

Save the last cycle in GCM GHASH calculation

I need to implement GCM GHASH in hardware, using FPGA. The data bus is 640 bits, so I will use 5 adder/multiplier blocks in parallel. The message size is fixed and AAD is 0. A little example: ...
1
vote
1answer
128 views

Identity-Based Encryption consist of four algorithms. Extract phase is one of them and it is done by PKG or receiver?

The Identity-Based Encryption consist of four randomized algorithms: Setup, Extract, Encrypt, Decryption. The Setup phase is done by Private-key generator, Encrypt by sender and Decryption by receiver....
1
vote
1answer
664 views

CBC-MAC: is it secure to authenticate a fixed length ciphertext?

Suppose I have a fixed-length arbitrary ciphertext. To authenticate such ciphertext: I generate a random AES Key $K_{auth}$. Then I compute the CBC-MAC Tag of the ciphertext with $K_{auth}$. ...
0
votes
0answers
67 views

Are Barreto-Naehrig Curves suitable for pairing-based cryptography?

If Barreto-Naehrig Curves are suitable for pairing-based cryptography, can I use the library available at Optimal ATE Pairing?
1
vote
1answer
210 views

Simplified Example of ECC to use in the classroom

I have come up with the following rudimentary example of how ECC relates to asymmetric keys. Is this a valid explanation of ECC and its relationship to asymmetry? To only be deciphered by the person ...
1
vote
1answer
127 views

Finding $x$'s parity in the discrete log problem

Suppose $p$ is prime, and $g, a\in\mathbb F_p$ are given elements with $g$ a primitive root. The discrete log problem poses the task of finding an integer $x$ such that $g^x=a$. Show that even if $x$ ...
3
votes
0answers
109 views

How does CTR-ESSIV work?

I'm using Wikipedia and Handbook of Applied Cryptography as references. I know that ESSIV generates an initialization vector (IV) by combining a hashed key with the sector number. However, I only see ...
0
votes
1answer
67 views

Are passwords generated from sine vulnerable to certain attacks?

A friend mentioned that he used the sine of a number, i.e. sind(54), to generate long passwords. This way he only has to remember sine 54 and have a calculator to get his password back. I am wondering ...
4
votes
2answers
196 views

In a group, is it hard to calculate the base $g$ given $g^a$ and $a$?

Discrete logarithm, that is: calculate $a$ given $g$ and $g^a$, is assumed to be a hard problem in some groups. Is it also hard to calculate $g$ given $g^a$ and $a$?
0
votes
3answers
291 views

Simple multiplication as an encryption method

There was a time when I wondered about multiplication as an encryption operation. That was when I was thinking in terms of modular multiplication. But how about based around simple multiplication. ...
3
votes
1answer
143 views

Parameters for elliptic curve prime192v3

I'm looking all over the internet for prime192v3's parameters. I think I may have found them here, but it doesn't say what variable each number matches to. Is there some central place where I can find ...
0
votes
1answer
136 views

OpenSSL encrypted text length

OpenSSL block ciphers return length of the text as output of the encryption (envelope_seal()), and If I have to send the length over network, I append the length ...
2
votes
1answer
208 views

Hash function as secure as one-time pad?

We know that the one-time pad is provably secure as a cipher to encrypt some data. Is there an algorithm which does the same just as a hash function? Can we get a provably secure hash function? Maybe ...
1
vote
0answers
71 views

Boneh-Boyen like signature scheme

Full Boneh-Boyen signature scheme defines a pair of secret keys (SK) $a \in \mathbb{Z}_n$ and $b \in \mathbb{Z}_n$ and a pair of public keys (PK) $A = G^a \in \mathbb{G}$ and $B = G^b \in \mathbb{G}$. ...
1
vote
1answer
383 views

Additional Data in AEAD (Chacha20-poly1305 libsodium)

I have recently been playing with Chacha20-Poly1305 with libsodium, and all of the examples state the additional data portion of the tag is stored in plaintext when encrypted. But from what I can tell ...
5
votes
2answers
301 views

Is $f(x)\oplus x$ a one-way function?

Given that $f$ is a OWF and $|f(x)|=|x|$ for all $x$, is $g(x)=f(x)\oplus x$ necessarily also a OWF?
1
vote
1answer
989 views

Trivium example

I started learning cryptography from Understanding Cryptography book of Christof Paar and Jan Pelzl. Here is the problem I have solved but I want to be sure that it is correct. Assume the IV(...
1
vote
1answer
205 views

Misunderstanding Broadcast Encryption

I have a secret message which I want to encrypt such that any of several different keys can open it independently. The keys can't know about each other and it has to be able to work completely ...
1
vote
1answer
107 views

Why is knowing M not enough to break Blum Blum Shub?

In Blum Blum Shub, the generator is $x_{n+1}={x_n}^2 \mod M$ where $M=p \cdot q$, $p \in \mathbb P$, and $q \in \mathbb P$. Supposedly, knowing $p$ and $q$ is enough to break the system. But if I know ...
4
votes
1answer
233 views

Given $g^a, g^b, g^c, g^{1/b}$, is it hard to distinguish $e(g, g)^{abc}$ from a random value?

where $g$ is a group element in bilinear group $\mathbb{G}$. I understand it is very similar to the conventional DBDH problem, but $g^{1/b}$ is also known, possibly making it easier? Does anyone know ...
2
votes
2answers
220 views

Is there any advantage on encrypting the CMAC together with the message?

I'm reading a protocol specification where the procedure is to generate a CMAC, take the first 4 bytes of it, append this authentication tag to the message and then encrypt the message + CMAC together ...
0
votes
1answer
80 views

Stream cipher key length to send

I was being argued that stream cipher's key that is the length of the message must be sent to the destination for them to be able to decrypt the message. My point is don't you only have to send the ...
1
vote
1answer
85 views

Can you exchange a shared key without any hardness assumptions?

Imagine that P=NP, and one way functions don't exist. Can two people end up with a random shared key of arbitrary length, if every exchange is public? They have true RNGs, and know who they are ...
2
votes
3answers
275 views

Sage Vs C++(with NTL) for implementing cryptosystems

Is Sage a better alternative to C++(with NTL), for programming that involves math objects like polynomial rings in cryptosystems? I hear that Sage is an open source alternative to Magma. I have used ...
2
votes
1answer
172 views

Noisiest RF band for random number generation

I've been looking into the difference between PRNGs and proper RNG techniques. One that I particularly like is the idea of tuning a radio to a certain frequency and bandwidth and just listening to the ...
-1
votes
1answer
160 views

Generating cyclic group for Ciphertext-Policy Attribute-Based Encryption [closed]

I am doing Project under the topic CP-ABE.I need to generate a symmetric bilinear group Go of prime order p and with generator g...Then how to choose random elements from Zp....kindly anyone help me......
2
votes
1answer
67 views

What does K stand for in frequency analysis

It was from frequency analysis lecture and the professor mentioned but I cannot recall. The K value for English was .067, German was .076. The lowest K was Russian which was .056. When the frequency ...
6
votes
1answer
901 views

Does using modulo (%) affect quality of randomness?

I'm writing a small script that generates random non-signed decimal integers within a certain range of values. I'm using GNU od, with the following command: ...
0
votes
2answers
338 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 ...
0
votes
2answers
425 views

Client-Server application how can data be encrypted so only clients can read it

Requirements We are building a system that connects multiple clients through a restful API. It allows the creation of groups of trusted clients. We need a way to store group shared data encrypted ...
0
votes
2answers
113 views

Counter Mode with a sequence of zeros bits plaintext, is it secure?

I had a quiz last week in computer security course. There was a confusing question that I am still looking for a good and clear answer. First, I know that counter mode with a good block cipher is ...
1
vote
2answers
51 views

Automatic generation of secure passwords with the least inconvenience for a user

I'm working on a web site for a private company that should allow them to upload files, which will be later retrieved by their affiliates. The site will be available from a public Internet using ...
0
votes
1answer
72 views

Weak Boneh-Boyen Signature in Composite order group

In the paper Ring Signatures of Sub-linear Size Without Random Oracles, authors have remarked that the scheme is instantiable in composite order setting, too. I am attaching the following reference ...
0
votes
1answer
50 views

Using Permutation polynomial to compute a MAC

Is the following MAC secure? For a block $y_i$ in a file, we defined a MAC as follows: $Mac_i:PRF(k,i) \cdot g^{y_i \cdot r_i} \bmod p$. Where $p$ is a prime number, $g \in \mathbb{G}$,$PRF(k,i)$ is ...
1
vote
1answer
209 views

PRF based on the GGM construction

What's the differences between the concepts “pseudorandom generator” and “pseudorandom number generator”? In fact, I want to implement a pseudorandom function based on GGM's construction at http://...
0
votes
0answers
259 views

Python implementation of a blind signature scheme which doesn't involve RSA

RSA seems a bit creepy after the Snowden revelations and i'm looking for a simple python based blind signature library to fiddle around with. So far i've been unable to find anything. What am i ...
1
vote
2answers
143 views

How do you derive the lambda and beta values for endomorphism on the secp256k1 curve?

Note: This question was reposted from Bitcoin Stack Exchange, where it received alike answers. You can see a little background about this on this bitcointalk post by the late Hal Finney. $\beta$ ...
2
votes
1answer
556 views

SHA1 Partial Collision

I'm working on a little python script that reads in two fairly similar English sentences (they're in text files - reading them in) and I'm trying to force a SHA1 partial collision (e.g. first 32 bits ...
1
vote
1answer
954 views

What is the difference between a hash function and a pseudorandom function? [duplicate]

Read the title. I've seen in RFCs that some MAC functions are called "pseudorandom functions". What are those? How are they different than hash functions? Why can't a hash function be used instead?

15 30 50 per page