Skip to content

issues Search Results · repo:jvdsn/crypto-attacks language:Python

Filter by

24 results
 (82 ms)

24 results

injvdsn/crypto-attacks (press backspace or delete to remove)

Thank you very much for your library sir and I want to ask when will be Fourier analysis attack available this is very interesting script.
  • dexizer7799
  • 1
  • Opened 
    21 days ago
  • #29

Hello, I found some minor issues in key_reuse.py file of the One Time Pad. 1) In _hamming distance function it is best to use: distance += bin(x ^ y).count( 1 ) for compatibility with Python versions ...
  • jonpism
  • 3
  • Opened 
    on Jan 13
  • #28

Due to this equality, if a curve with a certain j-invariant is not anomalous, we check if the group order is p + 2. If this is the case, then we compute a quadratic twist of the curve (with sufficiently ...
  • ytrezq
  • Opened 
    on Dec 6, 2024
  • #27

Required for #24. The underlying idea is to factorize $F_p^{12}-1$ and solve power root for each resulting moduli. I can share https://ieeexplore.ieee.org/abstract/document/6530387 privately for more details. ...
  • ytrezq
  • Opened 
    on Dec 4, 2024
  • #26

For any binary curve, the aim is to map the discrete logarithm to an hyperelliptic curve. It’s something as much well known as pairings. See https://hal.science/hal-01121942/document for details.
  • ytrezq
  • Opened 
    on Nov 30, 2024
  • #25

Pairings can be used for attacking the discrete logarithm on supersingular curves as you propose, it’s used for encryption or signature purposes. https://pdfupload.io/docs/8453308d#%5B%7B%22num%22%3A2790%2C%22gen%22%3A0%7D%2C%7B%22name%22%3A%22FitH%22%7D%2C343%5D ...
  • ytrezq
  • Opened 
    on Nov 28, 2024
  • #24

As far I understand, 1 distinctive feature of such algorithm is it fully works in subgroups/suborders. All other index calculus algorithms can do this only for the linear algebra phase and thus their ...
  • ytrezq
  • 3
  • Opened 
    on Nov 21, 2024
  • #23

It’s perfectly possible to use Nigel’s Smart algorithm for anomalous curves over extension fields. The problem is I failed to understand this paper myself enough to implement the variant that works in ...
  • ytrezq
  • 15
  • Opened 
    on Nov 16, 2024
  • #22

https://github.com/jvdsn/crypto-attacks/blob/master/shared/hensel.py#L33 FIX: # roots = list(range(p)) roots = range(p) because list(range(big_p)) will use so much memory
  • uvicorn
  • 3
  • Opened 
    on Feb 26, 2024
  • #20

same problem: https://github.com/J08nY/ecgen/issues/23 pari.qfbsolve(pari.Qfb(1, 0, -D), 4 * m, 1) is slow because pari try to factor m every time. our solution: m = Integer(sys.argv[1]) out = subprocess.check_output([ ...
  • uvicorn
  • 2
  • Opened 
    on Jan 4, 2024
  • #19
Issue origami icon

Learn how you can use GitHub Issues to plan and track your work.

Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub Issues
ProTip! 
Restrict your search to the title by using the in:title qualifier.
Issue origami icon

Learn how you can use GitHub Issues to plan and track your work.

Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub Issues
ProTip! 
Restrict your search to the title by using the in:title qualifier.
Issue search results · GitHub