Sciweavers

363 search results - page 2 / 73
» Code Generation for Polynomial Multiplication
Sort
View
FPL
2006
Springer
223views Hardware» more  FPL 2006»
13 years 10 months ago
From Equation to VHDL: Using Rewriting Logic for Automated Function Generation
This paper presents a novel tool flow combining rewriting logic with hardware synthesis. It enables the automated generation of synthesizable VHDL code from mathematical equations...
Carlos Morra, M. Sackmann, Sunil Shukla, Jürg...
EUROCRYPT
2003
Springer
13 years 11 months ago
Predicting the Shrinking Generator with Fixed Connections
We propose a novel distinguishing attack on the shrinking generator with known feedback polynomial for the generating LFSR. The attack can e.g. reliably distinguish a shrinking gen...
Patrik Ekdahl, Willi Meier, Thomas Johansson
CATS
2006
13 years 7 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
CMA
2010
183views more  CMA 2010»
13 years 3 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis
CSL
2003
Springer
13 years 11 months ago
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
Thomas Eiter, Kazuhisa Makino