binary cr yp to d j bernstein university of illinois at
play

binary.cr.yp.to D. J. Bernstein University of Illinois at Chicago - PDF document

Jan 14, 2024 •153 likes •202 views

binary.cr.yp.to D. J. Bernstein University of Illinois at Chicago NSF ITR0716498 2003 Rodr guez-Henr quezKo c, 2005 ChangKimParkLim, 2006 WeimerskirchPaar, 2006 von zur GathenShokrollahi, 2007

  1. binary.cr.yp.to D. J. Bernstein University of Illinois at Chicago NSF ITR–0716498

  2. 2003 Rodr´ ıguez-Henr´ ıquez–Ko¸ c, 2005 Chang–Kim–Park–Lim, 2006 Weimerskirch–Paar, 2006 von zur Gathen–Shokrollahi, 2007 Peter–Langend¨ orfer: minimizing bit operations for poly mult mod 2, using Karatsuba etc. binary.cr.yp.to/m.html : even fewer bit operations. Has been used in new ECC software speed records. Maybe useful for hardware!

  3. binary.cr.yp.to /linearmod2.html : new paper describing algorithm to compile any linear map mod 2 into a series of xors. Compiled code is efficient: � 8 xors for e.g. 922 random 64-bit-to-64-bit map. Often competitive with ad-hoc optimization. Compilation algorithm is fast, surprisingly simple.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Binary Edwards Curves Daniel J. Bernstein Tanja Lange University of Illinois at Chicago and

Binary Edwards Curves Daniel J. Bernstein Tanja Lange University of Illinois at Chicago and

Binary Edwards Curves Daniel J. Bernstein Tanja Lange University of Illinois at Chicago and Technische Universiteit Eindhoven djb@cr.yp.to tanja@hyperelliptic.org 12.08.2008 joint work with Reza Rezaeian Farashahi, Eindhoven D. J. Bernstein

428 views • 27 slides
Batch binary Edwards D. J. Bernstein University of Illinois at Chicago NSF ITR0716498 p

Batch binary Edwards D. J. Bernstein University of Illinois at Chicago NSF ITR0716498 p

Batch binary Edwards D. J. Bernstein University of Illinois at Chicago NSF ITR0716498 p index calculus Classic F needs to check smoothness < p . of many positive integers Smooth integer: integer > y . with no prime divisors y

475 views • 8 slides
Binary Edwards Curves Daniel J. Bernstein Tanja Lange University of Illinois at Chicago and

Binary Edwards Curves Daniel J. Bernstein Tanja Lange University of Illinois at Chicago and

Binary Edwards Curves Daniel J. Bernstein Tanja Lange University of Illinois at Chicago and Technische Universiteit Eindhoven djb@cr.yp.to tanja@hyperelliptic.org 09.05.2008 joint work with Reza Rezaeian Farashahi, Eindhoven

571 views • 33 slides
The DNS security mess D. J. Bernstein Thanks to: University of Illinois at Chicago NSF

The DNS security mess D. J. Bernstein Thanks to: University of Illinois at Chicago NSF

The DNS security mess D. J. Bernstein Thanks to: University of Illinois at Chicago NSF CCR9983950 Alfred P. Sloan Foundation Math Sciences Research Institute University of California at Berkeley

596 views • 33 slides
Predicting NFS time D. J. Bernstein University of Illinois at Chicago Thanks to: NSF

Predicting NFS time D. J. Bernstein University of Illinois at Chicago Thanks to: NSF

Predicting NFS time D. J. Bernstein University of Illinois at Chicago Thanks to: NSF DMS9600083 NSF DMS9970409 NSF DMS0140542 Alfred P. Sloan Foundation NSF ITR0716498 T as the time Define n . used by NFS to factor T depends on

433 views • 31 slides
Smaller decoding exponents: ball-collision decoding D. J. Bernstein University of Illinois at

Smaller decoding exponents: ball-collision decoding D. J. Bernstein University of Illinois at

Smaller decoding exponents: ball-collision decoding D. J. Bernstein University of Illinois at Chicago Joint work with: Tanja Lange Technische Universiteit Eindhoven Christiane Peters University of Illinois at Chicago Context: speed What is

500 views • 36 slides
Jet list decoding D. J. Bernstein University of Illinois at Chicago Thanks to: NSF (1018836)

Jet list decoding D. J. Bernstein University of Illinois at Chicago Thanks to: NSF (1018836)

Jet list decoding D. J. Bernstein University of Illinois at Chicago Thanks to: NSF (1018836) NIST (60NANB10D263) Cisco (University Research Program) Interpolation Fix coprime 1 Z 0 . Remainder repn

1.19k views • 70 slides
ECM speed records on CPU and GPU D. J. Bernstein University of Illinois at Chicago NSF

ECM speed records on CPU and GPU D. J. Bernstein University of Illinois at Chicago NSF

ECM speed records on CPU and GPU D. J. Bernstein University of Illinois at Chicago NSF ITR0716498 New EECM web site: http://eecm.cr.yp.to Joint work with: 1 2 3 Tanja Lange 1 Peter Birkner 1 Christiane Peters 2 3 Chen-Mou Cheng 2 3

470 views • 29 slides
Breaking DNSSEC D. J. Bernstein University of Illinois at Chicago Advertisement:

Breaking DNSSEC D. J. Bernstein University of Illinois at Chicago Advertisement:

Breaking DNSSEC D. J. Bernstein University of Illinois at Chicago Advertisement: Special-purpose hardware for attacking cryptographic systems, Lausanne, 2009.09.0910; http://sharcs.org . 1993.11 Galvin: The DNS Security design

1.05k views • 65 slides
The DNS security mess D. J. Bernstein University of Illinois at Chicago & Technische

The DNS security mess D. J. Bernstein University of Illinois at Chicago & Technische

The DNS security mess D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven Paul Vixie, 1995, on DNSSEC: This sounds simple but it has deep reaching consequences in both the protocol and the

2.05k views • 180 slides
D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven 1. New

D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven 1. New

D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven 1. New CAESAR project: C ompetition for A uthenticated E ncryption: S ecurity, A pplicability, R obustness http://competitions.cr.yp.to NIST has

546 views • 42 slides
Bit attacks D. J. Bernstein University of Illinois at Chicago From: andr...@ise... Date: 11 Feb

Bit attacks D. J. Bernstein University of Illinois at Chicago From: andr...@ise... Date: 11 Feb

Bit attacks D. J. Bernstein University of Illinois at Chicago From: andr...@ise... Date: 11 Feb 2009 14:48 Subject: Question Running CubeHash8/1 with 64 bit output over 2 different datasets give me the same hash under Visual Studio. Using

394 views • 13 slides
The Poly1305-AES message-authentication code D. J. Bernstein Thanks to: University of Illinois

The Poly1305-AES message-authentication code D. J. Bernstein Thanks to: University of Illinois

The Poly1305-AES message-authentication code D. J. Bernstein Thanks to: University of Illinois at Chicago NSF CCR9983950 Alfred P. Sloan Foundation The AES function (Rijndael 1998 Daemen Rijmen; 2001

867 views • 29 slides
Factorization myths D. J. Bernstein Thanks to: University of Illinois at Chicago NSF

Factorization myths D. J. Bernstein Thanks to: University of Illinois at Chicago NSF

Factorization myths D. J. Bernstein Thanks to: University of Illinois at Chicago NSF DMS0140542 Alfred P. Sloan Foundation and 611 + for small : Sieving 1 612 2 2 3 3 2 2 613 3 3 614 2 4 2 2 615 3 5 5 5 616 2 2 2

488 views • 36 slides
Factorization myths D. J. Bernstein Thanks to: University of Illinois at Chicago NSF

Factorization myths D. J. Bernstein Thanks to: University of Illinois at Chicago NSF

Factorization myths D. J. Bernstein Thanks to: University of Illinois at Chicago NSF DMS0140542 Alfred P. Sloan Foundation and 611 + for small : Sieving 1 612 2 2 3 3 2 2 613 3 3 614 2 4 2 2 615 3 5 5 5 616 2 2 2

676 views • 32 slides
Building circuits for integer factorization D. J. Bernstein Thanks to: University of Illinois

Building circuits for integer factorization D. J. Bernstein Thanks to: University of Illinois

Building circuits for integer factorization D. J. Bernstein Thanks to: University of Illinois at Chicago NSF DMS0140542 Alfred P. Sloan Foundation I want to work for NSA as an independent

706 views • 49 slides
Branch-cut-and-price algorithms for the vehicle routing problem with backhauls Eduardo Queiroga 1

Branch-cut-and-price algorithms for the vehicle routing problem with backhauls Eduardo Queiroga 1

Branch-cut-and-price algorithms for the vehicle routing problem with backhauls Eduardo Queiroga 1 Yuri Frota 1 Ruslan Sadykov 2 Anand Subramanian 3 Eduardo Uchoa 1 Thibaut Vidal 4 1 2 3 4 Univ. Federal Inria Bordeaux, Univ. Federal PUC-Rio

606 views • 24 slides
DISTRIBUTED SYSTEMS: GROUP COMMUNICATION Hakim Weatherspoon CS6410 Slides borrowed liberally

DISTRIBUTED SYSTEMS: GROUP COMMUNICATION Hakim Weatherspoon CS6410 Slides borrowed liberally

1 DISTRIBUTED SYSTEMS: GROUP COMMUNICATION Hakim Weatherspoon CS6410 Slides borrowed liberally from past presentations from Julia Proft, Utkarsh Mall, Scott Phung, and Jared Cantwell The Process Group Approach to Reliable Distributed Computing

531 views • 35 slides
WG on Informatics Education: CECE Members of the Committee on European Computing Education

WG on Informatics Education: CECE Members of the Committee on European Computing Education

WG on Informatics Education: CECE Members of the Committee on European Computing Education Jan Vahrenhold, University of Mnster, Germany Enrico Nardelli, University of Rome "Tor Vergata", Italy Cristina Pereira,

286 views • 24 slides
Outline Multi-Engine Machine Translation 1 Alignment Search Space Features Match Model

Outline Multi-Engine Machine Translation 1 Alignment Search Space Features Match Model

Multi-Engine Machine Translation Model Combination Other Combination Approaches Outline Multi-Engine Machine Translation 1 Alignment Search Space Features Match Model Combination 2 Other Combination Approaches 3 Kenneth Heafield

454 views • 26 slides
A Tiling Based Programming Model and Its Suppor7ve Tools

A Tiling Based Programming Model and Its Suppor7ve Tools

A Tiling Based Programming Model and Its Suppor7ve Tools Didem Unat , Burak Bastem, Nufail Farooqi Ko University, Istanbul Weiqun Zhang, Tan Nguyen,

557 views • 19 slides
Recognize some structural properties of a finite group from the orders of its elements Mercede

Recognize some structural properties of a finite group from the orders of its elements Mercede

Recognize some structural properties of a finite group from the orders of its elements Mercede MAJ UNIVERSIT DEGLI STUDI DI SALERNO Cemal Ko - Algebra Days Middle East Technical University April, 22-23, 2016 Let G be a periodic group.

889 views • 68 slides
CSE 262 Lecture 11 GPU Implementation of stencil methods (II) Announcements Final

CSE 262 Lecture 11 GPU Implementation of stencil methods (II) Announcements Final

CSE 262 Lecture 11 GPU Implementation of stencil methods (II) Announcements Final presentations u Friday March 13 th , 10:30 AM to 1:00PM u Room 3217, CSE Building (EBU3B) Scott B. Baden / CSE 262 / UCSD, Wi '15 2 Todays lecture

641 views • 31 slides
Transfer Matrix Formulation of Scattering Theory in Arbitrary Dimensions Ali Mostafazadeh (Ko

Transfer Matrix Formulation of Scattering Theory in Arbitrary Dimensions Ali Mostafazadeh (Ko

Transfer Matrix Formulation of Scattering Theory in Arbitrary Dimensions Ali Mostafazadeh (Ko University) in collaboration with Farhang Loran (Isfahan Univ. Tech.) Supported by Turkish Acad. Sci. & TB TAK (Project 112T951) Outline: -

669 views • 62 slides

More recommend