0
votes
2answers
78 views

Secure Key exchange using javacard applet

I am working on a javacard applet project where i need... Secure communication between two applets let say there is applet A and applet B. Let say both applet has their own RSA key pairs. Now I ...
1
vote
1answer
66 views

Encryption that could have multiple decryption key

The title looks strange but it is to deal with this situation. The data we have should only be accessible by our end user and data administrators, not anyone else. Ideally, each user should have ...
13
votes
2answers
5k views

Is HMAC-MD5 considered secure for authenticating encrypted data?

I've read something to the effect that the HMAC construct is able to lessen the problem of collisions in the underlying hash. Does that mean that something like HMAC-MD5 still might be considered ...
4
votes
1answer
85 views

How does the Flickr length extension attack work?

I am currently reading about the length extension attack on Flickr (pdf) but not understanding what's going on there. ...
1
vote
1answer
46 views

What happens if a nonce is reused in ChaCha20-Poly1305?

In ChaCha20-Poly1305, I know that reusing a nonce loses confidentiality and integrity for all messages encrypted with the (key, nonce) pair. However, is security affected for those messages encrypted ...
-3
votes
1answer
67 views

How to encrypt a number using AES?

How to do padding to input giving to encrypt using AES algorithm if the input is less than 128 bits? I need to encrypt a decimal number such as 10.
4
votes
1answer
42 views

How to correctly encrypt data with proper authentication using AES-256-CBC in php?

I have been using the openssl function for encrypting data with AES-256-CBC in php. I have been able to encrypt it using an unique IV (by generating with openssl_random_pseudo_bytes)for each new ...
4
votes
1answer
47 views

How to generate fingerprint for PGP public key

I would like to know how to generate a fingerprint for an openPGP public key. To be clear, I'm interested in how the fingerprint is generated. I'm aware that I can get the fingerprint with a ...
2
votes
1answer
69 views

Plaintext and ciphertext block sizes

How can you determine the largest plaintext block size and smallest ciphertext size if you used RSA with $n=59768553302699443$ using an alphabet with $27$ characters?
1
vote
1answer
66 views

Degree of M and Max Sequence Length for LFSR

For the LFSR mod 2, determine the degree of m and maximum sequence length s_(i+3)≡ s_i+s_(i-2)+s_(i-4) mod 2 determine the degree of m and the maximum ...
4
votes
0answers
110 views

Finding the subgroup in isogeny-based cryptography

Isogeny-based cryptography is one of the newest post-quantum cryptography. Hardness of this system is based on finding isogeny between two elliptic curves. Also this is theorem: Elliptic curves ...
0
votes
1answer
45 views

How does a user register his verifier at host in SRP (Secure Remote Password) protocol?

I read RFC 2945 and 5054 describing SRP, but there was no mention of registration. How should user registration happen in SRP? Is there a standard or paper describing it?
7
votes
1answer
359 views

Status of Algebraic Eraser key exchange?

Algebraic Eraser™ is a relatively new asymmetric key agreement protocol (also designated the Colored Burau Key Agreement Protocol), based on a simultaneous conjugacy search problem in a braid ...
-2
votes
0answers
31 views

emulation of a one-time-pad based on multiple keys of running cipher

a one-time-pad cipher is one that uses a long "truly" random key that is as long as the plain text message. the key must be only used once. the key must not be derived from pseudo random number ...
5
votes
1answer
78 views

Why are obfuscators generally defined to be probabilistic algorithms, rather than deterministic ones?

One possible explanation is, randomness is not going to hurt you, so might as well use it. Also, if we are hoping to prove impossibility, it only makes the result stronger. One other explanation is ...
0
votes
0answers
8 views

EC Schnorr or Ed25519 Java card implementation [migrated]

I am trying to implement ED25519 in java card. Since there are many restrictions with respect to data types and sizes, its becoming tough to implement it, especially curve operations. Is there any ...
2
votes
1answer
53 views

Preserving Confidentiality and Integrity in a Public channel

Let's say I've got two people that are trying to talk in a public channel $A$ and $B$ and they want to preserve their confidentiality and integrity. Which cryptographic algorithm would they want to ...
1
vote
1answer
60 views

How to split up $GF(2^{128})$ into smaller fields?

I've heard that it's possible to split up $GF(2^{128})$ into copies of several smaller fields like $GF(4)$ so as to make the math easier in some cases. How do you do that? I know how it works for ...
4
votes
1answer
103 views

Understanding ransomware – What makes plain-text-attacks or brute-forcing so hard?

Say I have four files. Two are completely unencrypted, while the other two are the exact same files other than that they have been encrypted with (apparently) the same public key (via a ransomware ...
1
vote
0answers
40 views

Question on data patterns within a Mask [closed]

I have already asked a similar question to this today and was told to go elsewhere, went to data analysis and they told me to come back here.... I am trying to write a Data Mask pattern and I would ...
3
votes
3answers
4k views

Is javascript RSA signing safe?

I'm currently working on a secure open source messaging system (https://github.com/DSMNET/DSMNET). I'm currently using the cryptico.js (https://github.com/wwwtyro/cryptico) library to encrypt all the ...
2
votes
1answer
110 views

State of the art techniques for Anonymous Authentication?

What are the state of the art techniques for Anonymous Authentication? What are the most popular ones? The problem domain I am considering is with respect to different users accessing cloud content; ...
3
votes
1answer
109 views

Are there any successful preimage attacks?

Are there any successful preimage attacks on any serious cryptographic hash algorithm or at least on serious-looking non-cryptographic hashes (like MurmurHash)?
0
votes
1answer
32 views

Setting up of polynomials for CP-ABE or KP-ABE Access Trees

My question I guess is how the selection is done. A brief explanation with a simple access tree will be very helpful.
4
votes
0answers
30 views

An MPC protocol from Elgamal is a good solution a homomorphic multiplication?

I want to compute a multiplication between many secret values and then distribute the result to everyone involved. For this, I thought about an MPC protocol built from Threshold Homomorphic Elgamal. ...
0
votes
0answers
31 views

Solving ADFGVX decoding with only ciphertext

Hi I'm new to the world of crypto and I'm trying to decode a message. I know it is encrypted using the ADFGVX cipher. I also have a ciphertext, but I have no other information given to me. My question ...
0
votes
1answer
25 views

Lagrange Coefficients & Polynomial in KP-ABE

My question is how these concepts relate in ABE. I am assuming that the attributes are used to share the master secret key and only a user with the right attributes for a particular access tree is ...
4
votes
3answers
84 views

Why are there $2^{56}$ possible DES keys when there are 64 key bits?

On forums I read DES has $2^{56}$ possible keys so it takes x times to brute force it with hardware x. But there are 64 total bits of which are 8 parity bits. But those parity bits are a ...
0
votes
1answer
30 views

What does this advantage statement signify?

In many Attribute Based Encryption papers I see this line... The advantage of an adversary A in this game is defined as Pr[b' = b] − 1/2. Can someone explain what it means to me? I assume it means ...
4
votes
0answers
62 views

Zero-knowledge proof for the product of additive Paillier ciphers

Suppose that Alice received the cipher values: $E(x_1), E(x_2), ..., E(x_n)$ that are encrypted using Paillier cryptosystem by $n$ entities with Bob's public key. Alice computes $E(\sum x_i)$ from ...
1
vote
1answer
72 views

Perfect Secrecy in Symmetric Key Systems

For symmetric key systems does perfect secrecy imply that all ciphers in the cipher space are equiprobable? I would think not, but I am finding it hard to come up with a counter example.
1
vote
0answers
107 views

Complexity using RSA

You encrypt a message using the RSA encryption system as $t^e \pmod n$ , where $t, e < n$ and $t$ is the numerical equivalent of the message. The message is written in a $27$-letter alphabet and is ...
-1
votes
0answers
62 views

collision resistant hash function

I have got through the collision resistant hash function,and I found it a little bit tricky to solve this question: Would you please help me solve it?
4
votes
0answers
60 views

How can I implement decryption for NTRU homomorphic encryption scheme?

I have come across this paper On-the-fly multiparty computation via on-the-cloud Multikey from Fully Homomorphic Encryption by Lopez-Alt et al., where authors describe a NTRU-based homomorphic ...
3
votes
0answers
97 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 ...
2
votes
1answer
235 views

Is it possible to perform a rudimentary asymmetric key encryption algorithm by hand?

I have at least three, distinct motivations for having a simple way to use asymmetric key encryption by hand or without modern computers. First, I was recently demonstrating to a 12-year-old how ...
2
votes
0answers
38 views

Example of Projective Coordinates

Given the affine form of coordinates $(x,y)$ such as $(5,3)$, if I want to convert $(5,3)$ to projective coordinates $(x,y,z)$, should the form of point be $(5,3,1)$? It is triplet not a point, right? ...
9
votes
1answer
105 views

A general definition for cryptocurrencies

I am trying to find the definitions to several terms related to digital currencies. Unfortunately, I am always ending up on Bitcoin-oriented pages and websites which only take Bitcoin itself into ...
1
vote
1answer
84 views

Cycling hashing in PBKDF's and their limitations in strength?

I hope this question isn't too similar to one that's already been asked. I also want to point out I know part the answer already, AFAIK: I just want some expert input on this. Let's model a hash that ...
-1
votes
0answers
35 views

Can blockchain be used in a comparable way to an encrypted SQLite database?

Further to a previous question of mine regarding multiple encryption levels in a SQLite database, I was asking whether it's possible for different users are able to decrypt only records of the ...
2
votes
1answer
84 views

Why should $a,b < N$ for Montgomery Reduction?

In Montgomery reduction, when calculating $a \times b \mod N$, it is required that $a \lt N$ and $b \lt N$. I think $0 \le T \lt N \times R$ is enough for the Montgomery Reduction. Rationale: Let ...
1
vote
1answer
78 views

Using e-ID Number for Encryption and Digital Signing

I want to use e-ID number for performing Encryption/Decryption and Digital Signing - and in order to do so, I've opted a PGP-oriented approach which goes a bit like this. Generating PGP key-pair ...
8
votes
1answer
370 views

Compact digital signature for noisy data

The question asks for a signature scheme, with a public verification procedure, that is tolerant to minor alterations of the signed data during its transmission [possibly in analog form over some ...
9
votes
1answer
15k views

AES CBC mode or AES CTR mode recommended?

What are the benefits and disadvantages of CBC vs. CTR mode? Which one is more secure?
3
votes
0answers
149 views

Why does HMAC use two different keys?

Suppose $H$ is a hash function; why is $H(k||H(k||m))$ not secure? See this HMAC definition. In there, indeed two keys are used and the mac algorithm is $H(k_1 ||H(k_2 ||m))$ . Why don't we use ...
0
votes
1answer
71 views

Stern identification scheme to signature scheme

I'm trying to understand the comment in the page 103 of the book Postquantum Cryptography. about convert the identification Stern procedure for signing. Can you write an example of signature of this ...
1
vote
0answers
19 views

If you use an AES key just once, do you need to use IV, and/or pad the message? [duplicate]

I am developing an application that is going to use AES encryption. Since it is going to use a different key for every message encrypted... Would it be secure to use a constant IV? (i.e null bytes) ...
-1
votes
1answer
43 views

Understanding the cryptography used in a file [closed]

I use a software that stores a raw binary file with information, and exports it to a text file. I have access to the data in the original binary file. You can find a sample of the contents of the raw ...
2
votes
1answer
58 views

Semantic Security and Equal Message Length in the Context of Public Key Cryptography

A lot of definitions for semantic security make use an experiment $\text{Exp}$ which is performed between a challenger $\mathcal{C}$ and an adversary $\mathcal{A}$ that begins as follows: ...
3
votes
3answers
890 views

What are the differences between proofs based on simulation and proofs based on games?

what are the main pros and cons of proving the "security" of a crypto scheme under simulation proofs instead of game based proofs?

15 30 50 per page