Constructing a Pseudo-Free Family of Finite Computational Groups under the General Integer Factoring Intractability Assumption

Anokhin, M.

Constructing a Pseudo-Free Family of Finite Computational Groups under the General Integer Factoring Intractability Assumptionстатья Электронная публикация

Автор: Anokhin Mikhail
Журнал: Electronic Colloquium on Computational Complexity (ECCC)
Номер: TR12-114
Год издания: 2012
Аннотация: We construct a provably pseudo-free family of finite computational groups under the general integer factoring intractability assumption. This family has exponential size. But each element of a group in our pseudo-free family is represented by infinitely many bit strings.
Добавил в систему: Анохин Михаил Игоревич

	ИСТИНА	Войти в систему Регистрация
	ФНКЦ РР
	Главная Поиск Статистика О проекте Помощь

ИСТИНА

ФНКЦ РР

Constructing a Pseudo-Free Family of Finite Computational Groups under the General Integer Factoring Intractability Assumptionстатья Электронная публикация