Sciweavers

193 search results - page 17 / 39
» Short Bases of Lattices over Number Fields
Sort
View
DAM
2008
92views more  DAM 2008»
13 years 8 months ago
Applications to cryptography of twisting commutative algebraic groups
We give an overview on twisting commutative algebraic groups and applications to discrete log based cryptography. We explain how discrete log based cryptography over extension fie...
Alice Silverberg
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
14 years 6 hour ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
14 years 2 months ago
Hierarchical genetic programming based on test input subsets
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of d...
David Jackson
3DIM
1999
IEEE
14 years 23 days ago
3D Shape Recovery and Registration based on the Projection of Non Coherent Structured Light
This paper describes the main features of an optical instrument for the acquisition and the registration of 3D images. The system exploits the projection of structured light, spec...
Roberto Rodella, Giovanna Sansoni
FOGA
1998
13 years 9 months ago
Schemata as Building Blocks: Does Size Matter?
We analyze the schema theorem and the building block hypothesis using a recently derived, exact schemata evolution equation. We derive a new schema theorem based on the concept of...
Christopher R. Stephens, Henri Waelbroeck, R. Agui...