attacks

package
v1.0.2 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Dec 17, 2021 License: Apache-2.0 Imports: 31 Imported by: 1

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Attack 

type Attack struct {
	Name          string
	SupportsMulti bool
	Unnatended    bool
	F             attackFunc
}

Attack encodes a single attack and what features it supports.

type Attacks 

type Attacks struct {
	Supported []*Attack
}

Attacks wraps a slice of Attack objects that are supported. 

var SupportedAttacks *Attacks

SupportedAttacks stores the list of registered attacks we support.

func NewAttacks 

func NewAttacks() *Attacks

NewAttacks constructs a new Attacks object.

func (*Attacks) Execute 

func (a *Attacks) Execute(name string, t []*keys.RSA) error

Execute executes the named attack against t.

func (*Attacks) IsSupported 

func (a *Attacks) IsSupported(name string) bool

IsSupported returns true if name attack is supported.

func (*Attacks) RegisterAttack 

func (a *Attacks) RegisterAttack(name string, multi bool, unnatended bool, f attackFunc)

RegisterAttack adds a new attack to the receiving Attacks.

func (*Attacks) SupportsMulti 

func (a *Attacks) SupportsMulti(name string) bool

SupportsMulti returns true if the attack supports multi-key attacks.

Source Files

View all Source files

Directories

Path Synopsis
Package brokenrsa implements a common broken rsa implementation against a ciphertext.
 Package brokenrsa implements a common broken rsa implementation against a ciphertext.
Package defectivee implements a common broken rsa implementation where e and phi(n) are not coprime by finding the root of unity modulo n.
 Package defectivee implements a common broken rsa implementation where e and phi(n) are not coprime by finding the root of unity modulo n.
Package ecm implements the elliptic curve method of factorization and was originally written by Keith Randall and distributed under a Public Domain license from his Github here: https://github.com/randall77/factorlib
 Package ecm implements the elliptic curve method of factorization and was originally written by Keith Randall and distributed under a Public Domain license from his Github here: https://github.com/randall77/factorlib
Package jwtmodulus implements recoving an RS256 modulus given two JWTs.
 Package jwtmodulus implements recoving an RS256 modulus given two JWTs.
Package londahl implements Carl Löndahl's method of factorization for close primes and is based on code from RsaCtfTool https://github.com/grocid/CTF and Carl's CTF writeups https://github.com/grocid/CTF
 Package londahl implements Carl Löndahl's method of factorization for close primes and is based on code from RsaCtfTool https://github.com/grocid/CTF and Carl's CTF writeups https://github.com/grocid/CTF
Package oraclemodulus implements recoving an RSA modulus given the ciphertext of 2,3,4 and 9.
 Package oraclemodulus implements recoving an RSA modulus given the ciphertext of 2,3,4 and 9.
Package partiald implements an attack against the private exponent of RSA when >= 50% of the LSB of d are known.
 Package partiald implements an attack against the private exponent of RSA when >= 50% of the LSB of d are known.
Package signatures implements recoving the modulus from signatures and plaintexts.
 Package signatures implements recoving the modulus from signatures and plaintexts.
Package wienervariant implements Andrej Dujella's variant on Wiener's RSA attack.
 Package wienervariant implements Andrej Dujella's variant on Wiener's RSA attack.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.