A Deep Dive into Logjumps: a Faster Modular Reduction Algorithm

baincapitalcrypto.com

A Deep Dive into Logjumps: a Faster Modular Reduction Algorithm

baincapitalcrypto.com

Natanael@infosec.pub to Cryptography @ Infosec.pub@infosec.pubEnglish · 2 months ago

Logjumps is a recently discovered technique for modular reduction over large prime fields.

You must log in or # to comment.

Chat

Cryptography @ Infosec.pub@infosec.pub

crypto@infosec.pub

Create a post

You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !crypto@infosec.pub

Questions, answers, discussions, and literature on the theory and practice of cryptography

Rules (longer version here)

Stick to cryptography / infosec
Be a good netizen - be kind, act in good faith, maintain high quality, don’t mislead
Link directly to original sources
Don’t use us to cheat on challenges or tests!
Crypto review requests must show the algorithm
CTF / challenges and puzzles must use modern crypto
Avoid making duplicate posts
All use of AI / LLM and their prompts MUST be disclosed in your submissions and comments

##Related resources;

Reddit cryptography forums 1 & 2; /r/crypto /r/cryptography
Cryptology ePrint archive
Discussion site for ePrint papers
Libera Chat’s IRC:s #crypto - (IRC protocol URL)
Metzdowd cryptography mailing list
Randombit cryptography mailing list
StackExchange cryptography community

Visibility: Public

This community can be federated to other instances and be posted/commented in by their users.

5 users / day
5 users / week
5 users / month
5 users / 6 months
0 local subscribers
529 subscribers
50 Posts
0 Comments
Modlog