An asymmetric cipher is an encryption scheme using a pair of keys, one to encrypt and a second to decrypt a message. A special class of asymmetric ciphers are public-key ciphers, in which the encrypting key need not be kept secret to ensure a private communication.

learn more… | top users | synonyms (3)

7
votes
0answers
302 views

Security of RSA for paranoids with padding?

RSA for Paranoids (RSAP) (in cryptobytes v3n1), also known as Unbalanced RSA, is a variant of RSA proposed in 1995 by Adi Shamir, as a mean to increase the RSA public modulus size while keeping ...
6
votes
0answers
135 views

Verbatim of early work on public-key cryptography?

In late 1997, the history of public-key cryptography was turned around with the announcement by the CESG (April 2000 archive) that public-key cryptography was theorized in a 1970 note [1] by James ...
5
votes
0answers
90 views

Given a 'good' basis for a lattice, how can we solve the CVP?

I'm doing a little bit of reading about lattices. I read that if we can find a 'short' basis for our given lattice, we can solve CVP and SVP very efficiently. However, the paper didn't describe an ...
4
votes
0answers
171 views

Ring Signature - paper/code difference in trying to solve inverse trap door function?

there is a paper on ring signatures and a python implementation of it here. The Step 4 in the paper describes $y_s = v =C_k,_v(y_1, y_2, ... y_r)$ for all $1 \leq i \leq r$ where $i \neq s$. The ...
3
votes
0answers
63 views

Relations between RSA and DLOG, factoring and DLOG

Definition: (The generalized Diffie-Hellman problem) Let $n=pq$ for two large primes $p,q$. Given $x, x^a, x^b,n$, find $x^{ab}\pmod{n}$. (1) Is there a known reduction from the GDH problem ...
3
votes
0answers
56 views

Managing data permissions/access through asymmetric cryptography

I want to manage authorization, as 3rd-party permissions, through asymmetric cryptography. I'm concerned about how is it possible to share access of encrypted data with N entities, and be able to ...
3
votes
0answers
278 views

RSA reencryption scheme

Is there such an algorithm that would allow to upgrade the encryption of a RSA-encrypted message without revealing the plaintext to the untrusted user? Basically, such an algorithm would probably be ...
2
votes
0answers
117 views

Challenge-response based on public-key decryption, why send public key

Quoting the handbook of applied cryptography, chapter 10.3.3 (i): Identification based on PK decryption and witness. Consider the following protocol: $A \leftarrow B: h(r), B, P_A(r,B)$ ...
2
votes
0answers
87 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
89 views

How can I make a message into a blocks for NTRU?

I have more bits than the degree of the NTRU polynomial. For example: $x^{11}-1$ message: Hello (I am using ascii, 8 bits for 1 symbol) got: ...
2
votes
0answers
89 views

Threshold signatures vs. certificate authority+voting verification

Perhaps a silly question, but I am wondering what the advantages are of threshold signatures. Let's consider the following two signature schemes: $(t,n)$-threshold signature with a trusted dealer, ...
2
votes
0answers
421 views

Understanding elliptic curve encryption

I'm having a hard time understanding the elliptic curve encryption. One thing thing I don't understand is listing all the points on the curve (mod p). Suppose I have the following elliptic curve: y^2 ...
2
votes
0answers
86 views

Prevent/minimize replay attacks in public message board

Assume we have a public message board where anyone can send a message to. If plain messages are used, anyone can impersonate anyone. The goal is to disallow impersonations. We can use public key ...
2
votes
0answers
1k views

Cryptographic Protocol using NaCl

Why? I wanted to add some security and privacy to a chat-type server for playing various games (with a few things that are done on the server to limit cheating). Going by the "Don't implement ...
2
votes
0answers
396 views

Determining the algorithm used to generate a digital signature

I have a string "abcd pqrs". This string is digitally signed with an X.509 certificate (with its private key) and it produces a signature. From the signed string, is it possible to find out what ...
1
vote
0answers
22 views

Any ideas on login using Digital Signature PKCS

I am curious to know about possibility to login into web application just by identifying the user based on digital signature in usb token. any reference in this direction?
1
vote
0answers
59 views

How does bitmessage encryption work?

I have been reading around protocol specification and there is either too much technical detail or too bad articles on various sites. I need you to explain in simple words how encryption in ...
1
vote
0answers
54 views

Obliviously computing the Least common multiple of two poylnomials

Consider I have two polynomials $f_1$ and $f_2$ of the same degree. I want to secure them (using any kind of encryption except FHE) and outsource them to an untrusted server. I want him to compute the ...
1
vote
0answers
78 views

Opinion on my idea for storing credit cards securely

I've been thinking of ways to store credit cards securely, I thought of this: Take the users credit card info Put the card info in a standard format "Full Name/Card Num/Security Num/Expiry ...
1
vote
0answers
63 views

Mutual authentication with Public Key and session Key

I am trying to understand two protocols for mutual authentication and if they are secure or not. $K$ is the session key, and it's calculated $k=H(TimeStamp)$. Are the following both cases secure? ...
1
vote
0answers
64 views

RSA Key Blinding

I was looking the answer to the following question (Timing attack on modular exponentiation), discussing the Private Key Blinding as a countermeasure for timing attacks. Therefore I'm asking if ...
1
vote
0answers
95 views

Decrypt a public encrypted message and Sign a signature, how the math is different?

As I understand, when you want to send a confidential message to someone, you encrypt the message with his public key. And he use his private key to decrypt the message. At the same time, one can use ...
1
vote
0answers
54 views

1-1 trapdoor function mapping the set of $n$-bit numbers to themselves

I am looking for a trapdoor one-to-one function $f : \{0,1\}^n \rightarrow \{0,1\}^n$ (that is, mapping the set of $n$ bit numbers 1-1 onto itself [any $n$ is OK]). I was considering the use of ...
1
vote
0answers
78 views

Public-key based on roots of polynomial

In general it's hard to calculate the roots of a given polynomial P(x). But the other way back calculating the coefficients is much easier (Vieta's formulas). If this is a one-way function, is it ...
1
vote
0answers
292 views

Using RSA key pair for file encryption

I'm looking for a way to perform encrypted nightly backups of a server I administer, without storing the decryption key on the server. A form of PK encryption seems ideal for this, as I can store the ...
1
vote
0answers
135 views

inverse of scalar multiplier in ECC

I am learning to use ECC. i got into situation where i have $Q=abG$, where $G$ is the generator of the finite field formed on EC using a prime $p$ modulus and $a$ , $b$ are random numbers. now suppose ...
1
vote
0answers
199 views

Factoring large numbers

I am trying to factor few integers that are each between 115 and 135 digits long. I have just, little over a month ago, began my study of Cryptography. I was wondering if anyone knew of any efficient ...
1
vote
0answers
117 views

How to develop a public key cryptosystem based on a hard problem?

Recently, I found a function that is performed on a sequence to return another sequence. All known algorithms for finding the input, given the output are of exponential complexity. I want to propose ...
1
vote
0answers
173 views

Diffie-Hellman exchange

So for a Diffie-Hellman problem, I am given the prime $p$ for the Diffie-Hellman exchange. I am also given $g$, secret number for machine as $A$, secret number for station as $B$, a Diffie-Hellman ...
1
vote
0answers
57 views

Are there any bi-bidirectionally indistinguishable Asymmetric Encryption Algorithms

I have been using Asymmetric Encryption for a while, and I have come across an interesting concept, and it would be cool if it could be done. Are there any Asymmetric Encryption Algorithms where the ...
1
vote
0answers
95 views

can permutation matrix be found in parallel processing technique?

Let us say there exists a permutation matrix $n \times n$ for some large $n$. Then, there are $n!$ possible permutations. If one to use brute-force to find the secret permutation among $n!$ ...
0
votes
0answers
48 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 ...
0
votes
0answers
59 views

RSA public key exponent generation confusion

Quote from Wiki: $e$ having a short bit-length and small Hamming weight results in more efficient encryption — most commonly $2^{16} + 1 = 65537$. However, much smaller values of $e$ (such as $3$) ...
0
votes
0answers
176 views

Public key encryption and big files with NaCL

I am trying to encrypt big files using NaCL (actually PyNaCL) - see http://nacl.cr.yp.to/box.html After reading some docs, I came up with this prototype : Bob wants to send a big file to Sarah. They ...
0
votes
0answers
30 views

Attribute-based broadcast encryption with respect to ABE

What is the exact difference between attribute-based encryption (ABE) and attribute-based broadcast encryption (ABBE)? Is ABBE equivalent to broadcast encryption on top of ABE?
0
votes
0answers
91 views
0
votes
0answers
86 views

Generation of strong primes

It seems that this is pretty difficult to find large (above 1024 bits) strong primes, or at least such primes p where (p-1) has a very large prime factor. Is there any information regarding the ...
0
votes
0answers
64 views

RSA OAEP: prevention of partial decryption of ciphertexts

I'm trying to understand RSA encryption (as a beginner in cryptography). go on this wiki page http://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding scroll down to the 2 numbered points: ...
0
votes
0answers
148 views

Cracking RSA with Small exponent 5

I have read following questions - Cracking an RSA with no padding and very small e Small Encryption Exponent where in first it says to run out all the possible m options and second says factor ...
0
votes
0answers
86 views

How can I prove CPA secure by using a new scheme gen,enc,dec from GEN,ENC,DEC?

Given public key encryption scheme $(gen; enc; dec)$, we now construct a new scheme $(Gen; Enc; Dec)$ as follows: The key generation algorithm $Gen$ is the same as $gen$. Each ciphertext for a ...
0
votes
0answers
41 views

Is Paillier cryptosystem commutative?

Is Paillier cryptosystem commutative? If not, how can we construct an oblivious decryption protocol based on Paillier?
0
votes
0answers
25 views

signed message susceptible to block re-ordering , block deletion , block replication

We would implement a Public Key Cryptography (PKC) based digital signature by breaking the message into blocks and signing each block independently. One of the issues associated with digital ...
0
votes
0answers
56 views

Public key encryption without ciphertext expansion

Say I have a database column that is defined as VARCHAR(255) that stores names. I can assume that names can be up to 255 chars. I need a public key encryption so that I can replace names with their ...
0
votes
0answers
107 views

Possible Digital Signature Hack?

I am starting to learn more about cryptography and I just read more about how asymmetric keys can make a digital certificate, and I would like if someone could explain me why the following case can't ...
0
votes
0answers
61 views

Protocol for establishing physical ownership of a connected/IoT device?

If I'm connected to a device e.g. using BLE are there rules/protocols for establishing that I'm also in physical possession of that device (at least for the first time I connect to it)? Crypto is in ...
0
votes
0answers
160 views

If H(m) = 0 for some m, how can a DSA signature be forged?

If we know for some message $m$ that $H(m) = 0$, how can we forge a DSA signature with only the public key? I got that $g^s*r = (g^x)^r$ where $x$ is the private key, but that's one equation with 2 ...
0
votes
0answers
235 views

Blum-Blum-Shub Cryptosystem

I am given $N$, which is Bob's encryption key. I was able to successfully factor $N$ into $N=p*q$. Alice encrypts a messages for bob and sends $a = [1,1,1,0,0,0,1,0,1,1,0,...]$ $b = 1545164156...$ ...
0
votes
0answers
75 views

hybrid PKE scheme CCA2 insecurity

I'm reading a paper here say: As we know, in hybrid PKE schemes XOR alone cannot perfectly hide challenge bit to the CCA2 adversary The author does not define hybrid PKE schemes. What is ...
-1
votes
0answers
33 views

Are RSA keys stronger than McEliece keys?

What the title asks. I'm currently of the opinion that differences in key size don't make either stronger or weaker than the other in this case.
-1
votes
0answers
32 views

Worked example of McEliece Cryptosystem

I am trying to learn about the McEliece cryptosystem, unlike other more common systems, like RSA or El Gamal, educational literature such as the Handbook of applied cryptography doesn't contain worked ...