frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Show HN: We had 20 Claude terminals open, so we built Orcha

1•buildingwdavid•32s ago•0 comments

Your Best Thinking Is Wasted on the Wrong Decisions

https://www.iankduncan.com/engineering/2026-02-07-your-best-thinking-is-wasted-on-the-wrong-decis...
1•iand675•33s ago•0 comments

Warcraftcn/UI – UI component library inspired by classic Warcraft III aesthetics

https://www.warcraftcn.com/
1•vyrotek•1m ago•0 comments

Trump Vodka Becomes Available for Pre-Orders

https://www.forbes.com/sites/kirkogunrinde/2025/12/01/trump-vodka-becomes-available-for-pre-order...
1•stopbulying•2m ago•0 comments

Velocity of Money

https://en.wikipedia.org/wiki/Velocity_of_money
1•gurjeet•5m ago•0 comments

Stop building automations. Start running your business

https://www.fluxtopus.com/automate-your-business
1•valboa•9m ago•1 comments

You can't QA your way to the frontier

https://www.scorecard.io/blog/you-cant-qa-your-way-to-the-frontier
1•gk1•10m ago•0 comments

Show HN: PalettePoint – AI color palette generator from text or images

https://palettepoint.com
1•latentio•11m ago•0 comments

Robust and Interactable World Models in Computer Vision [video]

https://www.youtube.com/watch?v=9B4kkaGOozA
1•Anon84•15m ago•0 comments

Nestlé couldn't crack Japan's coffee market.Then they hired a child psychologist

https://twitter.com/BigBrainMkting/status/2019792335509541220
1•rmason•16m ago•0 comments

Notes for February 2-7

https://taoofmac.com/space/notes/2026/02/07/2000
2•rcarmo•18m ago•0 comments

Study confirms experience beats youthful enthusiasm

https://www.theregister.com/2026/02/07/boomers_vs_zoomers_workplace/
2•Willingham•25m ago•0 comments

The Big Hunger by Walter J Miller, Jr. (1952)

https://lauriepenny.substack.com/p/the-big-hunger
2•shervinafshar•26m ago•0 comments

The Genus Amanita

https://www.mushroomexpert.com/amanita.html
1•rolph•31m ago•0 comments

We have broken SHA-1 in practice

https://shattered.io/
9•mooreds•31m ago•2 comments

Ask HN: Was my first management job bad, or is this what management is like?

1•Buttons840•33m ago•0 comments

Ask HN: How to Reduce Time Spent Crimping?

2•pinkmuffinere•34m ago•0 comments

KV Cache Transform Coding for Compact Storage in LLM Inference

https://arxiv.org/abs/2511.01815
1•walterbell•38m ago•0 comments

A quantitative, multimodal wearable bioelectronic device for stress assessment

https://www.nature.com/articles/s41467-025-67747-9
1•PaulHoule•40m ago•0 comments

Why Big Tech Is Throwing Cash into India in Quest for AI Supremacy

https://www.wsj.com/world/india/why-big-tech-is-throwing-cash-into-india-in-quest-for-ai-supremac...
1•saikatsg•40m ago•0 comments

How to shoot yourself in the foot – 2026 edition

https://github.com/aweussom/HowToShootYourselfInTheFoot
2•aweussom•41m ago•0 comments

Eight More Months of Agents

https://crawshaw.io/blog/eight-more-months-of-agents
4•archb•43m ago•0 comments

From Human Thought to Machine Coordination

https://www.psychologytoday.com/us/blog/the-digital-self/202602/from-human-thought-to-machine-coo...
1•walterbell•43m ago•0 comments

The new X API pricing must be a joke

https://developer.x.com/
1•danver0•44m ago•0 comments

Show HN: RMA Dashboard fast SAST results for monorepos (SARIF and triage)

https://rma-dashboard.bukhari-kibuka7.workers.dev/
1•bumahkib7•44m ago•0 comments

Show HN: Source code graphRAG for Java/Kotlin development based on jQAssistant

https://github.com/2015xli/jqassistant-graph-rag
1•artigent•49m ago•0 comments

Python Only Has One Real Competitor

https://mccue.dev/pages/2-6-26-python-competitor
4•dragandj•51m ago•0 comments

Tmux to Zellij (and Back)

https://www.mauriciopoppe.com/notes/tmux-to-zellij/
1•maurizzzio•52m ago•1 comments

Ask HN: How are you using specialized agents to accelerate your work?

1•otterley•53m ago•0 comments

Passing user_id through 6 services? OTel Baggage fixes this

https://signoz.io/blog/otel-baggage/
1•pranay01•54m ago•0 comments
Open in hackernews

Crypto 101 – Introductory course on cryptography (2017)

https://www.crypto101.io/
236•pona-a•7mo ago

Comments

teleforce•7mo ago
Thanks for the link.

You can download this entire Handbook of Applied Cryptography for free [1].

Recently the authors also provided online course and video namely:

- Cryptography 101: Building Blocks (fundamental cryptographic primitives) [2]

- Cryptography 101: Real-World Deployments (PKI, TLS, Bluetooth, AWS, Signal) [3]

Other courses and video includes:

- The Mathematics of Lattice-Based Cryptography (introductory course)

- Kyber and Dilithium (standardized lattice-based cryptosystems)

- Hash-based signature schemes (LMS, XMSS, SPHINCS+)

- Error-Correcting Codes (linear, Hamming, Golay, cyclic, BCH, Reed-Solomon codes

[1] Handbook of Applied Cryptography:

https://cacr.uwaterloo.ca/hac/

[2] Crypto 101: Building Blocks:

https://cryptography101.ca/crypto101-building-blocks/

[3] Crypto 101: Real-World Deployments:

https://cryptography101.ca/crypto101-deployments/

xavdid•7mo ago
I don't remember if it links to it, but this pairs well with https://cryptopals.com/, which are practical examples of many of these theories.
anorphirith•7mo ago
this is the type of crypto i like
physix•7mo ago
This looks to be really well written. After 25 odd pages, I'm saying to myself, can't wait to read the whole book.
mac-monet•7mo ago
About to finish reading "Real World Cryptograhy" by David Wong, would highly recommend for anyone curious about this subject.
baxtr•7mo ago
>Fortunately, we donʼt have an algorithm that can factor such large numbers in reasonable time. Unfortunately, we also havenʼt proven it doesnʼt exist. Even more unfortunate is that there is a theoretical algorithm, called Shorʼs algorithm, that would be able to factor such a number in reasonable time on a quantum computer. Right now, quantum computers are far from practical, but it does appear that if someone in the future manages to build one thatʼs sufficiently large, RSA becomes ineffective.

Can anyone comment on how close we are to having Shor's algorithm on a quantum computer? Is feasible like the moon landing was in 1962 when Kennedy announced that "We choose to go to the Moon" (hard, but possible with a lot of money).

Or is it still something that we have no clue how to get to?

ctz•7mo ago
https://pqcrypto2025.iis.sinica.edu.tw/slides/Invited3.pdf

edit: video if you prefer - https://www.youtube.com/watch?v=nJxENYdsB6c

baxtr•7mo ago
So it’s not like the moon landing since the horizon is much longer than a decade.
z3phyr•7mo ago
I think cryptanalysis as a discipline is not massively funded. All of the cryptography is only as strong as the collective failure of all human intelligence so far to break it.

Most people consider cryptography as a "solved" problem, but I don't think it is. I am sure if enough cryptologists try algorithmic methods and are well compensated for it, they will likely find algorithmic weaknesses (and invent new kinds of mathematics) that can bring down complexity of solving such schemes, even before we have real and functional Shor machines.

thaumasiotes•7mo ago
> I think cryptanalysis as a discipline is not massively funded.

Really? That would be a change.

z3phyr•7mo ago
I guess massively is the relative word. But I will stand by the claim that we can discover/invent new mathematical methods that can aid in cryptanalysis, if not directly by cryptographers, then by some adjacent field.
pythops•7mo ago
Looks great, thanks for sharing