UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A scalable architecture for modular multiplication based on Montgomery's algorithm

IEEE transactions on computers, 2003-09, Vol.52 (9), p.1215-1221

2003

Volltextzugriff (PDF)

Mastrovito multiplier for general irreducible polynomials

IEEE transactions on computers, 2000-05, Vol.49 (5), p.503-518

2000

Volltextzugriff (PDF)

Analysis of sliding window techniques for exponentiation

Computers & mathematics with applications (1987), 1995, Vol.30 (10), p.17-24

KOC, C. K

1995

Volltextzugriff (PDF)

Constructing composite field representations for efficient conversion

IEEE transactions on computers, 2003-11, Vol.52 (11), p.1391-1398

2003

Volltextzugriff (PDF)

Halley's method for the matrix sector function

IEEE transactions on automatic control, 1995-05, Vol.40 (5), p.944-949

1995

Volltextzugriff (PDF)

Mastrovito multiplier for all trinomials

IEEE transactions on computers, 1999-05, Vol.48 (5), p.522-527

1999

Volltextzugriff (PDF)

An efficient optimal normal basis type II multiplier

IEEE transactions on computers, 2001-01, Vol.50 (1), p.83-87

2001

Volltextzugriff (PDF)

Complexity analysis of wavelet signal decomposition and reconstruction

IEEE transactions on aerospace and electronic systems, 1994-07, Vol.30 (3), p.910-918

1994

Volltextzugriff (PDF)

Parallel multipliers based on special irreducible pentanomials

IEEE transactions on computers, 2003-12, Vol.52 (12), p.1535-1542

2003

Volltextzugriff (PDF)

Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

IEEE transactions on computers, 1998-03, Vol.47 (3), p.353-356

1998

Volltextzugriff (PDF)

Computation of the matrix sign function using continued fraction expansion

IEEE transactions on automatic control, 1994-08, Vol.39 (8), p.1644-1647

1994

Volltextzugriff (PDF)

The Montgomery modular inverse-revisited

IEEE transactions on computers, 2000-07, Vol.49 (7), p.763-766

2000

Volltextzugriff (PDF)

Carry-save adders for computing the product AB modulo N

Electronics letters, 1990, Vol.26 (13), p.899-900

1990

Volltextzugriff (PDF)

A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors

Journal of computational and applied mathematics, 1989, Vol.27 (1), p.95-108

1989

Volltextzugriff (PDF)

Multiplier architectures for GF(p) and GF(2n)

IEE proceedings. Computers and digital techniques, 2004-03, Vol.151 (2), p.147

2004

Volltextzugriff (PDF)

Schwarz-Christoffel transformation for the simulation of two-dimensional capacitance (VLSI circuits)

IEEE transactions on computer-aided design of integrated circuits and systems, 1989-09, Vol.8 (9), p.1025-1027

1989

Volltextzugriff (PDF)

Efficient unified Montgomery inversion with multibit shifting

IEE proceedings. Computers and digital techniques, 2005-07, Vol.152 (4), p.489

2005

Volltextzugriff (PDF)

A scalable architecture for Montgomery multiplication

Lecture notes in computer science, 1999, p.94-108

1999

Volltextzugriff (PDF)

Analyzing and comparing Montgomery multiplication algorithms

IEEE MICRO, 1996-06, Vol.16 (3), p.26-33

1996

Volltextzugriff (PDF)

Exponentiation using canonical recoding

Theoretical computer science, 1994-07, Vol.129 (2), p.407-417

1994

Volltextzugriff (PDF)

Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 1998, p.294

1998

Volltextzugriff (PDF)

Montgomery reduction with even modulus

IEE proceedings. Computers and digital techniques, 1994-09, Vol.141 (5), p.314

Koc, C.K.

1994

Volltextzugriff (PDF)

A parallel algorithm for exact solution of linear equations via congruence technique

Computers & mathematics with applications (1987), 1992-06, Vol.23 (12), p.13-24

KOC, C. K

1992

Volltextzugriff (PDF)

Multi-operand modulo addition using carry save adders

Electronics letters, 1990, Vol.26 (6), p.361-363

1990

Volltextzugriff (PDF)

Cryptographic Hardware and Embedded Systems - CHES 2000: Second International Workshop Worcester, MA, USA, August 17-18, 2000 Proceedings

2000, 2000

Volltextzugriff (PDF)

1 – 25 von 326

Menü

Weitere Dienste

Einstellungen

A scalable architecture for modular multiplication based on Montgomery's algorithm

Mastrovito multiplier for general irreducible polynomials

Analysis of sliding window techniques for exponentiation

Constructing composite field representations for efficient conversion

Halley's method for the matrix sector function

Mastrovito multiplier for all trinomials

An efficient optimal normal basis type II multiplier

Complexity analysis of wavelet signal decomposition and reconstruction

Parallel multipliers based on special irreducible pentanomials

Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

Computation of the matrix sign function using continued fraction expansion

The Montgomery modular inverse-revisited

Carry-save adders for computing the product AB modulo N

A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors

Multiplier architectures for GF(p) and GF(2n)

Schwarz-Christoffel transformation for the simulation of two-dimensional capacitance (VLSI circuits)

Efficient unified Montgomery inversion with multibit shifting

A scalable architecture for Montgomery multiplication

Analyzing and comparing Montgomery multiplication algorithms

Exponentiation using canonical recoding

Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

Montgomery reduction with even modulus

A parallel algorithm for exact solution of linear equations via congruence technique

Multi-operand modulo addition using carry save adders

Cryptographic Hardware and Embedded Systems - CHES 2000: Second International Workshop Worcester, MA, USA, August 17-18, 2000 Proceedings

Suchergebnisse filtern