Sciweavers

28 search results - page 5 / 6
» Cunningham numbers in modular arithmetic
Sort
View
BIBE
2004
IEEE
107views Bioinformatics» more  BIBE 2004»
15 years 3 months ago
Fast Parallel Molecular Algorithms for DNA-based Computation: Factoring Integers
The RSA public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form...
Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo
EJC
2008
14 years 11 months ago
Equivelar maps on the torus
Abstract. We give a classification of all equivelar polyhedral maps on the torus. In particular, we classify all triangulations and quadrangulations of the torus admitting a vertex...
Ulrich Brehm, Wolfgang Kühnel
ICCD
2007
IEEE
151views Hardware» more  ICCD 2007»
15 years 8 months ago
Benchmarks and performance analysis of decimal floating-point applications
The IEEE P754 Draft Standard for Floating-point Arithmetic provides specifications for Decimal Floating-Point (DFP) formats and operations. Based on this standard, many developer...
Liang-Kai Wang, Charles Tsen, Michael J. Schulte, ...
CTRSA
2004
Springer
114views Cryptology» more  CTRSA 2004»
15 years 5 months ago
Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems
This paper presents a scalable hardware implementation of both commonly used public key cryptosystems, RSA and Elliptic Curve Cryptosystem (ECC) on the same platform. The introduce...
Lejla Batina, Geeke Bruin-Muurling, Siddika Berna ...
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
13 years 2 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart