0
votes
1answer
88 views

Doubts about Authenticated Data Structures logic

I am studying the theory of authenticated data structure, like Merkle Tree and I have a doubt: why use them? I explain better: why to be sure, for example, that a cloud provider didn't modify my files ...
1
vote
2answers
24 views

Does threshold crypto (m-of-n) guarantee that m peers discover the plain text?

In a threshold cryptosystem, is there any guarantee that all $m$ peers participating in retrieving a plain-text will all retrieve it? If not, is it possible to provide such a guarantee? For instance ...
0
votes
0answers
51 views

How to test the speed of an Authenticated Encryption algorithm?

I am trying to implement Authenticated Encryption algorithms using CUDA. Most of Authenticated Encryption algorithms have short message length like 64, 254..., 4094 (Byte). these message lengths ...
1
vote
2answers
220 views

Different tools return different ciphertext value for equal input

I have a Luna G5 Safenet HSM and I want to encrypt a text file containing testtest with 3DES-ECB algorithm. So in the first step ...
1
vote
1answer
57 views

Is it secure to encrypt random key with block cipher in ECB mode?

If we have a random key $K$ which is 256-bit, and have a block cipher $C$ which has a block size of 128-bit. Is it safe to encrypt $K$ with $C$ in ECB mode? This problem can be generalized to given a ...
2
votes
1answer
60 views

NMaster key from n secret key

I have to derive master key from N secret key. With the help of master key, i can collect all the secret keys which is used to derive master key. key1, key2,..keyN ==> single master key and single ...
0
votes
0answers
54 views

what is the fastest and efficient method to perform modular multiplication?

I'm working on a code that needs to perform modular multiplication of big numbers several times. Since the operation takes place several times, using division to find the remainder is very expensive. ...
3
votes
1answer
275 views

RSA enc/decryption with multiple prime modulus using CRT

Every information I found on internet about RSA-CRT encryption/decryption uses only two primes. I'm interested in my project in doing that using multiple (up to 8) primes. The general idea is to ...
2
votes
0answers
75 views

Lightweight Cryptography and Gate Equivalents [closed]

If I design a lightweight cryptographic algorithm, how do I calculate gate equivalents (GE)?
2
votes
0answers
46 views

Differential Cryptanalysis

How do I find the differential characteristics using techniques Shrinking ? How do I extract the key on Differential Cryptanalysis using the technique Shrinking in Blockcipher Algorithm? Shrinking ...
1
vote
3answers
91 views

RSA message integrity

I wish to send some small data that RSA alone can encrypt, and I send a shared secret along with it. ...
4
votes
1answer
95 views

Usefulness of Damgård–Jurik

I am trying to understand what are the benefits of using Damgård–Jurik over Paillier. I understand that expansion factor decreases as s increases. But isn't it the ...
1
vote
1answer
38 views

Deletion complexity in a RSA accumulator

My question is about the existence of a dynamic RSA accumulator with deletion of an element in O(1) time. Do you know some practical implementation?
2
votes
3answers
98 views

2 Part Encryption

Can anyone tell me if an encryption / decryption scheme like the following exists? Encrypted1 = SomeCryptoFunction(Data, Key1) ...
2
votes
1answer
65 views

Largest number that could be factored in milli seconds

Considering a home pc/laptop as machine used (Say typical 2.4 GHz, 16GB RAM, 4 core processor) for running any factorization algorithm. What would be the largest number that could be factored into its ...
1
vote
1answer
47 views

how to prove sequence y uphold golomb's third axiom

given $\{ x_k \}$ is a m-seq of order $n$, we define $\{ y_k \}$ to be a $m$ digits number: $$ y_i=x_ix_{i+1}...x_{i+m-1} $$ for every integer $n \ge m \ge 1$ how can I show that $\{ y_k \}$ upholds ...
1
vote
0answers
52 views

Applying Vigenere on small strings with sorting capability

I am new to cryptography and have a question about a use of Vigenere cipher in the case of small strings. I'd like to encrypt keywords that are smaller than 10 characters. If I use Vigenere ...
4
votes
1answer
64 views

Optimal same-base exponentiation?

I've (finally) implemented the answer to this question in our library, which stated how to transform montgomery curves (and points) to weierstrass curves (and points). Now, for scalar multiplication, ...
9
votes
3answers
1k views

How is the One Time Pad (OTP) perfectly secure?

The Wikipedia entry on One Time Pads (OTPs) states that if this cipher is used properly; ie, the keys are truly random and each "part" of the key is independent of every other "part", it's uncrackable,...
2
votes
1answer
111 views

Message security and also program copy detection

Imagine I have client and server running on different machines, each as a separate software. I want to ensure: message authenticity, integrity and confidentiality at least of messages coming from ...
1
vote
0answers
33 views

Clarification on the state of the art of qubit commitment

What is the current state of research on quibit commitment? It seems that the answer is not 2001 but it seems to me that a lot of these pdf are referring to a old protocols of quantum bit commitment ...
0
votes
1answer
218 views

Why Merkle Tree doesn't suffer Birthday attack?

I am trying to understand why Merkle Tree doesn't suffer the birthday attack? Can you help me? Thank you!
0
votes
0answers
23 views

How to calculate Private Key in RSA using Extended Euclidean Algorithm [duplicate]

I have googled for about 2 hours now and still haven't found an explanation. The wiki article just makes me more confused and so has every other similar question I've found on StackExchange. Here's an ...
2
votes
1answer
167 views

Modular Arithmetic in RSA

Consider the following the following RSA public key $pk = (N, e) = (1457, 1307)$. (a) Knowing that $187^2 \equiv 1 \pmod {1457}$ find the factorization of $N$. (b) Given the factorization of $N$ ...
0
votes
0answers
33 views

Can knowing part of what was used to generate an md5 hash make it vulnerable? [duplicate]

Say I am able to ask a black box MD5 generator to generate 1,000,000 hashes given input $STRING$ Where $STRING$ is an arbitrary ...
0
votes
2answers
156 views

Random Coin Flip

Quoting an old question: Consider the following protocol for two parties A and B to flip a fair coin (more complicated versions of this might be used for Internet gambling): A trusted ...
0
votes
1answer
45 views

elliptic curve multiplication with negative factor

I'm learning the multiplication operation on EC. From most material I can found, the multiplication $nP$ is just: $$nP=P+P+\cdots +P+P$$ For negative factor, i.e. $(-n)P$, by above definition and the ...
0
votes
1answer
99 views

Unconditionally Secure Authentication

I'm trying to add the authentication for my One-Time Pad implementation. I know that to provide Unconditionally Secure Authentication I need to use the One-Time MAC authentication. But I don't ...
0
votes
1answer
54 views

How do different block sizes affect the throughput of GPU implementations of AES?

I am confused about the effect of different block sizes on AES performance. As you can see here, there is a huge gap between the throughput of different block sizes. As far as I know, every 16 bytes ...
2
votes
2answers
91 views

Probability approximation of no collisions

I am comparing the actual probability of no collisions to the probability approximation formula of no collisions from the Understanding Cryptography text. The approximation is as follows: $$P(\text{...
1
vote
1answer
88 views

Is there short period in AES 128 key schedule?

I am wondering if for some particular keys the AES 128 key schedule lead to a periodic pattern for the round keys. The key schedule is only 10 rounds, but I am also wondering in the general case where ...
1
vote
1answer
35 views

NORX duplex padding

MonkeyDuplex constructions defined by Keccak authors has padding in every duplex block. Why only last duplex block is padded in NORX? Is it because NORX has domain separation, or simply because ...
0
votes
1answer
80 views

What are requirements of the audio input to be encrypted using AES?

I want to inquire that what are requirements of the audio input to be encrypted using AES. Is encrypting a mp3 file different from encrypting an aac file? Thanks!
2
votes
1answer
70 views

Implicit authentication aritcle

First, I want to know what is the logarithm used in the following system of equations (from the paper Flexible and Robust Privacy-Preserving Implicit Authentication - Domingo-Ferrer, Wu, Blanco-...
-1
votes
1answer
83 views

What are the security implications of an AES implementation that uses only 8-bit byte operations on the cipher state?

Some AES implementations in crypto libraries make use only 8-bit byte operations on the cipher state, like in the lorawan-parser (cf lib/aes.h). When I try to understand the implications of that, I ...
0
votes
0answers
30 views

(Looking for reference) Variants of Diffie-Hellman

Sorry for asking a non-pure-crypto question but I think that crypto.SE might be the right place to find the right people to answer this: I remember having seen a few years ago, online and in HTML ...
2
votes
1answer
121 views

Authentication protocol which detects client impersonation from another machine

Consider following authentication protocol. Client ClientA knows some initial secret KeyA shared with server. Client also knows IP of legitimate server. Now when client wants to establish connection ...
1
vote
1answer
62 views

A standard extension of ECIES for multiple recipients (broadcast / multiparty)?

I have one sender, and a small number (~5) of recipients. The sender knows each recipient's public EC key. I want the sender to broadcast a single message in such a way that any one of the recipients ...
9
votes
1answer
489 views

What is cryptographic agility?

I keep seeing the term "Cryptographic Agility" referenced. What does it mean? For instance: https://msdn.microsoft.com/en-us/library/windows/desktop/bb204775(v=vs.85).aspx One of the key value ...
2
votes
0answers
45 views

How do I prove that a bit by bit PKE scheme (that is IND-CPA secure) for an n-bit message is not IND-CCA-2 secure?

Gen generates Pk and Sk (l bits each), Enc encrypts m (length l) but by bit using each bit of Pk respectively, Dec decrypts ciphertext bit by bit using each bit of Sk respectively. How do I prove this ...
0
votes
0answers
83 views

What type of encryption scheme can prevent cheating in this coin flip protocol? [duplicate]

Consider the following protocol for two parties to flip a fair coin: Trusted party $T$ publishes her public key $p_k$ A chooses a random bit $b_A$, encrypts it under $p_k$, and announces the ...
0
votes
2answers
147 views

Could Riemann hypothesis solve certainly RSA?

I don't have the background for dealing with Riemann hypothesis but is well known that covers the prime distribution below a specified number. In order to solve the RSA problem you have to factor the ...
1
vote
1answer
313 views

If you encrypt an image (AES), is it still an image and can you view it?

Can you encrypt an image (with AES) such that you can open it as a png/jpeg?
0
votes
1answer
242 views

Sorting over encrypted data with different symmetric keys

I'm working on a security project. I need to perform a sorting on the lists of encrypted integers and strings. The encryption used is symmetric. The clients send the encrypted data in a list to the ...
1
vote
1answer
129 views

CMAC for messages shorter than 128bit

RFC4493 describes the generation of AES-CMAC and padding for messages with length > sizeof(aes128_key). However I need to generate the CMAC for a series of messages shorter than 16 byte. So I'd like ...
0
votes
0answers
16 views

trusted platform module prototype

I have a Java card, which I like to learn more about by installing my own TPM on it. One, which I can kind of "kick the tires", install root keys, send different command to, and ... without fear of ...
2
votes
1answer
116 views

How to calculate mapping in bilinear

I am trying to read a paper in cryptography. In key generation phase, paper give a definition for bilinear like G and Gt be two cyclic groups of prime order p $e: G * G \to G_t$. be a map with the ...
0
votes
0answers
23 views

Symmetrical Block Encryption with Synchronised Remote Key Change

I'm considering a theoretical design of a walkie talkie, with strong encryption. My current idea is to use symmetrical block encryption, but with the key changing at regular time intervals without a ...
2
votes
1answer
127 views

Does DES support different keys that lead to the same result?

While bruteforcing a ciphertext, I've found multiple keys which produce the same result. Mode is DES with ECB and PKCS5 padding. ciphertext is ...
1
vote
0answers
33 views

cumulative secrets

Imagine a server with an authentication scheme that utilizes an element of randomness in new sessions (i.e. one that uses the secure remote password protocol). At the end of a successful ...

15 30 50 per page