Profile Activity

mikeazo

Meta user

Network profile

Reputation

35,094

35.1k
27.7k
20.3k

2016
2017
2018
2019

Next tag badge

protocol-design

88/100 score

21/20 answers

Badges

150

Newest

Enlightened

Next badge

55/80

Impact

287 posts edited

55 helpful flags

1,949 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

18 Questions

Views Newest Activity Votes

votes

answers

13k

views

Does RSA work for any message M?

public-key rsa

Jan 29 at 7:24 fgrieu 92.6k

votes

answers

11k

views

For Diffie-Hellman, must g be a generator?

number-theory diffie-hellman

Feb 2 '15 at 19:50 Vishnu Sarvagna Gollamudi 1

votes

answers

views

How practical are side-channel attacks and how much of a concern are they?

cryptanalysis side-channel-attack

Apr 2 '17 at 21:59 fgrieu 92.6k

votes

answers

views

What is the most practical fully homomorphic cryptosystem?

homomorphic-encryption

May 3 '13 at 12:38 Community♦ 1

votes

answer

views

Why are elliptic curve variants of RSA “chiefly of academic interest”?

elliptic-curves discrete-logarithm factoring

Oct 5 '12 at 19:14 Paŭlo Ebermann 20.5k

votes

answer

views

What are the benefits of lattice based cryptography?

public-key performance lattice-crypto

May 23 at 19:14 elsa 41

votes

answer

views

Are there any specific requirements for the function $F$ in a Feistel cipher?

algorithm-design feistel-network

Aug 14 '15 at 6:05 e-sushi 16.5k

votes

answer

views

How to choose constants in a cryptographic function?

algorithm-design

Nov 8 '11 at 0:00 Paŭlo Ebermann 20.5k

votes

answers

views

Is HMAC-MD5 still secure for commitment or other common uses?

hmac collision-resistance md5

Feb 11 '18 at 8:55 fgrieu 92.6k

votes

answers

893

views

Is multiplicative secret sharing secure?

Nov 6 '13 at 10:13 Community♦ 1

votes

answers

797

views

Besides key and ciphertext sizes what are other advantages of elliptic curve versions of various protocols?

elliptic-curves performance

Mar 27 '14 at 13:47 Ethan Heilman 1,985

votes

answers

765

views

Security equivalence proofs for breaking RSA

rsa public-key

May 2 '12 at 23:47 mikeazo 35.1k

votes

answers

views

How to construct encrypted functions (with either public or private data)?

homomorphic-encryption

Jan 20 '12 at 23:18 Thomas Pornin 75.4k

votes

answer

views

Understanding Feldman's VSS with a simple example

Sep 26 '18 at 12:41 Mark R 26

votes

answers

837

views

Alternatives to FHE for secure function evaluation

homomorphic-encryption pairings function-evaluation

Mar 10 '12 at 20:45 Community♦ 1

votes

answer

views

Formula for the number of expected collisions

hash collision-resistance birthday-attack

Aug 28 '15 at 14:24 mikeazo 35.1k

votes

answer

432

views

Why is a simple hash into $G_2$ for (certain) pairing based crypto not possible?

elliptic-curves pairings

Feb 6 '14 at 17:10 DrLecter 11k

votes

answer

917

views

Must the order of the groups in a bilinear map be the same?

group-theory pairings

Aug 22 '13 at 8:48 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next badge

18 Questions

Does RSA work for any message M?

For Diffie-Hellman, must g be a generator?

How practical are side-channel attacks and how much of a concern are they?

What is the most practical fully homomorphic cryptosystem?

Why are elliptic curve variants of RSA “chiefly of academic interest”?

What are the benefits of lattice based cryptography?

Are there any specific requirements for the function $F$ in a Feistel cipher?

How to choose constants in a cryptographic function?

Is HMAC-MD5 still secure for commitment or other common uses?

Is multiplicative secret sharing secure?

Besides key and ciphertext sizes what are other advantages of elliptic curve versions of various protocols?

Security equivalence proofs for breaking RSA

How to construct encrypted functions (with either public or private data)?

Understanding Feldman's VSS with a simple example

Alternatives to FHE for secure function evaluation

Formula for the number of expected collisions

Why is a simple hash into $G_2$ for (certain) pairing based crypto not possible?

Must the order of the groups in a bilinear map be the same?