An Implementation of the Extended Tower Number Field Sieve using 4d Sieving in a Box and a Record Computation in Fp4

12/09/2022
by   Oisin Robinson, et al.
0

We report on an implementation of the Extended Tower Number Field Sieve (ExTNFS) and record computation in a medium characteristic finite field Fp4 of 512 bits size. We show that sieving in a box (orthotope) for collecting relations for ExTNFS is still fast in 4 dimensions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/08/2018

Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields

Suppose a database containing M records is replicated across N servers, ...
research
06/25/2020

A Fast Finite Field Multiplier for SIKE

Various post-quantum cryptography algorithms have been recently proposed...
research
09/28/2021

Extended Irreducible Binary Sextic Goppa codes

Let n (>3) be a prime number and F_2^n a finite field of 2^n elements. L...
research
07/05/2019

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

Elliptic bases, introduced by Couveignes and Lercier in 2009, give an el...
research
05/16/2017

Engineering Record And Replay For Deployability: Extended Technical Report

The ability to record and replay program executions with low overhead en...
research
07/12/2011

A Variation of the Box-Counting Algorithm Applied to Colour Images

The box counting method for fractal dimension estimation had not been ap...

Please sign up or login with your details

Forgot password? Click here to reset