Highly Influential

# Towards factoring in SL ( 2 , F 2 n )

@inproceedings{Petit2012TowardsFI, title={Towards factoring in SL ( 2 , F 2 n )}, author={Christophe Petit}, year={2012} }

- Published 2012

The security of many cryptographic protocols relies on the hardness of some computational problems. Besides discrete logarithm or integer factorization, other problems are regularly proposed as potential hard problems. The factorization problem in finite groups is one of them. Given a finite group G, a set of generators S for this group and an element g ∈ G, the factorization problem asks for a “short” representation of g as a product of the generators. The problem is related to a famous… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

0 Citations

52 References

Similar Papers