Factorizing composite number n= qr, where q and r are two large primes, and finding
discrete logarithm modulo large prime number p are two difficult computational problems …

Abstract In 1993 Boo Barkee and others have written a paper “Why you cannot even hope to
use Gröbner Bases in Public Key Cryptography: an open letter to a scientist who failed and a …

Many computer algebra systems lack modern user-friendly software environment. Poorly
designed interface depreciates rich mathematical ideas implemented in calculation engine …

We study the max-min paths problem, which represents a game version of the shortest and
the longest paths problem in a weighted directed graph. In this problem the vertex set V of …

The article is based on experience of implementation of computer algebra system Bergman
and on analysis of other symbolic computation systems. It is noted that many symbolic …

Any finitely generated associative algebra can be presented as a factor of the free
associative algebra. Therefore computations in the free algebra have many applications in …

Evolution of the informatization notion (which assumes automation of majority of human
activities applying computers, computer networks, information technologies) towards the …

In a present paper a problem of classification of Aff (2; R)-orbits' dimensions is considered
on example of an autonomous two-dimensional affine differential system of first order …

Conclusion In the basis of the proposed approach there is the principle of storage of primary
information that characterizes activity of a researcher or a research institution. It is this …

Computational Environment Generation for Computer Algebra Systems Page 1 Computational
Environment Generation for Computer Algebra Systems Svetlana Cojocaru Institute of …