On oracle factoring of integers

12/01/2019
by   Andrzej Dąbrowski, et al.
0

We present an oracle factorisation algorithm which finds a nontrivial factor of almost all squarefree positive integers n based on the knowledge of the number of points on certain elliptic curves in residue rings modulo n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/25/2019

Factorization and malleability of RSA modules, and counting points on elliptic curves modulo N

In this paper we address two different problems related with the factori...
research
04/21/2022

Murmurations of elliptic curves

We investigate the average value of the pth Dirichlet coefficients of el...
research
06/30/2019

Genus 2 Supersingular Isogeny Oblivious Transfer

We present an oblivious transfer scheme that extends the proposal made b...
research
02/01/2022

Rethinking the notion of oracle: A link between synthetic descriptive set theory and effective topos theory

We present three different perspectives of oracle. First, an oracle is a...
research
08/03/2020

Classification from Ambiguity Comparisons

Labeling data is an unavoidable pre-processing procedure for most machin...
research
12/03/2019

Decentralized Common Knowledge Oracles

We define and analyze three mechanisms for getting common knowledge, a p...
research
09/07/2020

A Fast Parametric Ellipse Algorithm

This paper describes a 2-D graphics algorithm that uses shifts and adds ...

Please sign up or login with your details

Forgot password? Click here to reset