208 search results - page 23 / 42 » Arithmetic Operations in the Polynomial Modular Number Syste... |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
BIRTHDAY
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, sounds and images are coded somewhere in time and space by binary sequences. The m...
BIBE
2004
IEEE
13 years 11 months ago
2004
IEEE
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...
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
JSC
2011
12 years 10 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...