Profile Activity

Habib

Network profile

Reputation

751

751
677
603

2016
2017
2018
2019

Top tag

perfect-secrecy

Next privilege

1,000 Rep.

See votes, expandable usercard

Badges

4

17

Newest

Yearling

Next badge

3/5

Impact

1 post edited

0 helpful flags

94 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

5 Questions

Views Newest Activity Votes

4

8

votes

2

answers

2k

views

What does “Worst-case hardness” mean in lattice-based cryptography?

provable-security lattice-crypto

Jan 5 '16 at 12:36 cygnusv 4,402

4

11

votes

2

answers

1k

views

How secure is a pronounceable password in terms of entropy?

passwords entropy

Oct 5 '15 at 17:39 Community♦ 1

0

votes

2

answers

268

views

Is solving a modular linear equation a hard problem when the coefficient is not an invertible element?

complexity group-theory

Mar 4 '13 at 20:13 Paŭlo Ebermann 20.5k

2

4

votes

0

answers

202

views

As a cryptographer, what are the things I should care about in my implementation of pairing functions?

elliptic-curves implementation pairings

Nov 10 '14 at 11:27 Habib 751

0

votes

1

answer

90

views

Is it possible to create a Bilinear Function with Already Assigned “Multiplicative” Input Groups?

pairings anonymity

Mar 1 '13 at 21:42 poncho 102k

Cryptography Stack Exchange works best with JavaScript enabled