nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
About the algebraic solutions of smallest enclosing cylinders problems
|
Petitjean, Michel |
|
2012 |
|
3-4 |
p. 151-164 |
artikel |
2 |
A combinatorial approach to involution and δ-regularity I: involutive bases in polynomial algebras of solvable type
|
Seiler, Werner M. |
|
2009 |
|
3-4 |
p. 207-259 |
artikel |
3 |
A combinatorial approach to involution and δ-regularity II: structure analysis of polynomial modules with pommaret bases
|
Seiler, Werner M. |
|
2009 |
|
3-4 |
p. 261-338 |
artikel |
4 |
A Linear Time Matrix Key Agreement Protocol Over Small Finite Fields
|
Anshel, Iris |
|
2006 |
|
3-4 |
p. 195-203 |
artikel |
5 |
A multivariate based threshold ring signature scheme
|
Petzoldt, Albrecht |
|
2013 |
|
3-4 |
p. 255-275 |
artikel |
6 |
An Efficient Algorithm for Software Generation of Binary Linear Recurrences
|
Burman, Sanjay |
|
2004 |
|
3-4 |
p. 201-203 |
artikel |
7 |
A nonexistence certificate for projective planes of order ten with weight 15 codewords
|
Bright, Curtis |
|
|
|
3-4 |
p. 195-213 |
artikel |
8 |
A trigonometric approach for Dickson polynomials over fields of characteristic two
|
Lima, Juliano B. |
|
|
|
3-4 |
p. 253-270 |
artikel |
9 |
Boomerang uniformity of normalized permutation polynomials of low degree
|
Wang, Yan-Ping |
|
|
|
3-4 |
p. 307-322 |
artikel |
10 |
Classification of the odd sets in $$\hbox {PG}(4,4)$$PG(4,4) and its application to coding theory
|
Tanaka, Taichiro |
|
2013 |
|
3-4 |
p. 179-196 |
artikel |
11 |
Combinatorial Group Theory and Public Key Cryptography
|
Shpilrain, Vladimir |
|
2006 |
|
3-4 |
p. 291-302 |
artikel |
12 |
Computation of the Decomposition Group of a Triangular Ideal
|
Abdeljaouad-Tej, I. |
|
2004 |
|
3-4 |
p. 279-294 |
artikel |
13 |
Construction of Cryptographically Important Boolean Permutations
|
Zhang, Wenying |
|
2004 |
|
3-4 |
p. 173-177 |
artikel |
14 |
Convolutional Goppa codes defined on fibrations
|
Iglesias Curto, J. I. |
|
2012 |
|
3-4 |
p. 165-178 |
artikel |
15 |
Cryptanalysis of a key exchange protocol based on the endomorphisms ring End$${(\mathbb{Z}_{p} \times \mathbb{Z}_{p^2})}$$
|
Kamal, Abdel Alim |
|
2012 |
|
3-4 |
p. 143-149 |
artikel |
16 |
Cryptosystems using Linear Groups
|
Baumslag, Gilbert |
|
2006 |
|
3-4 |
p. 205-217 |
artikel |
17 |
DFT-based Word Normalization in Finite Supersolvable Groups
|
Müller, Meinard |
|
2004 |
|
3-4 |
p. 213-231 |
artikel |
18 |
E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation
|
Piva, Fabio |
|
2013 |
|
3-4 |
p. 277-308 |
artikel |
19 |
Evaluating geometric queries using few arithmetic operations
|
Grimson, R. |
|
2012 |
|
3-4 |
p. 179-193 |
artikel |
20 |
Foreword
|
|
|
2006 |
|
3-4 |
p. 171 |
artikel |
21 |
Foreword: computer algebra in coding theory and cryptography
|
Bouyukliev, Iliya |
|
2013 |
|
3-4 |
p. 157-158 |
artikel |
22 |
Gröbner Basis Cryptosystems
|
Ackermann, Peter |
|
2006 |
|
3-4 |
p. 173-194 |
artikel |
23 |
Hamming distance of repeated-root constacyclic codes of length 2ps over Fpm+uFpm
|
Dinh, Hai Q. |
|
|
|
3-4 |
p. 291-305 |
artikel |
24 |
HELP: a sparse error locator polynomial for BCH codes
|
Ceria, Michela |
|
|
|
3-4 |
p. 215-233 |
artikel |
25 |
Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits
|
Grigoriev, Dima |
|
2006 |
|
3-4 |
p. 239-255 |
artikel |
26 |
List decoding of repeated codes
|
Hernando, Fernando |
|
2013 |
|
3-4 |
p. 237-253 |
artikel |
27 |
Match-Bounded String Rewriting Systems
|
Geser, Alfons |
|
2004 |
|
3-4 |
p. 149-171 |
artikel |
28 |
Minimal Homogeneous Bases for Polynomial Ideals
|
Yılmaz, Erol |
|
2004 |
|
3-4 |
p. 267-278 |
artikel |
29 |
On optimal binary codes with unbalanced coordinates
|
Östergård, Patric R. J. |
|
2013 |
|
3-4 |
p. 197-200 |
artikel |
30 |
On the automorphism group of a binary self-dual $$[120, 60, 24]$$[120,60,24] code
|
Bouyuklieva, Stefka |
|
2013 |
|
3-4 |
p. 201-214 |
artikel |
31 |
On the Bounds of the Bilinear Complexity of Multiplication in Some Finite Fields
|
Ballet, Stéphane |
|
2004 |
|
3-4 |
p. 205-221 |
artikel |
32 |
On the Security of RSA with Primes Sharing Least-Significant Bits
|
Steinfeld, Ron |
|
2004 |
|
3-4 |
p. 179-200 |
artikel |
33 |
On transitive parallelisms of $$PG(3,4)$$PG(3,4)
|
Topalova, Svetlana |
|
2013 |
|
3-4 |
p. 159-164 |
artikel |
34 |
Optimal RS-like LRC codes of arbitrary length
|
Rajput, Charul |
|
|
|
3-4 |
p. 271-289 |
artikel |
35 |
Optimal subcodes of formally self-dual codes and their optimum distance profiles
|
Freibert, Finley |
|
2013 |
|
3-4 |
p. 215-224 |
artikel |
36 |
Optimal $$(v,5,2,1)$$(v,5,2,1) optical orthogonal codes of small $$v$$v
|
Baicheva, Tsonka |
|
2013 |
|
3-4 |
p. 165-177 |
artikel |
37 |
Permutation decoding of codes from generalized Paley graphs
|
Seneviratne, Padmapani |
|
2013 |
|
3-4 |
p. 225-236 |
artikel |
38 |
Polly Two : A New Algebraic Polynomial-based Public-Key Scheme
|
Ly, Le Van |
|
2006 |
|
3-4 |
p. 267-283 |
artikel |
39 |
Polynomial evaluation over finite fields: new algorithms and complexity bounds
|
Elia, Michele |
|
2011 |
|
3-4 |
p. 129-141 |
artikel |
40 |
Representation Attacks on the Braid Diffie-Hellman Public Key Encryption
|
Kalka, Arkadius G. |
|
2006 |
|
3-4 |
p. 257-266 |
artikel |
41 |
Skew constacyclic codes over a non-chain ring Fq[u,v]/⟨f(u),g(v),uv-vu⟩
|
Bhardwaj, Swati |
|
|
|
3-4 |
p. 173-194 |
artikel |
42 |
Special Issue: “Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography” ACA 2019, Montreal, Canada, July 16–20, 2019
|
Guenda, Kenza |
|
|
|
3-4 |
p. 171-172 |
artikel |
43 |
The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and Insufficient
|
Shpilrain, Vladimir |
|
2006 |
|
3-4 |
p. 285-289 |
artikel |
44 |
The invariant functions and invariant-image conditions of the rational Bézier triangles
|
Bez, H. E. |
|
2012 |
|
3-4 |
p. 195-205 |
artikel |
45 |
Various New Expressions for Subresultants and Their Applications
|
Diaz–Toca, Gema M. |
|
2004 |
|
3-4 |
p. 233-266 |
artikel |
46 |
Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
|
Barkee, Boo |
|
|
|
3-4 |
p. 235-252 |
artikel |