1
vote
1answer
52 views

TPM authorization Digest calculation

I am going through Steven Kinney's book; "Trusted Platform Module Basics", and pp 90 - 92 discuss how to calculate the authorization digest. He talks about 1H1, 2H1, 3H1, and 4H1 fields which I do not ...
2
votes
0answers
55 views

how to decrypt hidden text under numbers? [closed]

got a question as follows - how to decrypt below in to letters knowing that crypting language is 469 and it base ofcourse on mathematic. 46781! 9063376290 3222011 677 80322429 67538 14805394, 6880326 ...
0
votes
3answers
150 views

How to convert RSA public keys to one key to use for text hashing?

I've recently asked a question about RSA encryption. One of the things that I don't understand is the usage of two public keys. In the example on Wikipedia, a message is encrypted like: ...
8
votes
1answer
153 views

A self-decrypting block-cipher

If I have a block-cipher like for example AES, a plaintext $x$, we use different function to encrypt and decrypt : $\text{encrypt}(x) = y$ , $\text{decrypt}(y)=x$. Now, if we build a function with a ...
3
votes
0answers
490 views

Which is/are the strongest known Fully Homomorphic Encryption scheme(s)?

As it is discussed here that the highest security any homomorphic encryption scheme is at most IND-CCA1, Is there any known fully homomorphic encryption scheme that achieves this security level? Out ...
5
votes
2answers
174 views

Security game oracle queries

Concerning private key (symmetric) IND-CPA game definition: Attacker $A$ queries the encryption oracle polynomial number of times. $A$ sends the challenger $C$ a message pair $m_0$ and $m_1$. $C$ ...
2
votes
2answers
116 views

How do you communicate the hash function used with RSA signing?

When it comes to RSA signing, I understand why you need to hash the data before signing it, but don't you need to communicate what hash algorithm you use to whoever will need to verify the signature? ...
4
votes
2answers
174 views

Curve25519 - Alice can decrypt her own message to Bob?

I'm developing an application with multiple clients and one server. All clients will have the same hard-coded Curve25519 key pair as well as the server's public key. The server will have its own key ...
7
votes
1answer
84 views

KFB mode - key feedback

Please, could someone explain to me how the Key feedback mode (KFB) mode works and what the IV in output block stands for? And what properties does the "constant input" has to provide? Should it be ...
3
votes
1answer
299 views

How to build a difference distribution table?

i am studying about differential cryptanalysis, and found one metric to measure the resistance of a sbox to it, but to use it, it is necessary to build a difference distribution table, like the one in ...
2
votes
1answer
143 views

Single bit error in CBC

Why does a single bit error when using the CBC block cipher mode of operation affect the decryption of a block (Oj) with a probabilty of 50%? And in the following block, why is the one bit error in ...
2
votes
0answers
36 views

Can I expand the modular of an encryption scheme?

Take the lifted ElGamal as an example: suppose the original ciphertext is $<g^y ~mod~q,~g^m~mod~q>$. After some calculations, $m$ could be large enough to do modular. But I don't want $m$ to be ...
3
votes
2answers
487 views

Algorithm for generating OAuth tokens

I'm trying to find a good algorithm for generating authorization codes, access tokens and refresh tokens in an API. Currently, I am looking into the following setup: Tokens are generated using the <...
2
votes
2answers
91 views

regular expression matching on encrypted data using secure multiparty computation

Lets consider Secure Multiparty Computation based on Secret Sharing schemes (rather than Garbled Circuits approach). If we have to do regular expression matching on secret shares of words of texts. ...
2
votes
1answer
74 views

Can the salting function complexity improve the hash robustness?

I'm quite novice in security, and all examples I saw seem to salt the password by concatenating it, or by applying a simple binary OR or XOR. So the hash is based on "salt + password", "salt | ...
3
votes
0answers
46 views

How to test a FHE implementation?

I want to implement a FHE scheme based on NTRU, namely the scheme described here https://eprint.iacr.org/2014/039.pdf . How to test the security of my implementation ? Do I have to implement the ...
2
votes
2answers
46 views

What is the correct way to notate elliptic curve properties

When looking through elliptic curve and modulus posts i can see many examples of people referencing $p$ and $n$, in upper and lower case, and sometimes $Q$ is written instead of $p$ or $P$, and I ...
1
vote
0answers
113 views

MD5 hash different between sources - different hash for the same string [closed]

I've implemented the md5 source from a crypt lib from http://sourceforge.net/projects/libcrypt/ The string I'm passing to md5 is ...
1
vote
0answers
30 views

JS libraries or tutorials that utilize deep learning like Netflix [closed]

I am looking for JS libraries or tutorials that have implemented a deep learning approach, to make predictions. The best example is Netflix who predicts what you like based on your past seen movies. ...
5
votes
0answers
46 views

Can a one-way accumulator be used in place of a digital signature?

Could a one-way accumulator be used in a manner to replace a digital signature? Can it provide a way to: verify that the data has not been tampered with, and verify that the message is in fact sent/...
1
vote
0answers
110 views

Simplest way for strong cryptography in chat

I am a beginner in cryptography and I am interested for several weeks on this for my chat application. Basically, it is a centralized model. All messages are stored and potentially visible by ...
2
votes
0answers
44 views

Signing integers and UUIDs and restoring them from a third party server without tampering

I'm educating myself about cryptography. I know this is a long one, but please, bear with me. :) Now I have a scenario in my mind and I'd like to ask if what I've thought is sound (enough), what more ...
10
votes
2answers
178 views

Is there a way to optimize a linear scan while preserving anonymity?

I've been wrestling with a problem, and I was hoping if someone else had a bright idea. Here's the problem: I have two sides, Alice and Bob. Alice has a single high entropy string $A$, and Bob has a ...
3
votes
1answer
67 views

What about using only XOR gates in homomorphic encryption?

What if we were substitute the ANDs with XORs in some homomorphic encryption scheme like BGV(https://eprint.iacr.org/2011/277.pdf), LTV ( https://eprint.iacr.org/2013/094.pdf) ? It may be more ...
3
votes
1answer
335 views

Do Weak Elliptic Curves Exist?

I'm running into very contradictory opinions when try to understand if weak elliptic curves exist. I'm not interested in the case when a curve's weakness is attributed to properties of an EC's prime, ...
9
votes
3answers
439 views

How is bitslicing faster?

I have read a paper on Bit Slicing and Lightweight crypto but cannot understand how bitslicing makes encryption scheme faster. Please can someone explain with an example exactly how bit slicing makes ...
0
votes
1answer
32 views

How to use this homNAND gate?

I was reading this paper https://eprint.iacr.org/2014/816.pdf "Bootstratpping in less than one second" but I didn't understand it throughly. What's the point to build a cheap NAND gate ? Maybe to ...
0
votes
0answers
30 views

How to toggle a bit homomorphically ?

Suppose I want to use LTV scheme from this paper https://eprint.iacr.org/2013/094.pdf to compute homomorphically a function. But the multiplication operation is more expensive than the additive one. ...
6
votes
1answer
425 views

Pseudo random generator vs block encryption, which is faster?

If one wishes to encrypt one can either use a pseudo random generator to generate a long sequence and then xor it with plaintext, similarly he can use the seed as key to encrypt the plaintext using ...
2
votes
0answers
64 views

Discrete logarithms: large prime modulus vs. large semi prime modulus

I have a cryptography homework question, in the question it says a cryptographic hash function in the form of $f(x) = g^x \bmod n$ , where $n$ is a very large prime (1024bits and more), $g$ is a ...
5
votes
1answer
232 views

Why is “semantically secure” important for cryptosystems?

The first question: what is the exact definition of semantically secure? Basically, a cryptosystem is semantically secure if given the public key and the ciphertext, an adversary cannot learn any ...
1
vote
2answers
75 views

Initializing PGP keys by one side

I am using a PGP method to encrypt and decrypt messages shared between users A and B. Upon the start of a message exchange is the initialization of the public and secret keys by both Users. Lets say ...
5
votes
1answer
100 views

Difference between oracle behavior and real execution

Suppose that there is a place in a security proof where the behavior of an oracle differs from the corresponding real execution (for example, the decryption oracle rejects certain types of ciphertexts ...
5
votes
1answer
113 views

Coin flipping with limited communication between participants

Alice and Bob want to play a coin flipping game. Alice wins if the coin flips head. They choose to trust a independent third party that generates a random beacon (such as NIST). There is no ...
-2
votes
1answer
66 views

How do we solve Shammir 2,3 sharring scheme where arithmetic is modulo?

I am trying to get secret S and I have 3 values (2,2)(6,3)(4,9) and know that modulo is 13. I tried using Lagrange basis polynomial and got 8 but I am not sure if that is right and also I cannot find ...
4
votes
1answer
99 views

Are EC public/private keys significantly weakened by having a known byte?

I would like to use different EC keys for different purposes in an app, and I would like to easily see the purpose for which particular key (pair) was generated. With ~65K attempts, I can generate a ...
4
votes
1answer
181 views

Block Cipher Without Key Schedule?

I'm designing a cryptography assignment for a college security course, and one of the problems is to perform a simple meet-in-the-middle attack on a 2-round, 2-key cipher. Since we want this to be a ...
2
votes
1answer
72 views

Multiplication in elliptical curve cryptography

I'm practising for a cryptography test and came across this question: Let us assume that for a specific elliptic curve the formulas for the computation of $(x_3, y_3)=R+S$ are given by: $X_3=...
3
votes
0answers
66 views

Unknown authenticated encryption mode

I'm running through a protocol specification (LoRaWAN, pdf), and I'm puzzled by the crypto. The data is encrypted and authenticated in the following way: a unique 128-bit key is used; the plaintext ...
2
votes
0answers
116 views

Pseudorandom Functions with different input and output lengths

I am working on a problem found in my Cryptography textbook that goes as follows: Let F be a pseudorandom function such that for $k \in \{0,1\}^n$, function $F_k$ maps $l_{in}(n)$-inputs to $l_{...
1
vote
1answer
76 views

How to key an HMAC with keys from separate mutually untrusted parties?

The problem is as follows: There are two parties, both of whom would like to HMAC a message with a key. Although the keys are known to one another, both parties do not trust that the other one ...
2
votes
3answers
108 views

Proving that a node is the only child

Say I have a graph of messages like this: A | B / \ C D By including the parent hash in the message to be hashed I can show that B is a child of A, ...
0
votes
0answers
52 views

Symmetric encryption with compression for MySQL DB data

I would like to compress data before encrypting and storing it in a MySQL DB to reduce especially bandwith requirements (compression reduces bandwith by 70-80%). At present, all is handled by a server-...
0
votes
0answers
67 views

Having doubt in Rijndael Algorithm- coding for decryption

I am doing a project on the Rijndael Algorithm. I have already written the encryption code which produces the correct output. Now I want to implement decryption as well. I'm doing using VHDL, ...
2
votes
3answers
94 views

Find plaintext from two ciphers encrypted with a one-time pad and the same key

I'm studying for a cryptography test and I came across this question: Assume a language has three letters: A=1111, B=0011 and C=1010. Two words in this language are encrypted with a one-time pad ...
4
votes
2answers
88 views

How were semagrams encrypted in the pre-digital era?

Historically messages in languages that use alphabets have been encrypted manually according to some kind of algorithm (e.g. mono- and poly-alphabetic ciphers). But how wew messages encrypted in a ...
1
vote
0answers
55 views

equation of mixcolumn in the aes field

$c(y) = (03)y^3 + (01) y^2 + (01) y + (02)$ Let $d = (01)b$ in the AES field $GF(2^8)$. Provide exact equations for the bits $d_i, 0 \leq i \leq 7$, in terms of the bits $b_i$ of b. Can ...
3
votes
1answer
144 views

Double randomised HMAC verification to prevent timing attack

A way to prevent timing attacks for hash string comparison is to perform additional HMAC signing in order to randomize the verification process (see Double HMAC Verification). In addition to the ...
2
votes
1answer
47 views

How to calculate Enc(-m) from Enc(m) in Paillier cryptosystem?

The encryption in Paillier cryptosystem is like this according to Wikipedia: Let $m$ be a message to be encrypted where $m \in \mathbb{Z}_n$ Select random $r$ where $r \in \mathbb{Z}_n^*$ Compute ...
2
votes
1answer
243 views

I read ECB is bad because the same plaintext outputs the same ciphertext. Isn't that a requirement of a cipher?

In the Wikipedia article on Block Ciphers, it says about the Electronic Code Block mode: The disadvantage of this method is that identical plaintext blocks are encrypted into identical ...

15 30 50 per page