Minki Hhan @MinkiHhan

(Quantum/Classical)+Cryptography, Postdoc @UTAustin hhanmk.github.io Austin, Texas Joined June 2020

Tweets

42
Followers

69
Following

184
Likes

483

Quanta Magazine @QuantaMagazine

7 months ago

If you’ve ever moved into a new home, then you know how difficult it can be to steer bulky furniture through narrow hallways or around awkward corners. A new proof reveals the biggest shape that can slide down an L-shaped hallway. Richard Green reports: quantamagazine.org/the-largest-so…

5 29 76 38K 27

arXiv math.MG Metric Geometry @mathMGb

9 months ago

Jineon Baek: Optimality of Gerver's Sofa arxiv.org/abs/2411.19826 arxiv.org/pdf/2411.19826

2 864 2K 664K 444

Barna Saha @B1ar2n3a

a year ago

The talk is now available from the link below. youtu.be/O2gpl5l2eQA?si…

0 16 52 12K 17

SIAM Activity Group on Dynamical Systems @DynamicsSIAM

2 years ago

"My Favorite Math Jokes" (by Tanya Khovanova): arxiv.org/abs/2403.01010

3 93 281 72K 146

Ninnat Dangniam @ninnatdn

2 years ago

First talk at #AQIS2023 by Minki Hhan. For classical generic-group model (GGL) algorithms, there is already a classical bound Θ(√|G|). So they classically simulate quantum GGM and apply the bound. (This is not their only result.) Also Betteridge's law of headlines.

0 1 5 545 0

Download Image

Tom Gur @TomGur

3 years ago

Any recommendations for video lectures of interesting courses in quantum computing/information/algorithms/complexity? I've thoroughly enjoyed pretty much anything by @henryquantum, @BooleanAnalysis, and @sevag_gharibian. Would love to hear any suggestions! #QuantumTwitter

9 21 149 21K 98

Vince Vatter @VinceVatter

3 years ago

The long-awaited enumerative proof of the four color theorem, by David Jackson and Bruce Richmond, is here! Jackson announced this proof in May and it made big news, but then there were apparently some issues that needed to be fixed. Now on arXiv! arxiv.org/abs/2212.09835

10 81 511 190K 104

IACR @IACR_News

3 years ago

#ePrint How to Meet Ternary LWE Keys on Babai’s Nearest Plane: M Hhan, J Kim, C Lee, Y Son ia.cr/2022/1473

0 2 3 0 1

IACR @IACR_News

3 years ago

#ePrint From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments: M Hhan, T Morimae, T Yamakawa ia.cr/2022/1375

0 1 5 0 0

IACR @IACR_News

3 years ago

#ePrint An efficient key recovery attack on SIDH (preliminary version): W Castryck, T Decru ia.cr/2022/975

9 139 406 0 27

Quanta Magazine @QuantaMagazine

3 years ago

@jordanacep BREAKING: June Huh, a one-time high school dropout who took six years to finish undergrad, has won the Fields Medal, math’s highest honor. quantamagazine.org/june-huh-high-…

15 357 1K 0 74

Overleaf @overleaf

3 years ago

Hey everybody! 🤩 We are very excited to announce a brand new feature to rock your workflow: the PDF detach! 🛠️ 🎉🎈🎸 You can now see the PDF preview of your project in a separate tab! 📑 💻 Check out our blog post: overleaf.com/blog/new-featu… #TeXLaTeX #Overleaf #OverleafBlog

65 279 3K 0 82

Download Image

IACR @IACR_News

3 years ago

#ePrint Bit Security as Cost to Observe Advantage: Towards the Definition from THE BOOK: K Lee ia.cr/2022/655

0 1 2 0 0

Viktor Blåsjö @viktorblasjo

3 years ago

I have been teaching geometry and made a million figures in TikZ. My lecture slides are basically a "proofs without words"-style intro to Euclidean, spherical, hyperbolic, affine, and projective geometries: intellectualmathematics.com/geometry/

31 472 3K 0 820

Download Image

Moshe Vardi @vardi

3 years ago

Academic vacation :-)

24 269 2K 0 75

Download Image

Fermi Ma @fermi_ma

4 years ago

Really excited about this new paper with Alex Lombardi and Nick Spooner (@_nickspoon). Our motivation: can we prove that important zero-knowledge (ZK) protocols (such as [GMW86] Graph Non-Isomorphism (GNI) or the [FS90] protocol for NP) are ZK against quantum verifiers? 1/14

TCS blog aggregator @cstheory

4 years ago

0 1 23 0 1

1 5 55 0 8

Clément Canonne (on Blue🦋Sky) @ccanonne_

4 years ago

🧵Here's a trick. You have an algo to compute stuff about its input x. It also takes in α, δ in (0,1], runs in time O(log(1/δ)/α), and succeeds w/ proba 1-δ as long as x satisfies α(x) > α. If not, it outputs ⊥. Of course α could be a very loose bound on α(x)! 1/